./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1092d.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/float-newlib/float_req_bl_1092d.c -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.graphml --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 e19935633e394bb6492032fcd7d527ec5c122487e90b0c79abdb6dfbdef24c42 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:17,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:17,771 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:17,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:17,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:17,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:17,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:17,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:17,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:17,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:17,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:17,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:17,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:17,825 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:17,826 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:17,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:17,828 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:17,830 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:17,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:17,835 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:17,839 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:17,840 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:17,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:17,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:17,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:17,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:17,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:17,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:17,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:17,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:17,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:17,845 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:17,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:17,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:17,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:17,847 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:17,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:17,848 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:17,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:17,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:17,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:17,851 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:46:17,871 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:17,872 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:17,872 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:17,873 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:17,874 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:17,874 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:17,874 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:17,874 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:17,874 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:17,875 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:17,875 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:17,875 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:17,876 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:17,876 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:17,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:17,876 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:17,876 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:17,876 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:17,876 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:17,876 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:17,877 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:17,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:17,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:17,877 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:17,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:17,877 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:17,877 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:17,879 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:17,879 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:17,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:17,879 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:17,880 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:17,880 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:17,880 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> e19935633e394bb6492032fcd7d527ec5c122487e90b0c79abdb6dfbdef24c42 [2022-02-20 16:46:18,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:18,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:18,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:18,120 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:18,121 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:18,122 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1092d.c [2022-02-20 16:46:18,188 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92ff2cbb7/4e7849378c0b4fddbb31c0a3f9191dca/FLAGf372b7a25 [2022-02-20 16:46:18,558 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:18,559 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1092d.c [2022-02-20 16:46:18,563 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92ff2cbb7/4e7849378c0b4fddbb31c0a3f9191dca/FLAGf372b7a25 [2022-02-20 16:46:18,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92ff2cbb7/4e7849378c0b4fddbb31c0a3f9191dca [2022-02-20 16:46:18,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:18,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:18,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:18,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:18,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:18,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:18" (1/1) ... [2022-02-20 16:46:18,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e96013a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:18, skipping insertion in model container [2022-02-20 16:46:18,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:18" (1/1) ... [2022-02-20 16:46:18,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:18,985 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:19,178 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1092d.c[1790,1803] [2022-02-20 16:46:19,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:19,189 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:19,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1092d.c[1790,1803] [2022-02-20 16:46:19,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:19,276 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:19,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19 WrapperNode [2022-02-20 16:46:19,278 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:19,279 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:19,279 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:19,279 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:19,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:19,291 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:19,315 INFO L137 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 92 [2022-02-20 16:46:19,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:19,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:19,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:19,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:19,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:19,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:19,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:19,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:19,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:19,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:19,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:19,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:19,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:19,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:19,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:19,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (1/1) ... [2022-02-20 16:46:19,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:19,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:19,391 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:46:19,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:46:19,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:19,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:19,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:19,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:46:19,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:46:19,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:19,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:19,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:19,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:19,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:19,472 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:19,473 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:19,657 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:19,661 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:19,661 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:46:19,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:19 BoogieIcfgContainer [2022-02-20 16:46:19,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:19,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:19,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:19,667 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:19,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:18" (1/3) ... [2022-02-20 16:46:19,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df68dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:19, skipping insertion in model container [2022-02-20 16:46:19,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:19" (2/3) ... [2022-02-20 16:46:19,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df68dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:19, skipping insertion in model container [2022-02-20 16:46:19,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:19" (3/3) ... [2022-02-20 16:46:19,669 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1092d.c [2022-02-20 16:46:19,672 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:19,673 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:19,704 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:19,709 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:46:19,709 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 28 states have internal predecessors, (44), 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) [2022-02-20 16:46:19,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:46:19,726 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:19,726 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:19,729 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:19,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:19,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2064187560, now seen corresponding path program 1 times [2022-02-20 16:46:19,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:19,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148311480] [2022-02-20 16:46:19,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:19,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:19,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~huge_ceil~0 := 1.0E30; {32#true} is VALID [2022-02-20 16:46:19,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);assume { :begin_inline_ceil_float } true;ceil_float_#in~x#1 := main_~x~0#1;havoc ceil_float_#res#1;havoc ceil_float_#t~mem4#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, ceil_float_#t~mem5#1, ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, ceil_float_~x#1, ceil_float_~i0~0#1, ceil_float_~j0~0#1, ceil_float_~i~0#1, ceil_float_~ix~0#1;ceil_float_~x#1 := ceil_float_#in~x#1;havoc ceil_float_~i0~0#1;havoc ceil_float_~j0~0#1;havoc ceil_float_~i~0#1;havoc ceil_float_~ix~0#1; {32#true} is VALID [2022-02-20 16:46:19,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume !true; {33#false} is VALID [2022-02-20 16:46:19,882 INFO L290 TraceCheckUtils]: 3: Hoare triple {33#false} ceil_float_~ix~0#1 := (if 0 == ceil_float_~i0~0#1 then 0 else (if 1 == ceil_float_~i0~0#1 then 1 else ~bitwiseAnd(ceil_float_~i0~0#1, 2147483647)));ceil_float_~j0~0#1 := (if (ceil_float_~ix~0#1 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (ceil_float_~ix~0#1 / 8388608 - 127) % 4294967296 % 4294967296 else (ceil_float_~ix~0#1 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); {33#false} is VALID [2022-02-20 16:46:19,882 INFO L290 TraceCheckUtils]: 4: Hoare triple {33#false} assume !(ceil_float_~j0~0#1 < 23); {33#false} is VALID [2022-02-20 16:46:19,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#false} assume !!(ceil_float_~ix~0#1 % 4294967296 < 2139095040);ceil_float_#res#1 := ceil_float_~x#1; {33#false} is VALID [2022-02-20 16:46:19,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#false} main_#t~ret7#1 := ceil_float_#res#1;assume { :end_inline_ceil_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem6#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~1#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~1#1; {33#false} is VALID [2022-02-20 16:46:19,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-02-20 16:46:19,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#false} isinf_float_~ix~1#1 := (if 0 == isinf_float_~ix~1#1 then 0 else (if 1 == isinf_float_~ix~1#1 then 1 else ~bitwiseAnd(isinf_float_~ix~1#1, 2147483647)));isinf_float_#res#1 := (if 2139095040 == isinf_float_~ix~1#1 then 1 else 0); {33#false} is VALID [2022-02-20 16:46:19,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} main_#t~ret8#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647; {33#false} is VALID [2022-02-20 16:46:19,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {33#false} assume 0 == main_#t~ret8#1;havoc main_#t~ret8#1; {33#false} is VALID [2022-02-20 16:46:19,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-02-20 16:46:19,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:19,887 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:19,887 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148311480] [2022-02-20 16:46:19,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148311480] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:19,889 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:19,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:19,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085150258] [2022-02-20 16:46:19,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:19,897 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2022-02-20 16:46:19,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:19,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2022-02-20 16:46:19,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:19,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:19,920 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:19,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:19,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:19,946 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 28 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2022-02-20 16:46:20,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:20,009 INFO L93 Difference]: Finished difference Result 56 states and 86 transitions. [2022-02-20 16:46:20,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:20,010 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2022-02-20 16:46:20,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:20,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2022-02-20 16:46:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2022-02-20 16:46:20,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2022-02-20 16:46:20,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2022-02-20 16:46:20,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 86 transitions. [2022-02-20 16:46:20,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:20,131 INFO L225 Difference]: With dead ends: 56 [2022-02-20 16:46:20,132 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 16:46:20,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:20,138 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:20,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:20,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 16:46:20,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 16:46:20,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:20,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 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) [2022-02-20 16:46:20,162 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 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) [2022-02-20 16:46:20,164 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 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) [2022-02-20 16:46:20,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:20,167 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2022-02-20 16:46:20,167 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-02-20 16:46:20,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:20,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:20,168 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 16:46:20,168 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 16:46:20,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:20,170 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2022-02-20 16:46:20,171 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-02-20 16:46:20,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:20,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:20,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:20,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:20,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 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) [2022-02-20 16:46:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-02-20 16:46:20,174 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 12 [2022-02-20 16:46:20,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:20,174 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-02-20 16:46:20,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2022-02-20 16:46:20,174 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-02-20 16:46:20,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:46:20,176 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:20,177 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:20,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:46:20,178 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:20,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:20,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1026834198, now seen corresponding path program 1 times [2022-02-20 16:46:20,181 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:20,181 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006759971] [2022-02-20 16:46:20,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:20,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:20,255 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:20,315 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:46:20,320 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:20,321 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:20,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:46:20,326 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:46:20,328 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:20,354 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:20,355 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:20,355 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-20 16:46:20,355 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-20 16:46:20,355 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:20,355 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:20,355 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-02-20 16:46:20,355 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:20,355 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:20,356 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:20,356 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:20,356 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:46:20,356 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:46:20,356 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:20,356 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:20,356 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:20,356 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:20,356 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:46:20,356 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:20,356 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:20,357 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:20,357 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:20,357 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:20,357 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:20,357 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:20,357 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:20,357 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:46:20,357 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:46:20,358 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:46:20,358 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:46:20,358 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2022-02-20 16:46:20,358 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:20,358 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:20,358 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:20,359 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:20,359 WARN L170 areAnnotationChecker]: L61-3 has no Hoare annotation [2022-02-20 16:46:20,359 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-02-20 16:46:20,359 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-20 16:46:20,359 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:46:20,359 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:46:20,359 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-02-20 16:46:20,359 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-02-20 16:46:20,359 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2022-02-20 16:46:20,360 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:20,360 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:46:20,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:20 BoogieIcfgContainer [2022-02-20 16:46:20,362 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:20,362 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:20,362 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:20,362 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:20,363 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:19" (3/4) ... [2022-02-20 16:46:20,365 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:46:20,365 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:20,367 INFO L158 Benchmark]: Toolchain (without parser) took 1406.47ms. Allocated memory is still 140.5MB. Free memory was 106.7MB in the beginning and 95.4MB in the end (delta: 11.2MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:20,367 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 81.8MB. Free memory is still 37.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:20,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.92ms. Allocated memory is still 140.5MB. Free memory was 106.4MB in the beginning and 113.9MB in the end (delta: -7.5MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2022-02-20 16:46:20,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.89ms. Allocated memory is still 140.5MB. Free memory was 113.9MB in the beginning and 111.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:20,371 INFO L158 Benchmark]: Boogie Preprocessor took 33.49ms. Allocated memory is still 140.5MB. Free memory was 111.6MB in the beginning and 110.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:20,372 INFO L158 Benchmark]: RCFGBuilder took 312.71ms. Allocated memory is still 140.5MB. Free memory was 110.0MB in the beginning and 93.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 16:46:20,373 INFO L158 Benchmark]: TraceAbstraction took 697.47ms. Allocated memory is still 140.5MB. Free memory was 92.9MB in the beginning and 95.7MB in the end (delta: -2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:20,373 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 140.5MB. Free memory was 95.7MB in the beginning and 95.4MB in the end (delta: 235.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:20,377 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 81.8MB. Free memory is still 37.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.92ms. Allocated memory is still 140.5MB. Free memory was 106.4MB in the beginning and 113.9MB in the end (delta: -7.5MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.89ms. Allocated memory is still 140.5MB. Free memory was 113.9MB in the beginning and 111.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.49ms. Allocated memory is still 140.5MB. Free memory was 111.6MB in the beginning and 110.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 312.71ms. Allocated memory is still 140.5MB. Free memory was 110.0MB in the beginning and 93.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 697.47ms. Allocated memory is still 140.5MB. Free memory was 92.9MB in the beginning and 95.7MB in the end (delta: -2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 140.5MB. Free memory was 95.7MB in the beginning and 95.4MB in the end (delta: 235.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 83]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 78, overapproximation of bitwiseAnd at line 66. Possible FailurePath: [L13] static const float huge_ceil = 1.0e30; VAL [huge_ceil=1000000000000000000000000000000] [L78] float x = -1.0f / 0.0f; [L79] CALL, EXPR ceil_float(x) [L16] __int32_t i0, j0; [L17] __uint32_t i, ix; VAL [\old(x)=1000000000000000000000000000001, huge_ceil=1000000000000000000000000000000, x=1000000000000000000000000000001] [L19] ieee_float_shape_type gf_u; [L20] gf_u.value = (x) [L21] EXPR gf_u.word [L21] (i0) = gf_u.word [L23] ix = (i0 & 0x7fffffff) [L24] j0 = (ix >> 23) - 0x7f VAL [\old(x)=1000000000000000000000000000001, huge_ceil=1000000000000000000000000000000, i=-18014398509481984, i0=7, j0=2147483521, x=1000000000000000000000000000001] [L25] COND FALSE !(j0 < 23) VAL [\old(x)=1000000000000000000000000000001, huge_ceil=1000000000000000000000000000000, i=-18014398509481984, i0=7, j0=2147483521, x=1000000000000000000000000000001] [L45] COND FALSE !(!((ix) < 0x7f800000L)) [L48] return x; VAL [\old(x)=1000000000000000000000000000001, \result=1000000000000000000000000000001, huge_ceil=1000000000000000000000000000000, i=-18014398509481984, i0=7, j0=2147483521, x=1000000000000000000000000000001] [L79] RET, EXPR ceil_float(x) [L79] float res = ceil_float(x); [L82] CALL, EXPR isinf_float(res) [L60] __int32_t ix; VAL [\old(x)=1000000000000000000000000000001, huge_ceil=1000000000000000000000000000000, x=1000000000000000000000000000001] [L62] ieee_float_shape_type gf_u; [L63] gf_u.value = (x) [L64] EXPR gf_u.word [L64] (ix) = gf_u.word [L66] ix &= 0x7fffffff [L67] return ((ix) == 0x7f800000L); VAL [\old(x)=1000000000000000000000000000001, \result=0, huge_ceil=1000000000000000000000000000000, ix=1, x=1000000000000000000000000000001] [L82] RET, EXPR isinf_float(res) [L82] COND TRUE !isinf_float(res) [L83] reach_error() VAL [huge_ceil=1000000000000000000000000000000, res=1000000000000000000000000000001, x=1000000000000000000000000000001] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 37 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 11 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:46:20,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 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: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/float-newlib/float_req_bl_1092d.c -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.graphml --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 e19935633e394bb6492032fcd7d527ec5c122487e90b0c79abdb6dfbdef24c42 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:22,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:22,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:22,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:22,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:22,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:22,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:22,260 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:22,262 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:22,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:22,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:22,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:22,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:22,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:22,270 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:22,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:22,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:22,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:22,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:22,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:22,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:22,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:22,284 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:22,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:22,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:22,295 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:22,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:22,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:22,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:22,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:22,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:22,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:22,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:22,300 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:22,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:22,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:22,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:22,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:22,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:22,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:22,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:22,306 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:46:22,333 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:22,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:22,334 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:22,334 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:22,335 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:22,335 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:22,336 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:22,336 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:22,336 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:22,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:22,337 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:22,337 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:22,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:22,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:22,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:22,338 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:22,338 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:22,338 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:22,338 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:22,339 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:22,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:22,339 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:22,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:22,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:22,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:22,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:22,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:22,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:22,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:22,340 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:22,341 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:22,341 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:22,341 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:22,341 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:22,341 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:22,341 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:22,342 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.graphml 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 -> e19935633e394bb6492032fcd7d527ec5c122487e90b0c79abdb6dfbdef24c42 [2022-02-20 16:46:22,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:22,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:22,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:22,624 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:22,625 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:22,625 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1092d.c [2022-02-20 16:46:22,683 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc8be8596/5dcb00da86534382b81f973c58ef05e6/FLAG71074e1b4 [2022-02-20 16:46:23,023 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:23,024 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1092d.c [2022-02-20 16:46:23,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc8be8596/5dcb00da86534382b81f973c58ef05e6/FLAG71074e1b4 [2022-02-20 16:46:23,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc8be8596/5dcb00da86534382b81f973c58ef05e6 [2022-02-20 16:46:23,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:23,042 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:23,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:23,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:23,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:23,048 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:23" (1/1) ... [2022-02-20 16:46:23,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@435416c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:23, skipping insertion in model container [2022-02-20 16:46:23,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:23" (1/1) ... [2022-02-20 16:46:23,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:23,075 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:23,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1092d.c[1790,1803] [2022-02-20 16:46:23,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:23,257 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:23,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1092d.c[1790,1803] [2022-02-20 16:46:23,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:23,311 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:23,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:23 WrapperNode [2022-02-20 16:46:23,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:23,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:23,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:23,313 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:23,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:23" (1/1) ... [2022-02-20 16:46:23,337 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:23" (1/1) ... [2022-02-20 16:46:23,364 INFO L137 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 92 [2022-02-20 16:46:23,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:23,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:23,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:23,366 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:23,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:23" (1/1) ... [2022-02-20 16:46:23,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:23" (1/1) ... [2022-02-20 16:46:23,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:23" (1/1) ... [2022-02-20 16:46:23,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:23" (1/1) ... [2022-02-20 16:46:23,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:23" (1/1) ... [2022-02-20 16:46:23,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:23" (1/1) ... [2022-02-20 16:46:23,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:23" (1/1) ... [2022-02-20 16:46:23,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:23,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:23,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:23,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:23,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:23" (1/1) ... [2022-02-20 16:46:23,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:23,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:23,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:46:23,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:46:23,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:23,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:23,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:23,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:46:23,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:23,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:23,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:23,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:23,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:46:23,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:23,523 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:23,525 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:23,966 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:23,971 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:23,971 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:46:23,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:23 BoogieIcfgContainer [2022-02-20 16:46:23,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:23,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:23,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:23,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:23,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:23" (1/3) ... [2022-02-20 16:46:23,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66802155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:23, skipping insertion in model container [2022-02-20 16:46:23,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:23" (2/3) ... [2022-02-20 16:46:23,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66802155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:23, skipping insertion in model container [2022-02-20 16:46:23,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:23" (3/3) ... [2022-02-20 16:46:23,978 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1092d.c [2022-02-20 16:46:23,981 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:23,981 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:24,014 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:24,018 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:46:24,019 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:24,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 28 states have internal predecessors, (44), 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) [2022-02-20 16:46:24,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:46:24,033 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:24,034 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:24,034 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:24,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:24,042 INFO L85 PathProgramCache]: Analyzing trace with hash -2064187560, now seen corresponding path program 1 times [2022-02-20 16:46:24,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:24,052 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88590609] [2022-02-20 16:46:24,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:24,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:24,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:24,055 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:24,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:46:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:24,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:24,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:24,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~huge_ceil~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {32#true} is VALID [2022-02-20 16:46:24,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline_ceil_float } true;ceil_float_#in~x#1 := main_~x~0#1;havoc ceil_float_#res#1;havoc ceil_float_#t~mem4#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, ceil_float_#t~mem5#1, ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, ceil_float_~x#1, ceil_float_~i0~0#1, ceil_float_~j0~0#1, ceil_float_~i~0#1, ceil_float_~ix~0#1;ceil_float_~x#1 := ceil_float_#in~x#1;havoc ceil_float_~i0~0#1;havoc ceil_float_~j0~0#1;havoc ceil_float_~i~0#1;havoc ceil_float_~ix~0#1; {32#true} is VALID [2022-02-20 16:46:24,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume !true; {33#false} is VALID [2022-02-20 16:46:24,214 INFO L290 TraceCheckUtils]: 3: Hoare triple {33#false} ceil_float_~ix~0#1 := ~bvand32(2147483647bv32, ceil_float_~i0~0#1);ceil_float_~j0~0#1 := ~bvsub32(~bvlshr32(ceil_float_~ix~0#1, 23bv32), 127bv32); {33#false} is VALID [2022-02-20 16:46:24,214 INFO L290 TraceCheckUtils]: 4: Hoare triple {33#false} assume !~bvslt32(ceil_float_~j0~0#1, 23bv32); {33#false} is VALID [2022-02-20 16:46:24,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#false} assume !!~bvult32(ceil_float_~ix~0#1, 2139095040bv32);ceil_float_#res#1 := ceil_float_~x#1; {33#false} is VALID [2022-02-20 16:46:24,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#false} main_#t~ret7#1 := ceil_float_#res#1;assume { :end_inline_ceil_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem6#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~1#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~1#1; {33#false} is VALID [2022-02-20 16:46:24,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-02-20 16:46:24,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#false} isinf_float_~ix~1#1 := ~bvand32(2147483647bv32, isinf_float_~ix~1#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~1#1 then 1bv32 else 0bv32); {33#false} is VALID [2022-02-20 16:46:24,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} main_#t~ret8#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {33#false} is VALID [2022-02-20 16:46:24,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {33#false} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {33#false} is VALID [2022-02-20 16:46:24,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-02-20 16:46:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:24,217 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:24,217 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:24,217 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88590609] [2022-02-20 16:46:24,218 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88590609] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:24,218 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:24,218 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:24,219 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230732109] [2022-02-20 16:46:24,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:24,223 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2022-02-20 16:46:24,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:24,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2022-02-20 16:46:24,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:24,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:24,241 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:24,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:24,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:24,264 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 28 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2022-02-20 16:46:24,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:24,586 INFO L93 Difference]: Finished difference Result 56 states and 86 transitions. [2022-02-20 16:46:24,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:24,586 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2022-02-20 16:46:24,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2022-02-20 16:46:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2022-02-20 16:46:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2022-02-20 16:46:24,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2022-02-20 16:46:24,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 86 transitions. [2022-02-20 16:46:24,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:24,949 INFO L225 Difference]: With dead ends: 56 [2022-02-20 16:46:24,949 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 16:46:24,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:24,953 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:24,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:24,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 16:46:24,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 16:46:25,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:25,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 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) [2022-02-20 16:46:25,001 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 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) [2022-02-20 16:46:25,008 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 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) [2022-02-20 16:46:25,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:25,013 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2022-02-20 16:46:25,014 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-02-20 16:46:25,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:25,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:25,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 16:46:25,015 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 16:46:25,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:25,018 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2022-02-20 16:46:25,018 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-02-20 16:46:25,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:25,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:25,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:25,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 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) [2022-02-20 16:46:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-02-20 16:46:25,022 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 12 [2022-02-20 16:46:25,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:25,023 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-02-20 16:46:25,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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) [2022-02-20 16:46:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-02-20 16:46:25,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:46:25,024 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:25,024 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:25,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 16:46:25,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:25,234 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:25,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:25,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1026834198, now seen corresponding path program 1 times [2022-02-20 16:46:25,235 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:25,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641974943] [2022-02-20 16:46:25,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:25,236 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:25,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:25,238 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:25,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:46:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:25,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:25,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:25,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {217#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~huge_ceil~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {217#true} is VALID [2022-02-20 16:46:25,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {217#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline_ceil_float } true;ceil_float_#in~x#1 := main_~x~0#1;havoc ceil_float_#res#1;havoc ceil_float_#t~mem4#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, ceil_float_#t~mem5#1, ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, ceil_float_~x#1, ceil_float_~i0~0#1, ceil_float_~j0~0#1, ceil_float_~i~0#1, ceil_float_~ix~0#1;ceil_float_~x#1 := ceil_float_#in~x#1;havoc ceil_float_~i0~0#1;havoc ceil_float_~j0~0#1;havoc ceil_float_~i~0#1;havoc ceil_float_~ix~0#1; {225#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|))} is VALID [2022-02-20 16:46:25,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {225#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|))} call ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(ceil_float_~x#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, 4bv32);call ceil_float_#t~mem4#1 := read~intINTTYPE4(ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, 4bv32);ceil_float_~i0~0#1 := ceil_float_#t~mem4#1;havoc ceil_float_#t~mem4#1;call ULTIMATE.dealloc(ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset);havoc ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset; {229#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|))))} is VALID [2022-02-20 16:46:25,535 INFO L290 TraceCheckUtils]: 3: Hoare triple {229#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|))))} goto; {229#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|))))} is VALID [2022-02-20 16:46:25,537 INFO L290 TraceCheckUtils]: 4: Hoare triple {229#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|))))} ceil_float_~ix~0#1 := ~bvand32(2147483647bv32, ceil_float_~i0~0#1);ceil_float_~j0~0#1 := ~bvsub32(~bvlshr32(ceil_float_~ix~0#1, 23bv32), 127bv32); {236#(exists ((|ULTIMATE.start_ceil_float_~i0~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start_ceil_float_~ix~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start_ceil_float_~i0~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|))))))} is VALID [2022-02-20 16:46:25,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#(exists ((|ULTIMATE.start_ceil_float_~i0~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start_ceil_float_~ix~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start_ceil_float_~i0~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|))))))} assume !~bvslt32(ceil_float_~j0~0#1, 23bv32); {236#(exists ((|ULTIMATE.start_ceil_float_~i0~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start_ceil_float_~ix~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start_ceil_float_~i0~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|))))))} is VALID [2022-02-20 16:46:25,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {236#(exists ((|ULTIMATE.start_ceil_float_~i0~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start_ceil_float_~ix~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start_ceil_float_~i0~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|))))))} assume !!~bvult32(ceil_float_~ix~0#1, 2139095040bv32);ceil_float_#res#1 := ceil_float_~x#1; {218#false} is VALID [2022-02-20 16:46:25,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#false} main_#t~ret7#1 := ceil_float_#res#1;assume { :end_inline_ceil_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem6#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~1#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~1#1; {218#false} is VALID [2022-02-20 16:46:25,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#false} call isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4bv32);call isinf_float_#t~mem6#1 := read~intINTTYPE4(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4bv32);isinf_float_~ix~1#1 := isinf_float_#t~mem6#1;havoc isinf_float_#t~mem6#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset);havoc isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset; {218#false} is VALID [2022-02-20 16:46:25,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#false} goto; {218#false} is VALID [2022-02-20 16:46:25,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#false} isinf_float_~ix~1#1 := ~bvand32(2147483647bv32, isinf_float_~ix~1#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~1#1 then 1bv32 else 0bv32); {218#false} is VALID [2022-02-20 16:46:25,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#false} main_#t~ret8#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {218#false} is VALID [2022-02-20 16:46:25,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {218#false} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {218#false} is VALID [2022-02-20 16:46:25,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {218#false} assume !false; {218#false} is VALID [2022-02-20 16:46:25,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:25,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:25,543 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:25,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641974943] [2022-02-20 16:46:25,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641974943] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:25,543 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:25,543 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:25,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94673738] [2022-02-20 16:46:25,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:25,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:46:25,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:25,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:25,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:25,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:25,585 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:25,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:25,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:25,587 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:26,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:26,282 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-02-20 16:46:26,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:26,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:46:26,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:26,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:26,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-02-20 16:46:26,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:26,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-02-20 16:46:26,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-02-20 16:46:26,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:26,442 INFO L225 Difference]: With dead ends: 45 [2022-02-20 16:46:26,442 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 16:46:26,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:26,444 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 24 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:26,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 99 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 25 Unchecked, 0.0s Time] [2022-02-20 16:46:26,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 16:46:26,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2022-02-20 16:46:26,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:26,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 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) [2022-02-20 16:46:26,448 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 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) [2022-02-20 16:46:26,448 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 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) [2022-02-20 16:46:26,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:26,450 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-20 16:46:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-20 16:46:26,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:26,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:26,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-20 16:46:26,455 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-20 16:46:26,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:26,463 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-20 16:46:26,464 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-20 16:46:26,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:26,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:26,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:26,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:26,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 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) [2022-02-20 16:46:26,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-02-20 16:46:26,469 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2022-02-20 16:46:26,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:26,471 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-02-20 16:46:26,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:26,471 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-02-20 16:46:26,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:46:26,473 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:26,473 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:26,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:26,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:26,683 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:26,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:26,683 INFO L85 PathProgramCache]: Analyzing trace with hash -217487572, now seen corresponding path program 1 times [2022-02-20 16:46:26,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:26,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [852275266] [2022-02-20 16:46:26,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:26,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:26,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:26,686 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:26,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:46:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:26,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 16:46:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:26,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:27,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {422#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~huge_ceil~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {427#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:46:27,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {427#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline_ceil_float } true;ceil_float_#in~x#1 := main_~x~0#1;havoc ceil_float_#res#1;havoc ceil_float_#t~mem4#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, ceil_float_#t~mem5#1, ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, ceil_float_~x#1, ceil_float_~i0~0#1, ceil_float_~j0~0#1, ceil_float_~i~0#1, ceil_float_~ix~0#1;ceil_float_~x#1 := ceil_float_#in~x#1;havoc ceil_float_~i0~0#1;havoc ceil_float_~j0~0#1;havoc ceil_float_~i~0#1;havoc ceil_float_~ix~0#1; {431#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:27,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {431#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} call ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(ceil_float_~x#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, 4bv32);call ceil_float_#t~mem4#1 := read~intINTTYPE4(ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, 4bv32);ceil_float_~i0~0#1 := ceil_float_#t~mem4#1;havoc ceil_float_#t~mem4#1;call ULTIMATE.dealloc(ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset);havoc ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset; {431#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:27,043 INFO L290 TraceCheckUtils]: 3: Hoare triple {431#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} goto; {431#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:27,044 INFO L290 TraceCheckUtils]: 4: Hoare triple {431#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} ceil_float_~ix~0#1 := ~bvand32(2147483647bv32, ceil_float_~i0~0#1);ceil_float_~j0~0#1 := ~bvsub32(~bvlshr32(ceil_float_~ix~0#1, 23bv32), 127bv32); {431#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:27,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {431#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} assume !~bvslt32(ceil_float_~j0~0#1, 23bv32); {431#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:27,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {431#(and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))} assume !~bvult32(ceil_float_~ix~0#1, 2139095040bv32);ceil_float_#res#1 := ~fp.add~FLOAT(currentRoundingMode, ceil_float_~x#1, ceil_float_~x#1); {447#(= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) |ULTIMATE.start_ceil_float_#res#1|)} is VALID [2022-02-20 16:46:27,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {447#(= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) |ULTIMATE.start_ceil_float_#res#1|)} main_#t~ret7#1 := ceil_float_#res#1;assume { :end_inline_ceil_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem6#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~1#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~1#1; {451#(= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) |ULTIMATE.start_isinf_float_~x#1|)} is VALID [2022-02-20 16:46:27,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {451#(= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) |ULTIMATE.start_isinf_float_~x#1|)} call isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4bv32);call isinf_float_#t~mem6#1 := read~intINTTYPE4(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4bv32);isinf_float_~ix~1#1 := isinf_float_#t~mem6#1;havoc isinf_float_#t~mem6#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset);havoc isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset; {455#(= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~1#1|)))} is VALID [2022-02-20 16:46:27,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {455#(= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~1#1|)))} goto; {455#(= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~1#1|)))} is VALID [2022-02-20 16:46:27,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {455#(= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~1#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~1#1|)))} isinf_float_~ix~1#1 := ~bvand32(2147483647bv32, isinf_float_~ix~1#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~1#1 then 1bv32 else 0bv32); {462#(= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32))} is VALID [2022-02-20 16:46:27,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {462#(= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32))} main_#t~ret8#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {466#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret8#1|)} is VALID [2022-02-20 16:46:27,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {466#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret8#1|)} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {423#false} is VALID [2022-02-20 16:46:27,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {423#false} assume !false; {423#false} is VALID [2022-02-20 16:46:27,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:27,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:27,058 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:27,059 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [852275266] [2022-02-20 16:46:27,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [852275266] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:27,059 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:27,059 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 16:46:27,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448777858] [2022-02-20 16:46:27,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:27,062 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:46:27,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:27,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:27,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:27,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 16:46:27,088 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:27,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 16:46:27,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:46:27,089 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:27,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:27,945 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-02-20 16:46:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 16:46:27,945 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:46:27,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:27,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-02-20 16:46:27,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-02-20 16:46:27,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 49 transitions. [2022-02-20 16:46:28,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:28,049 INFO L225 Difference]: With dead ends: 43 [2022-02-20 16:46:28,049 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 16:46:28,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-02-20 16:46:28,050 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 47 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:28,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 95 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 16:46:28,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 16:46:28,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 16:46:28,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:28,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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) [2022-02-20 16:46:28,053 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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) [2022-02-20 16:46:28,053 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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) [2022-02-20 16:46:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:28,054 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-02-20 16:46:28,054 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-02-20 16:46:28,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:28,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:28,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states. [2022-02-20 16:46:28,055 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 21 states. [2022-02-20 16:46:28,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:28,055 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-02-20 16:46:28,055 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-02-20 16:46:28,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:28,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:28,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:28,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:28,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 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) [2022-02-20 16:46:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-02-20 16:46:28,057 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2022-02-20 16:46:28,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:28,057 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-02-20 16:46:28,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-02-20 16:46:28,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:46:28,058 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:28,058 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:28,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:28,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:28,258 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:28,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:28,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1158240359, now seen corresponding path program 1 times [2022-02-20 16:46:28,259 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:28,259 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666221830] [2022-02-20 16:46:28,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:28,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:28,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:28,261 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:28,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:46:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:28,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:46:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:28,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:28,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {602#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~huge_ceil~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30)); {602#true} is VALID [2022-02-20 16:46:28,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {602#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline_ceil_float } true;ceil_float_#in~x#1 := main_~x~0#1;havoc ceil_float_#res#1;havoc ceil_float_#t~mem4#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, ceil_float_#t~mem5#1, ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, ceil_float_~x#1, ceil_float_~i0~0#1, ceil_float_~j0~0#1, ceil_float_~i~0#1, ceil_float_~ix~0#1;ceil_float_~x#1 := ceil_float_#in~x#1;havoc ceil_float_~i0~0#1;havoc ceil_float_~j0~0#1;havoc ceil_float_~i~0#1;havoc ceil_float_~ix~0#1; {610#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|))} is VALID [2022-02-20 16:46:28,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|))} call ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(ceil_float_~x#1, ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, 4bv32);call ceil_float_#t~mem4#1 := read~intINTTYPE4(ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset, 4bv32);ceil_float_~i0~0#1 := ceil_float_#t~mem4#1;havoc ceil_float_#t~mem4#1;call ULTIMATE.dealloc(ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset);havoc ceil_float_~#gf_u~0#1.base, ceil_float_~#gf_u~0#1.offset; {614#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|))))} is VALID [2022-02-20 16:46:28,566 INFO L290 TraceCheckUtils]: 3: Hoare triple {614#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|))))} goto; {614#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|))))} is VALID [2022-02-20 16:46:28,568 INFO L290 TraceCheckUtils]: 4: Hoare triple {614#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|))))} ceil_float_~ix~0#1 := ~bvand32(2147483647bv32, ceil_float_~i0~0#1);ceil_float_~j0~0#1 := ~bvsub32(~bvlshr32(ceil_float_~ix~0#1, 23bv32), 127bv32); {621#(exists ((|ULTIMATE.start_ceil_float_~i0~0#1| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|))) (= (bvadd (bvlshr (bvand (_ bv2147483647 32) |ULTIMATE.start_ceil_float_~i0~0#1|) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_ceil_float_~j0~0#1|)))} is VALID [2022-02-20 16:46:28,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {621#(exists ((|ULTIMATE.start_ceil_float_~i0~0#1| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_ceil_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_ceil_float_~i0~0#1|))) (= (bvadd (bvlshr (bvand (_ bv2147483647 32) |ULTIMATE.start_ceil_float_~i0~0#1|) (_ bv23 32)) (_ bv4294967169 32)) |ULTIMATE.start_ceil_float_~j0~0#1|)))} assume ~bvslt32(ceil_float_~j0~0#1, 23bv32); {603#false} is VALID [2022-02-20 16:46:28,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {603#false} assume ~bvslt32(ceil_float_~j0~0#1, 0bv32); {603#false} is VALID [2022-02-20 16:46:28,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {603#false} assume !~fp.gt~FLOAT(~fp.add~FLOAT(currentRoundingMode, ~huge_ceil~0, ceil_float_~x#1), ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE())); {603#false} is VALID [2022-02-20 16:46:28,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {603#false} call ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(ceil_float_~i0~0#1, ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, 4bv32);call ceil_float_#t~mem5#1 := read~intFLOATTYPE4(ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset, 4bv32);ceil_float_~x#1 := ceil_float_#t~mem5#1;havoc ceil_float_#t~mem5#1;call ULTIMATE.dealloc(ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset);havoc ceil_float_~#sf_u~0#1.base, ceil_float_~#sf_u~0#1.offset; {603#false} is VALID [2022-02-20 16:46:28,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {603#false} goto; {603#false} is VALID [2022-02-20 16:46:28,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {603#false} ceil_float_#res#1 := ceil_float_~x#1; {603#false} is VALID [2022-02-20 16:46:28,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {603#false} main_#t~ret7#1 := ceil_float_#res#1;assume { :end_inline_ceil_float } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isinf_float } true;isinf_float_#in~x#1 := main_~res~0#1;havoc isinf_float_#res#1;havoc isinf_float_#t~mem6#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, isinf_float_~x#1, isinf_float_~ix~1#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~1#1; {603#false} is VALID [2022-02-20 16:46:28,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {603#false} call isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4bv32);call isinf_float_#t~mem6#1 := read~intINTTYPE4(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset, 4bv32);isinf_float_~ix~1#1 := isinf_float_#t~mem6#1;havoc isinf_float_#t~mem6#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset);havoc isinf_float_~#gf_u~1#1.base, isinf_float_~#gf_u~1#1.offset; {603#false} is VALID [2022-02-20 16:46:28,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {603#false} goto; {603#false} is VALID [2022-02-20 16:46:28,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {603#false} isinf_float_~ix~1#1 := ~bvand32(2147483647bv32, isinf_float_~ix~1#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~1#1 then 1bv32 else 0bv32); {603#false} is VALID [2022-02-20 16:46:28,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {603#false} main_#t~ret8#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {603#false} is VALID [2022-02-20 16:46:28,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {603#false} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {603#false} is VALID [2022-02-20 16:46:28,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {603#false} assume !false; {603#false} is VALID [2022-02-20 16:46:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:46:28,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:28,573 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:28,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666221830] [2022-02-20 16:46:28,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [666221830] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:28,573 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:28,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:28,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585915893] [2022-02-20 16:46:28,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:28,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2022-02-20 16:46:28,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:28,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-02-20 16:46:28,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:28,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:28,632 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:28,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:28,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:28,633 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-02-20 16:46:28,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:28,665 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-02-20 16:46:28,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:28,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2022-02-20 16:46:28,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:28,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-02-20 16:46:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-02-20 16:46:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-02-20 16:46:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-02-20 16:46:28,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 21 transitions. [2022-02-20 16:46:28,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:28,728 INFO L225 Difference]: With dead ends: 21 [2022-02-20 16:46:28,729 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:46:28,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:28,730 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:28,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-02-20 16:46:28,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:46:28,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:46:28,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:28,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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) [2022-02-20 16:46:28,731 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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) [2022-02-20 16:46:28,731 INFO L87 Difference]: Start difference. First operand 0 states. Second 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) [2022-02-20 16:46:28,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:28,731 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:28,731 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:28,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:28,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:28,732 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-02-20 16:46:28,732 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-02-20 16:46:28,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:28,732 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:28,732 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:28,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:28,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:28,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:28,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:28,733 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) [2022-02-20 16:46:28,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:46:28,733 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-02-20 16:46:28,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:28,733 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:46:28,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-02-20 16:46:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:28,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:28,735 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:28,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-02-20 16:46:28,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:28,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:46:29,015 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 33) no Hoare annotation was computed. [2022-02-20 16:46:29,015 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2022-02-20 16:46:29,015 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:46:29,015 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:46:29,016 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:46:29,016 INFO L858 garLoopResultBuilder]: For program point L28(lines 28 32) no Hoare annotation was computed. [2022-02-20 16:46:29,016 INFO L858 garLoopResultBuilder]: For program point L61-1(lines 61 65) no Hoare annotation was computed. [2022-02-20 16:46:29,016 INFO L854 garLoopResultBuilder]: At program point L61-2(lines 61 65) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= .cse0 |ULTIMATE.start_isinf_float_~x#1|) (= .cse0 |ULTIMATE.start_ceil_float_#res#1|) (= currentRoundingMode roundNearestTiesToEven))) [2022-02-20 16:46:29,016 INFO L858 garLoopResultBuilder]: For program point L61-3(lines 61 65) no Hoare annotation was computed. [2022-02-20 16:46:29,016 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2022-02-20 16:46:29,016 INFO L858 garLoopResultBuilder]: For program point L82(lines 82 85) no Hoare annotation was computed. [2022-02-20 16:46:29,016 INFO L858 garLoopResultBuilder]: For program point L45(lines 45 48) no Hoare annotation was computed. [2022-02-20 16:46:29,016 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:46:29,016 INFO L858 garLoopResultBuilder]: For program point L25(lines 25 49) no Hoare annotation was computed. [2022-02-20 16:46:29,016 INFO L861 garLoopResultBuilder]: At program point L87(lines 70 88) the Hoare annotation is: true [2022-02-20 16:46:29,016 INFO L858 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2022-02-20 16:46:29,016 INFO L858 garLoopResultBuilder]: For program point L50(lines 50 54) no Hoare annotation was computed. [2022-02-20 16:46:29,016 INFO L858 garLoopResultBuilder]: For program point L50-1(lines 15 56) no Hoare annotation was computed. [2022-02-20 16:46:29,016 INFO L858 garLoopResultBuilder]: For program point L50-2(lines 50 54) no Hoare annotation was computed. [2022-02-20 16:46:29,016 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 42) no Hoare annotation was computed. [2022-02-20 16:46:29,017 INFO L854 garLoopResultBuilder]: At program point L67(lines 59 68) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))) (fp.add roundNearestTiesToEven .cse1 .cse1)))) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32)) (= .cse0 |ULTIMATE.start_isinf_float_~x#1|) (= .cse0 |ULTIMATE.start_ceil_float_#res#1|) (= currentRoundingMode roundNearestTiesToEven))) [2022-02-20 16:46:29,017 INFO L858 garLoopResultBuilder]: For program point L30(lines 30 32) no Hoare annotation was computed. [2022-02-20 16:46:29,017 INFO L858 garLoopResultBuilder]: For program point L26(lines 26 43) no Hoare annotation was computed. [2022-02-20 16:46:29,017 INFO L854 garLoopResultBuilder]: At program point L55(lines 15 56) the Hoare annotation is: (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|) (= (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))) (fp.add roundNearestTiesToEven .cse0 .cse0)) |ULTIMATE.start_ceil_float_#res#1|) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:46:29,019 INFO L858 garLoopResultBuilder]: For program point L18-1(lines 18 22) no Hoare annotation was computed. [2022-02-20 16:46:29,019 INFO L854 garLoopResultBuilder]: At program point L18-2(lines 18 22) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_ceil_float_~x#1|)) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:46:29,019 INFO L858 garLoopResultBuilder]: For program point L18-3(lines 18 22) no Hoare annotation was computed. [2022-02-20 16:46:29,019 INFO L858 garLoopResultBuilder]: For program point L39(lines 39 40) no Hoare annotation was computed. [2022-02-20 16:46:29,019 INFO L858 garLoopResultBuilder]: For program point L39-2(lines 39 40) no Hoare annotation was computed. [2022-02-20 16:46:29,021 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 16:46:29,022 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:29,027 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:29,027 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:29,027 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:29,028 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-02-20 16:46:29,028 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:29,028 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:46:29,029 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-02-20 16:46:29,029 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:29,029 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:46:29,029 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:29,029 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:46:29,029 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:46:29,029 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:46:29,029 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:29,029 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:29,029 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:29,029 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:29,031 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:29,043 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:46:29,043 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:29,043 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:46:29,043 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:29,044 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:29,044 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:29,044 WARN L170 areAnnotationChecker]: L61-3 has no Hoare annotation [2022-02-20 16:46:29,044 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:46:29,044 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:46:29,044 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:46:29,044 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-02-20 16:46:29,044 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2022-02-20 16:46:29,044 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:29,044 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:46:29,044 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:29,044 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:46:29,045 WARN L170 areAnnotationChecker]: L61-3 has no Hoare annotation [2022-02-20 16:46:29,045 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-02-20 16:46:29,045 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:46:29,045 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:46:29,045 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:46:29,045 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-02-20 16:46:29,045 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-02-20 16:46:29,045 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:29,045 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:29,045 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:46:29,048 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,055 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,055 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,055 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,055 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,055 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,055 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,056 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,056 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,056 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,056 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,056 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,057 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:29,058 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:29,058 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,058 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:29,058 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:29,058 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,059 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,059 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,059 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,059 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,059 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,059 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,059 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,060 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,060 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,060 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,060 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,060 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,060 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,061 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,065 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,066 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,066 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,066 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,066 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,066 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,066 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,066 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,067 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,067 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,067 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,068 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,068 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,068 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,068 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,068 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,068 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,068 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,069 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,069 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:29 BoogieIcfgContainer [2022-02-20 16:46:29,069 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:29,070 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:29,070 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:29,070 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:29,070 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:23" (3/4) ... [2022-02-20 16:46:29,072 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:46:29,079 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-02-20 16:46:29,079 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-02-20 16:46:29,079 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:46:29,079 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:46:29,094 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:46:29,095 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:46:29,095 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == x) && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:46:29,095 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x && \result == 1bv32) && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == x) && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:46:29,102 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:46:29,102 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:29,103 INFO L158 Benchmark]: Toolchain (without parser) took 6060.44ms. Allocated memory was 50.3MB in the beginning and 88.1MB in the end (delta: 37.7MB). Free memory was 25.5MB in the beginning and 65.0MB in the end (delta: -39.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:29,103 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 50.3MB. Free memory was 30.9MB in the beginning and 30.9MB in the end (delta: 48.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:29,103 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.79ms. Allocated memory was 50.3MB in the beginning and 73.4MB in the end (delta: 23.1MB). Free memory was 25.3MB in the beginning and 53.9MB in the end (delta: -28.6MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-02-20 16:46:29,104 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.71ms. Allocated memory is still 73.4MB. Free memory was 53.9MB in the beginning and 51.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:29,104 INFO L158 Benchmark]: Boogie Preprocessor took 37.14ms. Allocated memory is still 73.4MB. Free memory was 51.9MB in the beginning and 50.2MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:29,104 INFO L158 Benchmark]: RCFGBuilder took 568.35ms. Allocated memory is still 73.4MB. Free memory was 50.2MB in the beginning and 54.1MB in the end (delta: -3.9MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2022-02-20 16:46:29,104 INFO L158 Benchmark]: TraceAbstraction took 5096.08ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 53.5MB in the beginning and 68.5MB in the end (delta: -15.0MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:29,105 INFO L158 Benchmark]: Witness Printer took 32.64ms. Allocated memory is still 88.1MB. Free memory was 68.5MB in the beginning and 65.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:46:29,106 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 50.3MB. Free memory was 30.9MB in the beginning and 30.9MB in the end (delta: 48.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.79ms. Allocated memory was 50.3MB in the beginning and 73.4MB in the end (delta: 23.1MB). Free memory was 25.3MB in the beginning and 53.9MB in the end (delta: -28.6MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.71ms. Allocated memory is still 73.4MB. Free memory was 53.9MB in the beginning and 51.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.14ms. Allocated memory is still 73.4MB. Free memory was 51.9MB in the beginning and 50.2MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 568.35ms. Allocated memory is still 73.4MB. Free memory was 50.2MB in the beginning and 54.1MB in the end (delta: -3.9MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * TraceAbstraction took 5096.08ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 53.5MB in the beginning and 68.5MB in the end (delta: -15.0MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. * Witness Printer took 32.64ms. Allocated memory is still 88.1MB. Free memory was 68.5MB in the beginning and 65.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * 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: 83]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 71 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 239 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 29 IncrementalHoareTripleChecker+Unchecked, 150 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58 IncrementalHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 89 mSDtfsCounter, 58 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 147 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 54 ConstructedInterpolants, 9 QuantifiedInterpolants, 347 SizeOfPredicates, 26 NumberOfNonLiveVariables, 221 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 59]: Loop Invariant [2022-02-20 16:46:29,116 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,119 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,119 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,119 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,119 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,119 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,119 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,119 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x && \result == 1bv32) && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == x) && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 18]: Loop Invariant [2022-02-20 16:46:29,120 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:29,120 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:29,120 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,120 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:29,120 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:29,121 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 61]: Loop Invariant [2022-02-20 16:46:29,121 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,121 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,121 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,121 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,121 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,122 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,122 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,122 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,122 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,122 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,122 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,122 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,123 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,123 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,123 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,123 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,123 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,123 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,123 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,123 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,123 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,124 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == x) && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 15]: Loop Invariant [2022-02-20 16:46:29,124 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,124 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,124 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,124 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,124 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,125 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,125 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,125 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,125 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,125 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,125 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:46:29,125 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x && ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven RESULT: Ultimate proved your program to be correct! [2022-02-20 16:46:29,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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