./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0834.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_0834.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 50ed40b69e81fb917053aec6552591dca3f64c8cb874eda039e4af9ce9424f97 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:43:00,922 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:43:00,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:43:00,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:43:00,971 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:43:00,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:43:00,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:43:00,979 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:43:00,981 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:43:00,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:43:00,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:43:00,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:43:00,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:43:00,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:43:00,992 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:43:00,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:43:00,995 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:43:00,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:43:00,998 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:43:01,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:43:01,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:43:01,006 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:43:01,008 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:43:01,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:43:01,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:43:01,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:43:01,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:43:01,017 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:43:01,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:43:01,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:43:01,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:43:01,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:43:01,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:43:01,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:43:01,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:43:01,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:43:01,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:43:01,025 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:43:01,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:43:01,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:43:01,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:43:01,027 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:43:01,059 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:43:01,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:43:01,060 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:43:01,060 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:43:01,061 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:43:01,061 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:43:01,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:43:01,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:43:01,062 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:43:01,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:43:01,063 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:43:01,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:43:01,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:43:01,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:43:01,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:43:01,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:43:01,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:43:01,065 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:43:01,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:43:01,065 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:43:01,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:43:01,066 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:43:01,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:43:01,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:43:01,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:43:01,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:43:01,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:43:01,067 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:43:01,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:43:01,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:43:01,067 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:43:01,068 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:43:01,068 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:43:01,068 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 -> 50ed40b69e81fb917053aec6552591dca3f64c8cb874eda039e4af9ce9424f97 [2022-02-20 16:43:01,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:43:01,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:43:01,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:43:01,303 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:43:01,304 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:43:01,305 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0834.c [2022-02-20 16:43:01,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/146c96048/0ddcfa3fe7884c228a5498e78832d829/FLAG2fd5bf440 [2022-02-20 16:43:01,753 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:43:01,753 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0834.c [2022-02-20 16:43:01,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/146c96048/0ddcfa3fe7884c228a5498e78832d829/FLAG2fd5bf440 [2022-02-20 16:43:01,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/146c96048/0ddcfa3fe7884c228a5498e78832d829 [2022-02-20 16:43:01,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:43:01,777 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:43:01,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:43:01,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:43:01,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:43:01,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:43:01" (1/1) ... [2022-02-20 16:43:01,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@357d0e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:01, skipping insertion in model container [2022-02-20 16:43:01,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:43:01" (1/1) ... [2022-02-20 16:43:01,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:43:01,820 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:43:02,025 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_0834.c[3447,3460] [2022-02-20 16:43:02,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:43:02,040 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:43:02,086 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_0834.c[3447,3460] [2022-02-20 16:43:02,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:43:02,117 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:43:02,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02 WrapperNode [2022-02-20 16:43:02,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:43:02,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:43:02,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:43:02,120 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:43:02,126 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:43:02" (1/1) ... [2022-02-20 16:43:02,136 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:43:02" (1/1) ... [2022-02-20 16:43:02,173 INFO L137 Inliner]: procedures = 19, calls = 47, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 204 [2022-02-20 16:43:02,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:43:02,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:43:02,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:43:02,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:43:02,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02" (1/1) ... [2022-02-20 16:43:02,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02" (1/1) ... [2022-02-20 16:43:02,184 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02" (1/1) ... [2022-02-20 16:43:02,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02" (1/1) ... [2022-02-20 16:43:02,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02" (1/1) ... [2022-02-20 16:43:02,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02" (1/1) ... [2022-02-20 16:43:02,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02" (1/1) ... [2022-02-20 16:43:02,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:43:02,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:43:02,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:43:02,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:43:02,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02" (1/1) ... [2022-02-20 16:43:02,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:43:02,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:43:02,242 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:43:02,251 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:43:02,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:43:02,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:43:02,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:43:02,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:43:02,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:43:02,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:43:02,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:43:02,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:43:02,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:43:02,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:43:02,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:43:02,354 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:43:02,355 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:43:02,770 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:43:02,780 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:43:02,780 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-02-20 16:43:02,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:43:02 BoogieIcfgContainer [2022-02-20 16:43:02,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:43:02,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:43:02,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:43:02,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:43:02,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:43:01" (1/3) ... [2022-02-20 16:43:02,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a40c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:43:02, skipping insertion in model container [2022-02-20 16:43:02,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:02" (2/3) ... [2022-02-20 16:43:02,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a40c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:43:02, skipping insertion in model container [2022-02-20 16:43:02,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:43:02" (3/3) ... [2022-02-20 16:43:02,792 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0834.c [2022-02-20 16:43:02,796 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:43:02,796 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:43:02,858 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:43:02,871 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:43:02,871 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:43:02,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 46 states have internal predecessors, (78), 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:43:02,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:43:02,905 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:43:02,906 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:43:02,907 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:43:02,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:43:02,913 INFO L85 PathProgramCache]: Analyzing trace with hash 472454986, now seen corresponding path program 1 times [2022-02-20 16:43:02,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:43:02,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077591257] [2022-02-20 16:43:02,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:43:02,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:43:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:03,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#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(20, 2);call #Ultimate.allocInit(12, 3);~one_exp~0 := 1.0;~#halF_exp~0.base, ~#halF_exp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~real(0.5, ~#halF_exp~0.base, ~#halF_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.5), ~#halF_exp~0.base, 4 + ~#halF_exp~0.offset, 4);~huge_exp~0 := 1.0E30;~twom100_exp~0 := 7.8886090522E-31;~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~real(0.69313812256, ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.69313812256), ~#ln2HI_exp~0.base, 4 + ~#ln2HI_exp~0.offset, 4);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6, 0;call #Ultimate.allocInit(8, 6);call write~init~real(9.0580006145E-6, ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(9.0580006145E-6), ~#ln2LO_exp~0.base, 4 + ~#ln2LO_exp~0.offset, 4);~invln2_exp~0 := 1.4426950216;~P1_exp~0 := 0.16666667163;~P2_exp~0 := ~someUnaryDOUBLEoperation(0.002777777845);~P3_exp~0 := 6.613755977E-5;~P4_exp~0 := ~someUnaryDOUBLEoperation(1.6533901999E-6);~P5_exp~0 := 4.1381369442E-8; {50#true} is VALID [2022-02-20 16:43:03,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1, main_#t~ret19#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0);assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_#t~mem12#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem15#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem16#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1, __ieee754_expf_#t~nondet5#1, __ieee754_expf_#t~nondet6#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {50#true} is VALID [2022-02-20 16:43:03,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {50#true} assume !true; {51#false} is VALID [2022-02-20 16:43:03,103 INFO L290 TraceCheckUtils]: 3: Hoare triple {51#false} assume 0 == (if __ieee754_expf_~sx~0#1 >= 0 then 0 else 1);__ieee754_expf_~xsb~0#1 := 0; {51#false} is VALID [2022-02-20 16:43:03,103 INFO L290 TraceCheckUtils]: 4: Hoare triple {51#false} assume 0 == __ieee754_expf_~sx~0#1;__ieee754_expf_~hx~0#1 := 0; {51#false} is VALID [2022-02-20 16:43:03,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {51#false} assume __ieee754_expf_~hx~0#1 % 4294967296 > 2139095040;__ieee754_expf_#res#1 := ~someBinaryArithmeticFLOAToperation(__ieee754_expf_~x#1, __ieee754_expf_~x#1); {51#false} is VALID [2022-02-20 16:43:03,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {51#false} main_#t~ret18#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret18#1;havoc main_#t~ret18#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~mem17#1, isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, isinf_float_~x#1, isinf_float_~ix~0#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~0#1; {51#false} is VALID [2022-02-20 16:43:03,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {51#false} assume !true; {51#false} is VALID [2022-02-20 16:43:03,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#false} isinf_float_~ix~0#1 := (if 0 == isinf_float_~ix~0#1 then 0 else (if 1 == isinf_float_~ix~0#1 then 1 else ~bitwiseAnd(isinf_float_~ix~0#1, 2147483647)));isinf_float_#res#1 := (if 2139095040 == isinf_float_~ix~0#1 then 1 else 0); {51#false} is VALID [2022-02-20 16:43:03,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {51#false} main_#t~ret19#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;assume -2147483648 <= main_#t~ret19#1 && main_#t~ret19#1 <= 2147483647; {51#false} is VALID [2022-02-20 16:43:03,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {51#false} assume 0 == main_#t~ret19#1;havoc main_#t~ret19#1; {51#false} is VALID [2022-02-20 16:43:03,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {51#false} assume !false; {51#false} is VALID [2022-02-20 16:43:03,108 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:43:03,108 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:43:03,109 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077591257] [2022-02-20 16:43:03,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077591257] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:43:03,110 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:43:03,110 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:43:03,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268282447] [2022-02-20 16:43:03,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:43:03,120 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:43:03,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:43:03,125 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:43:03,142 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:43:03,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:43:03,143 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:43:03,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:43:03,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:43:03,173 INFO L87 Difference]: Start difference. First operand has 47 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 46 states have internal predecessors, (78), 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:43:03,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:03,249 INFO L93 Difference]: Finished difference Result 91 states and 152 transitions. [2022-02-20 16:43:03,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:43:03,249 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:43:03,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:43:03,251 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:43:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 152 transitions. [2022-02-20 16:43:03,264 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:43:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 152 transitions. [2022-02-20 16:43:03,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 152 transitions. [2022-02-20 16:43:03,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:03,420 INFO L225 Difference]: With dead ends: 91 [2022-02-20 16:43:03,421 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 16:43:03,425 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:43:03,431 INFO L933 BasicCegarLoop]: 60 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, 60 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:43:03,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:43:03,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 16:43:03,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-20 16:43:03,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:43:03,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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:43:03,465 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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:43:03,466 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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:43:03,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:03,470 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-02-20 16:43:03,470 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-02-20 16:43:03,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:03,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:03,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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 43 states. [2022-02-20 16:43:03,475 INFO L87 Difference]: Start difference. First operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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 43 states. [2022-02-20 16:43:03,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:03,480 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-02-20 16:43:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-02-20 16:43:03,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:03,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:03,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:43:03,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:43:03,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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:43:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-02-20 16:43:03,487 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 12 [2022-02-20 16:43:03,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:43:03,488 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2022-02-20 16:43:03,488 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:43:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-02-20 16:43:03,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:43:03,492 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:43:03,493 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:43:03,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:43:03,495 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:43:03,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:43:03,498 INFO L85 PathProgramCache]: Analyzing trace with hash 299673487, now seen corresponding path program 1 times [2022-02-20 16:43:03,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:43:03,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730871324] [2022-02-20 16:43:03,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:43:03,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:43:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:03,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#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(20, 2);call #Ultimate.allocInit(12, 3);~one_exp~0 := 1.0;~#halF_exp~0.base, ~#halF_exp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~real(0.5, ~#halF_exp~0.base, ~#halF_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.5), ~#halF_exp~0.base, 4 + ~#halF_exp~0.offset, 4);~huge_exp~0 := 1.0E30;~twom100_exp~0 := 7.8886090522E-31;~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~real(0.69313812256, ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.69313812256), ~#ln2HI_exp~0.base, 4 + ~#ln2HI_exp~0.offset, 4);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6, 0;call #Ultimate.allocInit(8, 6);call write~init~real(9.0580006145E-6, ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(9.0580006145E-6), ~#ln2LO_exp~0.base, 4 + ~#ln2LO_exp~0.offset, 4);~invln2_exp~0 := 1.4426950216;~P1_exp~0 := 0.16666667163;~P2_exp~0 := ~someUnaryDOUBLEoperation(0.002777777845);~P3_exp~0 := 6.613755977E-5;~P4_exp~0 := ~someUnaryDOUBLEoperation(1.6533901999E-6);~P5_exp~0 := 4.1381369442E-8; {294#true} is VALID [2022-02-20 16:43:03,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1, main_#t~ret19#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0);assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_#t~mem12#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem15#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem16#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1, __ieee754_expf_#t~nondet5#1, __ieee754_expf_#t~nondet6#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {294#true} is VALID [2022-02-20 16:43:03,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#true} call __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4);call write~real(__ieee754_expf_~x#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4);call __ieee754_expf_#t~mem4#1 := read~int(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4);__ieee754_expf_~sx~0#1 := (if __ieee754_expf_#t~mem4#1 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_expf_#t~mem4#1 % 4294967296 % 4294967296 else __ieee754_expf_#t~mem4#1 % 4294967296 % 4294967296 - 4294967296);havoc __ieee754_expf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset);havoc __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset; {294#true} is VALID [2022-02-20 16:43:03,608 INFO L290 TraceCheckUtils]: 3: Hoare triple {294#true} goto; {294#true} is VALID [2022-02-20 16:43:03,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {294#true} assume 0 == (if __ieee754_expf_~sx~0#1 >= 0 then 0 else 1);__ieee754_expf_~xsb~0#1 := 0; {294#true} is VALID [2022-02-20 16:43:03,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#true} assume 0 == __ieee754_expf_~sx~0#1;__ieee754_expf_~hx~0#1 := 0; {296#(= |ULTIMATE.start___ieee754_expf_~hx~0#1| 0)} is VALID [2022-02-20 16:43:03,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {296#(= |ULTIMATE.start___ieee754_expf_~hx~0#1| 0)} assume __ieee754_expf_~hx~0#1 % 4294967296 > 2139095040;__ieee754_expf_#res#1 := ~someBinaryArithmeticFLOAToperation(__ieee754_expf_~x#1, __ieee754_expf_~x#1); {295#false} is VALID [2022-02-20 16:43:03,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {295#false} main_#t~ret18#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret18#1;havoc main_#t~ret18#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~mem17#1, isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, isinf_float_~x#1, isinf_float_~ix~0#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~0#1; {295#false} is VALID [2022-02-20 16:43:03,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {295#false} call isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset := #Ultimate.allocOnStack(4);call write~real(isinf_float_~x#1, isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, 4);call isinf_float_#t~mem17#1 := read~int(isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, 4);isinf_float_~ix~0#1 := (if isinf_float_#t~mem17#1 % 4294967296 % 4294967296 <= 2147483647 then isinf_float_#t~mem17#1 % 4294967296 % 4294967296 else isinf_float_#t~mem17#1 % 4294967296 % 4294967296 - 4294967296);havoc isinf_float_#t~mem17#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset);havoc isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset; {295#false} is VALID [2022-02-20 16:43:03,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {295#false} goto; {295#false} is VALID [2022-02-20 16:43:03,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {295#false} isinf_float_~ix~0#1 := (if 0 == isinf_float_~ix~0#1 then 0 else (if 1 == isinf_float_~ix~0#1 then 1 else ~bitwiseAnd(isinf_float_~ix~0#1, 2147483647)));isinf_float_#res#1 := (if 2139095040 == isinf_float_~ix~0#1 then 1 else 0); {295#false} is VALID [2022-02-20 16:43:03,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {295#false} main_#t~ret19#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;assume -2147483648 <= main_#t~ret19#1 && main_#t~ret19#1 <= 2147483647; {295#false} is VALID [2022-02-20 16:43:03,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {295#false} assume 0 == main_#t~ret19#1;havoc main_#t~ret19#1; {295#false} is VALID [2022-02-20 16:43:03,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {295#false} assume !false; {295#false} is VALID [2022-02-20 16:43:03,611 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:43:03,611 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:43:03,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730871324] [2022-02-20 16:43:03,612 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730871324] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:43:03,612 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:43:03,612 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:43:03,612 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319061645] [2022-02-20 16:43:03,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:43:03,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:43:03,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:43:03,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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:43:03,627 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:43:03,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:43:03,628 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:43:03,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:43:03,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:43:03,629 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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:43:03,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:03,743 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-02-20 16:43:03,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:43:03,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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:43:03,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:43:03,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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:43:03,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2022-02-20 16:43:03,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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:43:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2022-02-20 16:43:03,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 121 transitions. [2022-02-20 16:43:03,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:03,847 INFO L225 Difference]: With dead ends: 96 [2022-02-20 16:43:03,847 INFO L226 Difference]: Without dead ends: 71 [2022-02-20 16:43:03,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:43:03,849 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 31 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:43:03,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 93 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:43:03,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-20 16:43:03,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 49. [2022-02-20 16:43:03,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:43:03,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 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:43:03,855 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 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:43:03,855 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 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:43:03,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:03,858 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2022-02-20 16:43:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2022-02-20 16:43:03,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:03,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:03,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 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 71 states. [2022-02-20 16:43:03,859 INFO L87 Difference]: Start difference. First operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 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 71 states. [2022-02-20 16:43:03,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:03,862 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2022-02-20 16:43:03,862 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2022-02-20 16:43:03,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:03,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:03,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:43:03,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:43:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 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:43:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2022-02-20 16:43:03,865 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 14 [2022-02-20 16:43:03,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:43:03,865 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2022-02-20 16:43:03,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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:43:03,866 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2022-02-20 16:43:03,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:43:03,866 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:43:03,867 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:43:03,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:43:03,867 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:43:03,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:43:03,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1094786826, now seen corresponding path program 1 times [2022-02-20 16:43:03,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:43:03,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38381092] [2022-02-20 16:43:03,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:43:03,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:43:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:03,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {608#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(20, 2);call #Ultimate.allocInit(12, 3);~one_exp~0 := 1.0;~#halF_exp~0.base, ~#halF_exp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~real(0.5, ~#halF_exp~0.base, ~#halF_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.5), ~#halF_exp~0.base, 4 + ~#halF_exp~0.offset, 4);~huge_exp~0 := 1.0E30;~twom100_exp~0 := 7.8886090522E-31;~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~real(0.69313812256, ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.69313812256), ~#ln2HI_exp~0.base, 4 + ~#ln2HI_exp~0.offset, 4);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6, 0;call #Ultimate.allocInit(8, 6);call write~init~real(9.0580006145E-6, ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(9.0580006145E-6), ~#ln2LO_exp~0.base, 4 + ~#ln2LO_exp~0.offset, 4);~invln2_exp~0 := 1.4426950216;~P1_exp~0 := 0.16666667163;~P2_exp~0 := ~someUnaryDOUBLEoperation(0.002777777845);~P3_exp~0 := 6.613755977E-5;~P4_exp~0 := ~someUnaryDOUBLEoperation(1.6533901999E-6);~P5_exp~0 := 4.1381369442E-8; {608#true} is VALID [2022-02-20 16:43:03,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {608#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1, main_#t~ret19#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(1.0, 0.0);assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_#t~mem12#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem15#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem16#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1, __ieee754_expf_#t~nondet5#1, __ieee754_expf_#t~nondet6#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {608#true} is VALID [2022-02-20 16:43:03,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {608#true} call __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4);call write~real(__ieee754_expf_~x#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4);call __ieee754_expf_#t~mem4#1 := read~int(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4);__ieee754_expf_~sx~0#1 := (if __ieee754_expf_#t~mem4#1 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_expf_#t~mem4#1 % 4294967296 % 4294967296 else __ieee754_expf_#t~mem4#1 % 4294967296 % 4294967296 - 4294967296);havoc __ieee754_expf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset);havoc __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset; {608#true} is VALID [2022-02-20 16:43:03,922 INFO L290 TraceCheckUtils]: 3: Hoare triple {608#true} goto; {608#true} is VALID [2022-02-20 16:43:03,922 INFO L290 TraceCheckUtils]: 4: Hoare triple {608#true} assume 0 == (if __ieee754_expf_~sx~0#1 >= 0 then 0 else 1);__ieee754_expf_~xsb~0#1 := 0; {608#true} is VALID [2022-02-20 16:43:03,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {608#true} assume 0 == __ieee754_expf_~sx~0#1;__ieee754_expf_~hx~0#1 := 0; {610#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} is VALID [2022-02-20 16:43:03,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {610#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} assume !(__ieee754_expf_~hx~0#1 % 4294967296 > 2139095040); {610#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} is VALID [2022-02-20 16:43:03,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {610#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} assume !(2139095040 == __ieee754_expf_~hx~0#1 % 4294967296); {610#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} is VALID [2022-02-20 16:43:03,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {610#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} assume __ieee754_expf_~sx~0#1 > 1118925335;__ieee754_expf_#res#1 := ~someBinaryArithmeticFLOAToperation(~huge_exp~0, ~huge_exp~0); {609#false} is VALID [2022-02-20 16:43:03,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {609#false} main_#t~ret18#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret18#1;havoc main_#t~ret18#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~mem17#1, isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, isinf_float_~x#1, isinf_float_~ix~0#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~0#1; {609#false} is VALID [2022-02-20 16:43:03,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {609#false} call isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset := #Ultimate.allocOnStack(4);call write~real(isinf_float_~x#1, isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, 4);call isinf_float_#t~mem17#1 := read~int(isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, 4);isinf_float_~ix~0#1 := (if isinf_float_#t~mem17#1 % 4294967296 % 4294967296 <= 2147483647 then isinf_float_#t~mem17#1 % 4294967296 % 4294967296 else isinf_float_#t~mem17#1 % 4294967296 % 4294967296 - 4294967296);havoc isinf_float_#t~mem17#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset);havoc isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset; {609#false} is VALID [2022-02-20 16:43:03,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {609#false} goto; {609#false} is VALID [2022-02-20 16:43:03,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {609#false} isinf_float_~ix~0#1 := (if 0 == isinf_float_~ix~0#1 then 0 else (if 1 == isinf_float_~ix~0#1 then 1 else ~bitwiseAnd(isinf_float_~ix~0#1, 2147483647)));isinf_float_#res#1 := (if 2139095040 == isinf_float_~ix~0#1 then 1 else 0); {609#false} is VALID [2022-02-20 16:43:03,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {609#false} main_#t~ret19#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true;assume -2147483648 <= main_#t~ret19#1 && main_#t~ret19#1 <= 2147483647; {609#false} is VALID [2022-02-20 16:43:03,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {609#false} assume 0 == main_#t~ret19#1;havoc main_#t~ret19#1; {609#false} is VALID [2022-02-20 16:43:03,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {609#false} assume !false; {609#false} is VALID [2022-02-20 16:43:03,926 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:43:03,927 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:43:03,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38381092] [2022-02-20 16:43:03,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38381092] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:43:03,927 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:43:03,927 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:43:03,928 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488534165] [2022-02-20 16:43:03,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:43:03,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-02-20 16:43:03,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:43:03,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:43:03,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:03,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:43:03,944 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:43:03,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:43:03,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:43:03,945 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:43:04,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:04,041 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2022-02-20 16:43:04,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:43:04,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-02-20 16:43:04,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:43:04,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:43:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-02-20 16:43:04,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:43:04,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-02-20 16:43:04,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2022-02-20 16:43:04,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:04,136 INFO L225 Difference]: With dead ends: 93 [2022-02-20 16:43:04,136 INFO L226 Difference]: Without dead ends: 85 [2022-02-20 16:43:04,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:43:04,137 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 45 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:43:04,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 113 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:43:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-20 16:43:04,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 56. [2022-02-20 16:43:04,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:43:04,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 56 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 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:43:04,143 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 56 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 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:43:04,143 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 56 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 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:43:04,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:04,146 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2022-02-20 16:43:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2022-02-20 16:43:04,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:04,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:04,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 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 85 states. [2022-02-20 16:43:04,147 INFO L87 Difference]: Start difference. First operand has 56 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 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 85 states. [2022-02-20 16:43:04,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:04,150 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2022-02-20 16:43:04,150 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2022-02-20 16:43:04,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:04,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:04,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:43:04,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:43:04,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 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:43:04,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2022-02-20 16:43:04,153 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 16 [2022-02-20 16:43:04,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:43:04,154 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2022-02-20 16:43:04,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:43:04,154 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-02-20 16:43:04,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:43:04,155 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:43:04,155 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:43:04,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:43:04,155 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:43:04,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:43:04,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1249306747, now seen corresponding path program 1 times [2022-02-20 16:43:04,156 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:43:04,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663020458] [2022-02-20 16:43:04,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:43:04,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:43:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:43:04,198 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:43:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:43:04,265 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:43:04,265 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:43:04,266 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:43:04,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:43:04,271 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 16:43:04,273 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:43:04,320 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:43:04,320 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:43:04,320 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:43:04,320 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:43:04,320 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:43:04,320 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:43:04,320 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:43:04,320 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:43:04,320 WARN L170 areAnnotationChecker]: L48-7 has no Hoare annotation [2022-02-20 16:43:04,321 WARN L170 areAnnotationChecker]: L48-7 has no Hoare annotation [2022-02-20 16:43:04,321 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-02-20 16:43:04,321 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-02-20 16:43:04,321 WARN L170 areAnnotationChecker]: L49-7 has no Hoare annotation [2022-02-20 16:43:04,321 WARN L170 areAnnotationChecker]: L49-7 has no Hoare annotation [2022-02-20 16:43:04,321 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 16:43:04,321 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 16:43:04,321 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-02-20 16:43:04,321 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-02-20 16:43:04,321 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:43:04,321 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 16:43:04,321 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 16:43:04,321 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:43:04,321 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:43:04,321 WARN L170 areAnnotationChecker]: L48-5 has no Hoare annotation [2022-02-20 16:43:04,321 WARN L170 areAnnotationChecker]: L48-5 has no Hoare annotation [2022-02-20 16:43:04,322 WARN L170 areAnnotationChecker]: L116-2 has no Hoare annotation [2022-02-20 16:43:04,322 WARN L170 areAnnotationChecker]: L116-2 has no Hoare annotation [2022-02-20 16:43:04,322 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:43:04,322 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:43:04,322 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:43:04,322 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:43:04,322 WARN L170 areAnnotationChecker]: L49-5 has no Hoare annotation [2022-02-20 16:43:04,322 WARN L170 areAnnotationChecker]: L49-5 has no Hoare annotation [2022-02-20 16:43:04,322 WARN L170 areAnnotationChecker]: L116-1 has no Hoare annotation [2022-02-20 16:43:04,322 WARN L170 areAnnotationChecker]: L116-1 has no Hoare annotation [2022-02-20 16:43:04,322 WARN L170 areAnnotationChecker]: L116-3 has no Hoare annotation [2022-02-20 16:43:04,322 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2022-02-20 16:43:04,322 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:43:04,322 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:43:04,322 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2022-02-20 16:43:04,322 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:43:04,322 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:43:04,322 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:43:04,322 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:43:04,323 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:43:04,323 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:43:04,323 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:43:04,323 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:43:04,323 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:43:04,323 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:43:04,323 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2022-02-20 16:43:04,323 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:43:04,323 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:43:04,323 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:43:04,323 WARN L170 areAnnotationChecker]: L72-2 has no Hoare annotation [2022-02-20 16:43:04,323 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:43:04,323 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:43:04,323 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:43:04,323 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 16:43:04,323 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 16:43:04,324 WARN L170 areAnnotationChecker]: L86-2 has no Hoare annotation [2022-02-20 16:43:04,324 WARN L170 areAnnotationChecker]: L86-2 has no Hoare annotation [2022-02-20 16:43:04,324 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:43:04,324 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:43:04,324 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 16:43:04,324 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 16:43:04,324 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2022-02-20 16:43:04,324 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2022-02-20 16:43:04,324 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:43:04,324 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:43:04,324 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-02-20 16:43:04,324 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-02-20 16:43:04,324 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2022-02-20 16:43:04,324 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2022-02-20 16:43:04,325 WARN L170 areAnnotationChecker]: L91-2 has no Hoare annotation [2022-02-20 16:43:04,325 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 16:43:04,325 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 16:43:04,325 WARN L170 areAnnotationChecker]: L104-2 has no Hoare annotation [2022-02-20 16:43:04,325 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:43:04,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:43:04 BoogieIcfgContainer [2022-02-20 16:43:04,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:43:04,326 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:43:04,326 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:43:04,327 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:43:04,327 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:43:02" (3/4) ... [2022-02-20 16:43:04,330 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:43:04,330 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:43:04,331 INFO L158 Benchmark]: Toolchain (without parser) took 2553.94ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 68.3MB in the beginning and 93.3MB in the end (delta: -25.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:43:04,331 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 100.7MB. Free memory is still 56.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:43:04,332 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.57ms. Allocated memory is still 100.7MB. Free memory was 68.1MB in the beginning and 74.1MB in the end (delta: -6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:43:04,332 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.08ms. Allocated memory is still 100.7MB. Free memory was 74.1MB in the beginning and 71.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:43:04,333 INFO L158 Benchmark]: Boogie Preprocessor took 27.37ms. Allocated memory is still 100.7MB. Free memory was 71.2MB in the beginning and 69.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:43:04,333 INFO L158 Benchmark]: RCFGBuilder took 580.12ms. Allocated memory is still 100.7MB. Free memory was 69.1MB in the beginning and 48.6MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-02-20 16:43:04,334 INFO L158 Benchmark]: TraceAbstraction took 1542.18ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 48.2MB in the beginning and 93.3MB in the end (delta: -45.1MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2022-02-20 16:43:04,334 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 121.6MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:43:04,336 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.21ms. Allocated memory is still 100.7MB. Free memory is still 56.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.57ms. Allocated memory is still 100.7MB. Free memory was 68.1MB in the beginning and 74.1MB in the end (delta: -6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.08ms. Allocated memory is still 100.7MB. Free memory was 74.1MB in the beginning and 71.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.37ms. Allocated memory is still 100.7MB. Free memory was 71.2MB in the beginning and 69.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 580.12ms. Allocated memory is still 100.7MB. Free memory was 69.1MB in the beginning and 48.6MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1542.18ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 48.2MB in the beginning and 93.3MB in the end (delta: -45.1MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 121.6MB. Free memory is still 93.3MB. 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: 137]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someUnaryDOUBLEoperation at line 21, overapproximation of someBinaryArithmeticFLOAToperation at line 52, overapproximation of bitwiseAnd at line 121. Possible FailurePath: [L17-L36] static const float one_exp = 1.0, halF_exp[2] = { 0.5, -0.5, }, huge_exp = 1.0e+30, twom100_exp = 7.8886090522e-31, ln2HI_exp[2] = { 6.9313812256e-01, -6.9313812256e-01, }, ln2LO_exp[2] = { 9.0580006145e-06, -9.0580006145e-06, }, invln2_exp = 1.4426950216e+00, P1_exp = 1.6666667163e-01, P2_exp = -2.7777778450e-03, P3_exp = 6.6137559770e-05, P4_exp = -1.6533901999e-06, P5_exp = 4.1381369442e-08; VAL [halF_exp={4:0}, huge_exp=1000000000000000000000000000000, invln2_exp=1803368777/1250000000, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, twom100_exp=39443045261/50000000000000000000000000000000000000000] [L132] float x = 1.0f / 0.0f; [L133] CALL, EXPR __ieee754_expf(x) [L39] float y, hi, lo, c, t; [L40] __int32_t k = 0, xsb, sx; [L41] __uint32_t hx; VAL [\old(x)=1000000000000000000000000000001, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, invln2_exp=1803368777/1250000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000001] [L44] ieee_float_shape_type gf_u; [L45] gf_u.value = (x) [L46] EXPR gf_u.word [L46] (sx) = gf_u.word [L48] xsb = (sx >> 31) & 1 VAL [\old(x)=1000000000000000000000000000001, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, invln2_exp=1803368777/1250000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, sx=2147483647, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000001, xsb=0] [L49] hx = sx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000001, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, hx=2139095041, hx = sx & 0x7fffffff=2147483647, invln2_exp=1803368777/1250000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, sx=2147483647, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000001, xsb=0] [L51] COND TRUE ((hx) > 0x7f800000L) [L52] return x + x; VAL [\old(x)=1000000000000000000000000000001, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, hx=2139095041, hx = sx & 0x7fffffff=2147483647, invln2_exp=1803368777/1250000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, sx=2147483647, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000001, xsb=0] [L133] RET, EXPR __ieee754_expf(x) [L133] float res = __ieee754_expf(x); [L136] CALL, EXPR isinf_float(res) [L115] __int32_t ix; VAL [\old(x)=1000000000000000000000000000002, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, hx = sx & 0x7fffffff=2147483647, invln2_exp=1803368777/1250000000, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000002] [L117] ieee_float_shape_type gf_u; [L118] gf_u.value = (x) [L119] EXPR gf_u.word [L119] (ix) = gf_u.word [L121] ix &= 0x7fffffff [L122] return ((ix) == 0x7f800000L); VAL [\old(x)=1000000000000000000000000000002, \result=0, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, hx = sx & 0x7fffffff=2147483647, invln2_exp=1803368777/1250000000, ix=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000002] [L136] RET, EXPR isinf_float(res) [L136] COND TRUE !isinf_float(res) [L137] reach_error() VAL [halF_exp={4:0}, huge_exp=1000000000000000000000000000000, hx = sx & 0x7fffffff=2147483647, invln2_exp=1803368777/1250000000, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, res=1000000000000000000000000000002, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000001] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 76 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 266 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38 IncrementalHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 183 mSDtfsCounter, 38 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=3, InterpolantAutomatonStates: 8, 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, 3 MinimizatonAttempts, 51 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 47 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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:43:04,367 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_0834.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 50ed40b69e81fb917053aec6552591dca3f64c8cb874eda039e4af9ce9424f97 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:43:06,292 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:43:06,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:43:06,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:43:06,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:43:06,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:43:06,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:43:06,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:43:06,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:43:06,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:43:06,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:43:06,359 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:43:06,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:43:06,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:43:06,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:43:06,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:43:06,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:43:06,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:43:06,369 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:43:06,372 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:43:06,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:43:06,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:43:06,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:43:06,379 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:43:06,382 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:43:06,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:43:06,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:43:06,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:43:06,387 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:43:06,388 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:43:06,388 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:43:06,389 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:43:06,390 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:43:06,391 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:43:06,392 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:43:06,392 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:43:06,393 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:43:06,393 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:43:06,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:43:06,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:43:06,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:43:06,396 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:43:06,429 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:43:06,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:43:06,430 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:43:06,430 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:43:06,431 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:43:06,431 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:43:06,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:43:06,433 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:43:06,433 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:43:06,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:43:06,434 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:43:06,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:43:06,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:43:06,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:43:06,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:43:06,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:43:06,435 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:43:06,435 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:43:06,435 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:43:06,436 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:43:06,436 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:43:06,436 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:43:06,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:43:06,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:43:06,436 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:43:06,437 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:43:06,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:43:06,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:43:06,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:43:06,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:43:06,446 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:43:06,446 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:43:06,446 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:43:06,446 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:43:06,447 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:43:06,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:43:06,447 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 -> 50ed40b69e81fb917053aec6552591dca3f64c8cb874eda039e4af9ce9424f97 [2022-02-20 16:43:06,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:43:06,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:43:06,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:43:06,743 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:43:06,744 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:43:06,745 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0834.c [2022-02-20 16:43:06,805 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7ab6f2f6/218c886e2ed4476b8829e26801222f9c/FLAG90736aac1 [2022-02-20 16:43:07,245 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:43:07,246 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0834.c [2022-02-20 16:43:07,255 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7ab6f2f6/218c886e2ed4476b8829e26801222f9c/FLAG90736aac1 [2022-02-20 16:43:07,269 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7ab6f2f6/218c886e2ed4476b8829e26801222f9c [2022-02-20 16:43:07,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:43:07,277 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:43:07,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:43:07,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:43:07,282 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:43:07,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:43:07" (1/1) ... [2022-02-20 16:43:07,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36f5dcc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:07, skipping insertion in model container [2022-02-20 16:43:07,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:43:07" (1/1) ... [2022-02-20 16:43:07,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:43:07,315 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:43:07,562 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_0834.c[3447,3460] [2022-02-20 16:43:07,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:43:07,590 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:43:07,641 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_0834.c[3447,3460] [2022-02-20 16:43:07,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:43:07,676 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:43:07,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:07 WrapperNode [2022-02-20 16:43:07,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:43:07,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:43:07,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:43:07,679 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:43:07,685 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:43:07" (1/1) ... [2022-02-20 16:43:07,707 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:43:07" (1/1) ... [2022-02-20 16:43:07,753 INFO L137 Inliner]: procedures = 22, calls = 47, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 181 [2022-02-20 16:43:07,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:43:07,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:43:07,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:43:07,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:43:07,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:07" (1/1) ... [2022-02-20 16:43:07,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:07" (1/1) ... [2022-02-20 16:43:07,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:07" (1/1) ... [2022-02-20 16:43:07,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:07" (1/1) ... [2022-02-20 16:43:07,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:07" (1/1) ... [2022-02-20 16:43:07,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:07" (1/1) ... [2022-02-20 16:43:07,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:07" (1/1) ... [2022-02-20 16:43:07,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:43:07,829 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:43:07,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:43:07,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:43:07,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:07" (1/1) ... [2022-02-20 16:43:07,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:43:07,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:43:07,864 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:43:07,880 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:43:07,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:43:07,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:43:07,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:43:07,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:43:07,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:43:07,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:43:07,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:43:07,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:43:07,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:43:07,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:43:07,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:43:08,011 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:43:08,013 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:43:17,250 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:43:17,261 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:43:17,261 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-02-20 16:43:17,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:43:17 BoogieIcfgContainer [2022-02-20 16:43:17,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:43:17,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:43:17,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:43:17,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:43:17,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:43:07" (1/3) ... [2022-02-20 16:43:17,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3563eeeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:43:17, skipping insertion in model container [2022-02-20 16:43:17,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:07" (2/3) ... [2022-02-20 16:43:17,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3563eeeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:43:17, skipping insertion in model container [2022-02-20 16:43:17,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:43:17" (3/3) ... [2022-02-20 16:43:17,269 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0834.c [2022-02-20 16:43:17,274 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:43:17,274 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:43:17,312 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:43:17,320 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:43:17,321 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:43:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 39 states have internal predecessors, (63), 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:43:17,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:43:17,340 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:43:17,341 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:43:17,342 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:43:17,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:43:17,352 INFO L85 PathProgramCache]: Analyzing trace with hash 619608955, now seen corresponding path program 1 times [2022-02-20 16:43:17,366 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:43:17,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972092134] [2022-02-20 16:43:17,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:43:17,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:43:17,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:43:17,373 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:43:17,374 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:43:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:17,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:43:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:17,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:43:17,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#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(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#halF_exp~0.base, ~#halF_exp~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~#halF_exp~0.base, ~#halF_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.5))), ~#halF_exp~0.base, ~bvadd32(4bv32, ~#halF_exp~0.offset), 4bv32);~huge_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~twom100_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.8886090522E-31));~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(8bv32, 5bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.69313812256)), ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.69313812256))), ~#ln2HI_exp~0.base, ~bvadd32(4bv32, ~#ln2HI_exp~0.offset), 4bv32);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(8bv32, 6bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6)), ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6))), ~#ln2LO_exp~0.base, ~bvadd32(4bv32, ~#ln2LO_exp~0.offset), 4bv32);~invln2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.4426950216));~P1_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.16666667163));~P2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.002777777845)));~P3_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 6.613755977E-5));~P4_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.6533901999E-6)));~P5_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 4.1381369442E-8)); {43#true} is VALID [2022-02-20 16:43:17,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1, main_#t~ret17#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite5#1, __ieee754_expf_#t~mem6#1, __ieee754_expf_#t~mem7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem12#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0bv32;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {43#true} is VALID [2022-02-20 16:43:17,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume !true; {44#false} is VALID [2022-02-20 16:43:17,992 INFO L290 TraceCheckUtils]: 3: Hoare triple {44#false} __ieee754_expf_~xsb~0#1 := ~bvand32(1bv32, ~bvashr32(__ieee754_expf_~sx~0#1, 31bv32));__ieee754_expf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_expf_~sx~0#1); {44#false} is VALID [2022-02-20 16:43:17,992 INFO L290 TraceCheckUtils]: 4: Hoare triple {44#false} assume ~bvugt32(__ieee754_expf_~hx~0#1, 2139095040bv32);__ieee754_expf_#res#1 := ~fp.add~FLOAT(currentRoundingMode, __ieee754_expf_~x#1, __ieee754_expf_~x#1); {44#false} is VALID [2022-02-20 16:43:17,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {44#false} main_#t~ret16#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret16#1;havoc main_#t~ret16#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~mem15#1, isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, isinf_float_~x#1, isinf_float_~ix~0#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~0#1; {44#false} is VALID [2022-02-20 16:43:17,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {44#false} assume !true; {44#false} is VALID [2022-02-20 16:43:17,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {44#false} isinf_float_~ix~0#1 := ~bvand32(2147483647bv32, isinf_float_~ix~0#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~0#1 then 1bv32 else 0bv32); {44#false} is VALID [2022-02-20 16:43:17,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {44#false} main_#t~ret17#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {44#false} is VALID [2022-02-20 16:43:17,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume 0bv32 == main_#t~ret17#1;havoc main_#t~ret17#1; {44#false} is VALID [2022-02-20 16:43:17,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-02-20 16:43:17,994 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:43:17,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:43:17,995 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:43:17,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972092134] [2022-02-20 16:43:17,996 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972092134] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:43:17,996 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:43:17,996 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:43:17,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753333093] [2022-02-20 16:43:17,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:43:18,003 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2022-02-20 16:43:18,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:43:18,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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:43:18,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:18,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:43:18,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:43:18,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:43:18,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:43:18,067 INFO L87 Difference]: Start difference. First operand has 40 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 39 states have internal predecessors, (63), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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:43:27,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:27,290 INFO L93 Difference]: Finished difference Result 78 states and 124 transitions. [2022-02-20 16:43:27,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:43:27,290 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2022-02-20 16:43:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:43:27,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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:43:27,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 124 transitions. [2022-02-20 16:43:27,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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:43:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 124 transitions. [2022-02-20 16:43:27,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 124 transitions. [2022-02-20 16:43:29,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:29,711 INFO L225 Difference]: With dead ends: 78 [2022-02-20 16:43:29,711 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 16:43:29,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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:43:29,716 INFO L933 BasicCegarLoop]: 50 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, 50 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:43:29,716 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:43:29,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 16:43:29,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-02-20 16:43:29,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:43:29,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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:43:29,743 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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:43:29,744 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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:43:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:29,747 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-02-20 16:43:29,747 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-02-20 16:43:29,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:29,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:29,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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:43:29,749 INFO L87 Difference]: Start difference. First operand has 37 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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:43:29,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:29,751 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-02-20 16:43:29,752 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-02-20 16:43:29,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:29,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:29,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:43:29,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:43:29,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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:43:29,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-02-20 16:43:29,756 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 11 [2022-02-20 16:43:29,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:43:29,756 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-02-20 16:43:29,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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:43:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-02-20 16:43:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:43:29,764 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:43:29,764 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:43:29,780 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:43:29,965 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:43:29,965 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:43:29,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:43:29,966 INFO L85 PathProgramCache]: Analyzing trace with hash -434363397, now seen corresponding path program 1 times [2022-02-20 16:43:29,967 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:43:29,967 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47446908] [2022-02-20 16:43:29,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:43:29,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:43:29,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:43:29,972 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:43:29,974 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:43:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:30,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:43:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:30,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:43:30,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {286#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(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#halF_exp~0.base, ~#halF_exp~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~#halF_exp~0.base, ~#halF_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.5))), ~#halF_exp~0.base, ~bvadd32(4bv32, ~#halF_exp~0.offset), 4bv32);~huge_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~twom100_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.8886090522E-31));~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(8bv32, 5bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.69313812256)), ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.69313812256))), ~#ln2HI_exp~0.base, ~bvadd32(4bv32, ~#ln2HI_exp~0.offset), 4bv32);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(8bv32, 6bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6)), ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6))), ~#ln2LO_exp~0.base, ~bvadd32(4bv32, ~#ln2LO_exp~0.offset), 4bv32);~invln2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.4426950216));~P1_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.16666667163));~P2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.002777777845)));~P3_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 6.613755977E-5));~P4_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.6533901999E-6)));~P5_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 4.1381369442E-8)); {286#true} is VALID [2022-02-20 16:43:30,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1, main_#t~ret17#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite5#1, __ieee754_expf_#t~mem6#1, __ieee754_expf_#t~mem7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem12#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0bv32;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {294#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:43:30,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} call __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_expf_~x#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4bv32);call __ieee754_expf_#t~mem4#1 := read~intINTTYPE4(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4bv32);__ieee754_expf_~sx~0#1 := __ieee754_expf_#t~mem4#1;havoc __ieee754_expf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset);havoc __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset; {298#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:43:30,809 INFO L290 TraceCheckUtils]: 3: Hoare triple {298#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} goto; {298#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:43:30,811 INFO L290 TraceCheckUtils]: 4: Hoare triple {298#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} __ieee754_expf_~xsb~0#1 := ~bvand32(1bv32, ~bvashr32(__ieee754_expf_~sx~0#1, 31bv32));__ieee754_expf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_expf_~sx~0#1); {305#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_expf_~hx~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))))} is VALID [2022-02-20 16:43:30,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {305#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_expf_~hx~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))))} assume ~bvugt32(__ieee754_expf_~hx~0#1, 2139095040bv32);__ieee754_expf_#res#1 := ~fp.add~FLOAT(currentRoundingMode, __ieee754_expf_~x#1, __ieee754_expf_~x#1); {287#false} is VALID [2022-02-20 16:43:30,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {287#false} main_#t~ret16#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret16#1;havoc main_#t~ret16#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~mem15#1, isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, isinf_float_~x#1, isinf_float_~ix~0#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~0#1; {287#false} is VALID [2022-02-20 16:43:30,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {287#false} call isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, 4bv32);call isinf_float_#t~mem15#1 := read~intINTTYPE4(isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, 4bv32);isinf_float_~ix~0#1 := isinf_float_#t~mem15#1;havoc isinf_float_#t~mem15#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset);havoc isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset; {287#false} is VALID [2022-02-20 16:43:30,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {287#false} goto; {287#false} is VALID [2022-02-20 16:43:30,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {287#false} isinf_float_~ix~0#1 := ~bvand32(2147483647bv32, isinf_float_~ix~0#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~0#1 then 1bv32 else 0bv32); {287#false} is VALID [2022-02-20 16:43:30,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {287#false} main_#t~ret17#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {287#false} is VALID [2022-02-20 16:43:30,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {287#false} assume 0bv32 == main_#t~ret17#1;havoc main_#t~ret17#1; {287#false} is VALID [2022-02-20 16:43:30,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {287#false} assume !false; {287#false} is VALID [2022-02-20 16:43:30,823 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:43:30,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:43:30,824 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:43:30,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47446908] [2022-02-20 16:43:30,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47446908] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:43:30,824 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:43:30,824 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:43:30,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298733200] [2022-02-20 16:43:30,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:43:30,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-02-20 16:43:30,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:43:30,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:43:30,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:30,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:43:30,863 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:43:30,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:43:30,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:43:30,864 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:43:55,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:55,894 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-02-20 16:43:55,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:43:55,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-02-20 16:43:55,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:43:55,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:43:55,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-02-20 16:43:55,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:43:55,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-02-20 16:43:55,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2022-02-20 16:43:57,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:57,061 INFO L225 Difference]: With dead ends: 45 [2022-02-20 16:43:57,061 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 16:43:57,062 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:43:57,063 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:43:57,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 28 Unchecked, 0.0s Time] [2022-02-20 16:43:57,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 16:43:57,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-02-20 16:43:57,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:43:57,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 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:43:57,068 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 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:43:57,069 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 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:43:57,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:57,070 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 16:43:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-02-20 16:43:57,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:57,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:57,072 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 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:43:57,072 INFO L87 Difference]: Start difference. First operand has 37 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 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:43:57,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:57,074 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 16:43:57,074 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-02-20 16:43:57,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:57,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:57,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:43:57,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:43:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 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:43:57,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-02-20 16:43:57,077 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 13 [2022-02-20 16:43:57,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:43:57,077 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-02-20 16:43:57,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:43:57,078 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-02-20 16:43:57,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:43:57,078 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:43:57,078 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:43:57,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 16:43:57,298 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:43:57,299 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:43:57,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:43:57,300 INFO L85 PathProgramCache]: Analyzing trace with hash 59976534, now seen corresponding path program 1 times [2022-02-20 16:43:57,300 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:43:57,300 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641754503] [2022-02-20 16:43:57,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:43:57,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:43:57,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:43:57,302 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:43:57,303 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:43:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:57,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:43:57,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:57,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:43:58,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {500#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(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#halF_exp~0.base, ~#halF_exp~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~#halF_exp~0.base, ~#halF_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.5))), ~#halF_exp~0.base, ~bvadd32(4bv32, ~#halF_exp~0.offset), 4bv32);~huge_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~twom100_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.8886090522E-31));~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(8bv32, 5bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.69313812256)), ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.69313812256))), ~#ln2HI_exp~0.base, ~bvadd32(4bv32, ~#ln2HI_exp~0.offset), 4bv32);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(8bv32, 6bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6)), ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6))), ~#ln2LO_exp~0.base, ~bvadd32(4bv32, ~#ln2LO_exp~0.offset), 4bv32);~invln2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.4426950216));~P1_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.16666667163));~P2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.002777777845)));~P3_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 6.613755977E-5));~P4_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.6533901999E-6)));~P5_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 4.1381369442E-8)); {500#true} is VALID [2022-02-20 16:43:58,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {500#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1, main_#t~ret17#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite5#1, __ieee754_expf_#t~mem6#1, __ieee754_expf_#t~mem7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem12#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0bv32;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {508#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:43:58,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {508#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} call __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_expf_~x#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4bv32);call __ieee754_expf_#t~mem4#1 := read~intINTTYPE4(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4bv32);__ieee754_expf_~sx~0#1 := __ieee754_expf_#t~mem4#1;havoc __ieee754_expf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset);havoc __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset; {512#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:43:58,176 INFO L290 TraceCheckUtils]: 3: Hoare triple {512#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} goto; {512#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:43:58,178 INFO L290 TraceCheckUtils]: 4: Hoare triple {512#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} __ieee754_expf_~xsb~0#1 := ~bvand32(1bv32, ~bvashr32(__ieee754_expf_~sx~0#1, 31bv32));__ieee754_expf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_expf_~sx~0#1); {519#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_expf_~hx~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))))} is VALID [2022-02-20 16:43:58,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {519#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_expf_~hx~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))))} assume !~bvugt32(__ieee754_expf_~hx~0#1, 2139095040bv32); {519#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_expf_~hx~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))))} is VALID [2022-02-20 16:43:58,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {519#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_expf_~hx~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))))} assume !(2139095040bv32 == __ieee754_expf_~hx~0#1); {501#false} is VALID [2022-02-20 16:43:58,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {501#false} assume ~bvsgt32(__ieee754_expf_~sx~0#1, 1118925335bv32);__ieee754_expf_#res#1 := ~fp.mul~FLOAT(currentRoundingMode, ~huge_exp~0, ~huge_exp~0); {501#false} is VALID [2022-02-20 16:43:58,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {501#false} main_#t~ret16#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret16#1;havoc main_#t~ret16#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~mem15#1, isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, isinf_float_~x#1, isinf_float_~ix~0#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~0#1; {501#false} is VALID [2022-02-20 16:43:58,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {501#false} call isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, 4bv32);call isinf_float_#t~mem15#1 := read~intINTTYPE4(isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, 4bv32);isinf_float_~ix~0#1 := isinf_float_#t~mem15#1;havoc isinf_float_#t~mem15#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset);havoc isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset; {501#false} is VALID [2022-02-20 16:43:58,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {501#false} goto; {501#false} is VALID [2022-02-20 16:43:58,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {501#false} isinf_float_~ix~0#1 := ~bvand32(2147483647bv32, isinf_float_~ix~0#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~0#1 then 1bv32 else 0bv32); {501#false} is VALID [2022-02-20 16:43:58,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {501#false} main_#t~ret17#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {501#false} is VALID [2022-02-20 16:43:58,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {501#false} assume 0bv32 == main_#t~ret17#1;havoc main_#t~ret17#1; {501#false} is VALID [2022-02-20 16:43:58,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {501#false} assume !false; {501#false} is VALID [2022-02-20 16:43:58,181 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:43:58,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:43:58,182 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:43:58,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641754503] [2022-02-20 16:43:58,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641754503] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:43:58,182 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:43:58,182 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:43:58,182 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457938750] [2022-02-20 16:43:58,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:43:58,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2022-02-20 16:43:58,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:43:58,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:43:58,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:58,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:43:58,232 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:43:58,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:43:58,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:43:58,233 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:43:58,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:58,932 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-02-20 16:43:58,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:43:58,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2022-02-20 16:43:58,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:43:58,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:43:58,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 16:43:58,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:43:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 16:43:58,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-02-20 16:44:00,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:44:00,101 INFO L225 Difference]: With dead ends: 45 [2022-02-20 16:44:00,101 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 16:44:00,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:44:00,102 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:44:00,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 7 Unchecked, 0.0s Time] [2022-02-20 16:44:00,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 16:44:00,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 16:44:00,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:44:00,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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:44:00,105 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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:44:00,105 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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:44:00,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:44:00,106 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-02-20 16:44:00,106 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-02-20 16:44:00,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:44:00,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:44:00,107 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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 17 states. [2022-02-20 16:44:00,107 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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 17 states. [2022-02-20 16:44:00,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:44:00,111 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-02-20 16:44:00,111 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-02-20 16:44:00,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:44:00,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:44:00,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:44:00,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:44:00,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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:44:00,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-02-20 16:44:00,113 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-02-20 16:44:00,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:44:00,113 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-02-20 16:44:00,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:44:00,113 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-02-20 16:44:00,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:44:00,114 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:44:00,114 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:44:00,132 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:44:00,323 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:44:00,324 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:44:00,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:44:00,324 INFO L85 PathProgramCache]: Analyzing trace with hash -760163818, now seen corresponding path program 1 times [2022-02-20 16:44:00,325 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:44:00,325 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232427152] [2022-02-20 16:44:00,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:44:00,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:44:00,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:44:00,326 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:44:00,327 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:44:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:44:00,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 16:44:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:44:00,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:44:01,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {658#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(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#halF_exp~0.base, ~#halF_exp~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~#halF_exp~0.base, ~#halF_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.5))), ~#halF_exp~0.base, ~bvadd32(4bv32, ~#halF_exp~0.offset), 4bv32);~huge_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~twom100_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.8886090522E-31));~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(8bv32, 5bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.69313812256)), ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.69313812256))), ~#ln2HI_exp~0.base, ~bvadd32(4bv32, ~#ln2HI_exp~0.offset), 4bv32);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(8bv32, 6bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6)), ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6))), ~#ln2LO_exp~0.base, ~bvadd32(4bv32, ~#ln2LO_exp~0.offset), 4bv32);~invln2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.4426950216));~P1_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.16666667163));~P2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.002777777845)));~P3_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 6.613755977E-5));~P4_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.6533901999E-6)));~P5_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 4.1381369442E-8)); {663#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:44:01,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {663#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1, main_#t~ret17#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite5#1, __ieee754_expf_#t~mem6#1, __ieee754_expf_#t~mem7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem12#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0bv32;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {667#(and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:44:01,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {667#(and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} call __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_expf_~x#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4bv32);call __ieee754_expf_#t~mem4#1 := read~intINTTYPE4(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4bv32);__ieee754_expf_~sx~0#1 := __ieee754_expf_#t~mem4#1;havoc __ieee754_expf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset);havoc __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset; {667#(and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:44:01,557 INFO L290 TraceCheckUtils]: 3: Hoare triple {667#(and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} goto; {667#(and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:44:01,558 INFO L290 TraceCheckUtils]: 4: Hoare triple {667#(and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} __ieee754_expf_~xsb~0#1 := ~bvand32(1bv32, ~bvashr32(__ieee754_expf_~sx~0#1, 31bv32));__ieee754_expf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_expf_~sx~0#1); {667#(and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:44:01,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {667#(and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} assume !~bvugt32(__ieee754_expf_~hx~0#1, 2139095040bv32); {667#(and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:44:01,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {667#(and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} assume 2139095040bv32 == __ieee754_expf_~hx~0#1; {667#(and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:44:01,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {667#(and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} assume 0bv32 == __ieee754_expf_~xsb~0#1;__ieee754_expf_#t~ite5#1 := ~convertFLOATToDOUBLE(currentRoundingMode, __ieee754_expf_~x#1); {686#(and (= currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 11 53) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) |ULTIMATE.start___ieee754_expf_#t~ite5#1|))} is VALID [2022-02-20 16:44:01,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {686#(and (= currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 11 53) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) |ULTIMATE.start___ieee754_expf_#t~ite5#1|))} __ieee754_expf_#res#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, __ieee754_expf_#t~ite5#1);havoc __ieee754_expf_#t~ite5#1; {690#(= |ULTIMATE.start___ieee754_expf_#res#1| ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))} is VALID [2022-02-20 16:44:01,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {690#(= |ULTIMATE.start___ieee754_expf_#res#1| ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))} main_#t~ret16#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret16#1;havoc main_#t~ret16#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~mem15#1, isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, isinf_float_~x#1, isinf_float_~ix~0#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~0#1; {694#(= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))) |ULTIMATE.start_isinf_float_~x#1|)} is VALID [2022-02-20 16:44:01,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {694#(= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))) |ULTIMATE.start_isinf_float_~x#1|)} call isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, 4bv32);call isinf_float_#t~mem15#1 := read~intINTTYPE4(isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, 4bv32);isinf_float_~ix~0#1 := isinf_float_#t~mem15#1;havoc isinf_float_#t~mem15#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset);havoc isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset; {698#(= (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~0#1|)) ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))} is VALID [2022-02-20 16:44:01,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {698#(= (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~0#1|)) ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))} goto; {698#(= (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~0#1|)) ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))} is VALID [2022-02-20 16:44:01,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {698#(= (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~0#1|)) ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))} isinf_float_~ix~0#1 := ~bvand32(2147483647bv32, isinf_float_~ix~0#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~0#1 then 1bv32 else 0bv32); {705#(= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32))} is VALID [2022-02-20 16:44:01,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {705#(= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32))} main_#t~ret17#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {709#(= |ULTIMATE.start_main_#t~ret17#1| (_ bv1 32))} is VALID [2022-02-20 16:44:01,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {709#(= |ULTIMATE.start_main_#t~ret17#1| (_ bv1 32))} assume 0bv32 == main_#t~ret17#1;havoc main_#t~ret17#1; {659#false} is VALID [2022-02-20 16:44:01,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {659#false} assume !false; {659#false} is VALID [2022-02-20 16:44:01,568 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:44:01,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:44:01,568 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:44:01,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232427152] [2022-02-20 16:44:01,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232427152] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:44:01,568 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:44:01,569 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 16:44:01,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865301870] [2022-02-20 16:44:01,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:44:01,569 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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 16 [2022-02-20 16:44:01,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:44:01,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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:44:01,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:44:01,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 16:44:01,637 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:44:01,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 16:44:01,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:44:01,638 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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:44:03,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:44:03,995 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2022-02-20 16:44:03,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 16:44:03,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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 16 [2022-02-20 16:44:03,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:44:03,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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:44:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 25 transitions. [2022-02-20 16:44:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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:44:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 25 transitions. [2022-02-20 16:44:03,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 25 transitions. [2022-02-20 16:44:04,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:44:04,108 INFO L225 Difference]: With dead ends: 26 [2022-02-20 16:44:04,108 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 16:44:04,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-02-20 16:44:04,109 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 16:44:04,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 66 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 16:44:04,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 16:44:04,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 16:44:04,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:44:04,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.0) internal successors, (16), 16 states have internal predecessors, (16), 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:44:04,112 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.0) internal successors, (16), 16 states have internal predecessors, (16), 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:44:04,112 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 16 states have (on average 1.0) internal successors, (16), 16 states have internal predecessors, (16), 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:44:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:44:04,113 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2022-02-20 16:44:04,113 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2022-02-20 16:44:04,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:44:04,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:44:04,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.0) internal successors, (16), 16 states have internal predecessors, (16), 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 17 states. [2022-02-20 16:44:04,114 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.0) internal successors, (16), 16 states have internal predecessors, (16), 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 17 states. [2022-02-20 16:44:04,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:44:04,114 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2022-02-20 16:44:04,115 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2022-02-20 16:44:04,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:44:04,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:44:04,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:44:04,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:44:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0) internal successors, (16), 16 states have internal predecessors, (16), 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:44:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2022-02-20 16:44:04,116 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 16 [2022-02-20 16:44:04,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:44:04,116 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2022-02-20 16:44:04,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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:44:04,117 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2022-02-20 16:44:04,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:44:04,117 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:44:04,118 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:44:04,136 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:44:04,327 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:44:04,328 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:44:04,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:44:04,328 INFO L85 PathProgramCache]: Analyzing trace with hash -80105448, now seen corresponding path program 1 times [2022-02-20 16:44:04,329 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:44:04,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [151012517] [2022-02-20 16:44:04,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:44:04,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:44:04,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:44:04,330 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:44:04,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:44:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:44:04,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:44:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:44:04,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:44:05,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {815#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(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#halF_exp~0.base, ~#halF_exp~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~#halF_exp~0.base, ~#halF_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.5))), ~#halF_exp~0.base, ~bvadd32(4bv32, ~#halF_exp~0.offset), 4bv32);~huge_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~twom100_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.8886090522E-31));~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(8bv32, 5bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.69313812256)), ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.69313812256))), ~#ln2HI_exp~0.base, ~bvadd32(4bv32, ~#ln2HI_exp~0.offset), 4bv32);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(8bv32, 6bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6)), ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6))), ~#ln2LO_exp~0.base, ~bvadd32(4bv32, ~#ln2LO_exp~0.offset), 4bv32);~invln2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.4426950216));~P1_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.16666667163));~P2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.002777777845)));~P3_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 6.613755977E-5));~P4_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.6533901999E-6)));~P5_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 4.1381369442E-8)); {815#true} is VALID [2022-02-20 16:44:05,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {815#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret16#1, main_#t~ret17#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~to_fp~FLOAT(currentRoundingMode, 1.0), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite5#1, __ieee754_expf_#t~mem6#1, __ieee754_expf_#t~mem7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem12#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0bv32;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {823#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:44:05,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {823#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} call __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_expf_~x#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4bv32);call __ieee754_expf_#t~mem4#1 := read~intINTTYPE4(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4bv32);__ieee754_expf_~sx~0#1 := __ieee754_expf_#t~mem4#1;havoc __ieee754_expf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset);havoc __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset; {827#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:44:05,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {827#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} goto; {827#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} is VALID [2022-02-20 16:44:05,117 INFO L290 TraceCheckUtils]: 4: Hoare triple {827#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))} __ieee754_expf_~xsb~0#1 := ~bvand32(1bv32, ~bvashr32(__ieee754_expf_~sx~0#1, 31bv32));__ieee754_expf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_expf_~sx~0#1); {834#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))) (= (bvand (_ bv1 32) (bvashr |ULTIMATE.start___ieee754_expf_~sx~0#1| (_ bv31 32))) |ULTIMATE.start___ieee754_expf_~xsb~0#1|)))} is VALID [2022-02-20 16:44:05,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {834#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))) (= (bvand (_ bv1 32) (bvashr |ULTIMATE.start___ieee754_expf_~sx~0#1| (_ bv31 32))) |ULTIMATE.start___ieee754_expf_~xsb~0#1|)))} assume !~bvugt32(__ieee754_expf_~hx~0#1, 2139095040bv32); {834#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))) (= (bvand (_ bv1 32) (bvashr |ULTIMATE.start___ieee754_expf_~sx~0#1| (_ bv31 32))) |ULTIMATE.start___ieee754_expf_~xsb~0#1|)))} is VALID [2022-02-20 16:44:05,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {834#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))) (= (bvand (_ bv1 32) (bvashr |ULTIMATE.start___ieee754_expf_~sx~0#1| (_ bv31 32))) |ULTIMATE.start___ieee754_expf_~xsb~0#1|)))} assume 2139095040bv32 == __ieee754_expf_~hx~0#1; {834#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))) (= (bvand (_ bv1 32) (bvashr |ULTIMATE.start___ieee754_expf_~sx~0#1| (_ bv31 32))) |ULTIMATE.start___ieee754_expf_~xsb~0#1|)))} is VALID [2022-02-20 16:44:05,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {834#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))) (= (bvand (_ bv1 32) (bvashr |ULTIMATE.start___ieee754_expf_~sx~0#1| (_ bv31 32))) |ULTIMATE.start___ieee754_expf_~xsb~0#1|)))} assume !(0bv32 == __ieee754_expf_~xsb~0#1);__ieee754_expf_#t~ite5#1 := ~Pluszero~DOUBLE(); {816#false} is VALID [2022-02-20 16:44:05,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {816#false} __ieee754_expf_#res#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, __ieee754_expf_#t~ite5#1);havoc __ieee754_expf_#t~ite5#1; {816#false} is VALID [2022-02-20 16:44:05,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {816#false} main_#t~ret16#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret16#1;havoc main_#t~ret16#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~mem15#1, isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, isinf_float_~x#1, isinf_float_~ix~0#1;isinf_float_~x#1 := isinf_float_#in~x#1;havoc isinf_float_~ix~0#1; {816#false} is VALID [2022-02-20 16:44:05,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {816#false} call isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isinf_float_~x#1, isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, 4bv32);call isinf_float_#t~mem15#1 := read~intINTTYPE4(isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset, 4bv32);isinf_float_~ix~0#1 := isinf_float_#t~mem15#1;havoc isinf_float_#t~mem15#1;call ULTIMATE.dealloc(isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset);havoc isinf_float_~#gf_u~3#1.base, isinf_float_~#gf_u~3#1.offset; {816#false} is VALID [2022-02-20 16:44:05,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {816#false} goto; {816#false} is VALID [2022-02-20 16:44:05,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {816#false} isinf_float_~ix~0#1 := ~bvand32(2147483647bv32, isinf_float_~ix~0#1);isinf_float_#res#1 := (if 2139095040bv32 == isinf_float_~ix~0#1 then 1bv32 else 0bv32); {816#false} is VALID [2022-02-20 16:44:05,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {816#false} main_#t~ret17#1 := isinf_float_#res#1;assume { :end_inline_isinf_float } true; {816#false} is VALID [2022-02-20 16:44:05,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {816#false} assume 0bv32 == main_#t~ret17#1;havoc main_#t~ret17#1; {816#false} is VALID [2022-02-20 16:44:05,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {816#false} assume !false; {816#false} is VALID [2022-02-20 16:44:05,123 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:44:05,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:44:05,123 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:44:05,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [151012517] [2022-02-20 16:44:05,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [151012517] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:44:05,124 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:44:05,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:44:05,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502728829] [2022-02-20 16:44:05,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:44:05,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2022-02-20 16:44:05,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:44:05,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:44:05,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:44:05,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:44:05,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:44:05,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:44:05,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:44:05,175 INFO L87 Difference]: Start difference. First operand 17 states and 16 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:44:05,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:44:05,309 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2022-02-20 16:44:05,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:44:05,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2022-02-20 16:44:05,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:44:05,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:44:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-02-20 16:44:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:44:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-02-20 16:44:05,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 16 transitions. [2022-02-20 16:44:05,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:44:05,357 INFO L225 Difference]: With dead ends: 17 [2022-02-20 16:44:05,357 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:44:05,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:44:05,358 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 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:44:05,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-02-20 16:44:05,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:44:05,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:44:05,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:44:05,359 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:44:05,359 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:44:05,359 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:44:05,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:44:05,360 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:44:05,360 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:44:05,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:44:05,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:44:05,360 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:44:05,360 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:44:05,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:44:05,360 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:44:05,360 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:44:05,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:44:05,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:44:05,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:44:05,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:44:05,361 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:44:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:44:05,361 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-02-20 16:44:05,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:44:05,361 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:44:05,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:44:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:44:05,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:44:05,363 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:44:05,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:44:05,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:44:05,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:44:05,867 INFO L858 garLoopResultBuilder]: For program point L60(lines 60 75) no Hoare annotation was computed. [2022-02-20 16:44:05,867 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:44:05,868 INFO L858 garLoopResultBuilder]: For program point L61(lines 61 70) no Hoare annotation was computed. [2022-02-20 16:44:05,868 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:44:05,868 INFO L858 garLoopResultBuilder]: For program point L61-2(lines 61 70) no Hoare annotation was computed. [2022-02-20 16:44:05,868 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 54) no Hoare annotation was computed. [2022-02-20 16:44:05,868 INFO L858 garLoopResultBuilder]: For program point L86-1(lines 86 90) no Hoare annotation was computed. [2022-02-20 16:44:05,868 INFO L854 garLoopResultBuilder]: At program point L86-2(lines 86 90) the Hoare annotation is: false [2022-02-20 16:44:05,868 INFO L858 garLoopResultBuilder]: For program point L136(lines 136 139) no Hoare annotation was computed. [2022-02-20 16:44:05,868 INFO L858 garLoopResultBuilder]: For program point L54(line 54) no Hoare annotation was computed. [2022-02-20 16:44:05,868 INFO L858 garLoopResultBuilder]: For program point L54-2(line 54) no Hoare annotation was computed. [2022-02-20 16:44:05,868 INFO L858 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2022-02-20 16:44:05,868 INFO L858 garLoopResultBuilder]: For program point L104(lines 104 108) no Hoare annotation was computed. [2022-02-20 16:44:05,868 INFO L858 garLoopResultBuilder]: For program point L104-1(lines 97 110) no Hoare annotation was computed. [2022-02-20 16:44:05,868 INFO L858 garLoopResultBuilder]: For program point L104-2(lines 104 108) no Hoare annotation was computed. [2022-02-20 16:44:05,869 INFO L858 garLoopResultBuilder]: For program point L55(lines 55 56) no Hoare annotation was computed. [2022-02-20 16:44:05,869 INFO L858 garLoopResultBuilder]: For program point L80(lines 80 83) no Hoare annotation was computed. [2022-02-20 16:44:05,869 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 75) no Hoare annotation was computed. [2022-02-20 16:44:05,869 INFO L858 garLoopResultBuilder]: For program point L72-2(lines 60 75) no Hoare annotation was computed. [2022-02-20 16:44:05,869 INFO L854 garLoopResultBuilder]: At program point L122(lines 114 123) the Hoare annotation is: (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start_isinf_float_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start_isinf_float_~ix~0#1|)) .cse0) (= |ULTIMATE.start___ieee754_expf_#res#1| .cse0) (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= |ULTIMATE.start_isinf_float_#res#1| (_ bv1 32)) (= .cse0 |ULTIMATE.start_isinf_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))) [2022-02-20 16:44:05,869 INFO L858 garLoopResultBuilder]: For program point L73(lines 73 74) no Hoare annotation was computed. [2022-02-20 16:44:05,869 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:44:05,869 INFO L858 garLoopResultBuilder]: For program point L57(lines 57 58) no Hoare annotation was computed. [2022-02-20 16:44:05,869 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 137) no Hoare annotation was computed. [2022-02-20 16:44:05,869 INFO L858 garLoopResultBuilder]: For program point L99-1(lines 99 103) no Hoare annotation was computed. [2022-02-20 16:44:05,869 INFO L854 garLoopResultBuilder]: At program point L99-2(lines 99 103) the Hoare annotation is: false [2022-02-20 16:44:05,870 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:44:05,871 INFO L858 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2022-02-20 16:44:05,871 INFO L858 garLoopResultBuilder]: For program point L91-1(lines 84 97) no Hoare annotation was computed. [2022-02-20 16:44:05,871 INFO L858 garLoopResultBuilder]: For program point L91-2(lines 91 95) no Hoare annotation was computed. [2022-02-20 16:44:05,871 INFO L858 garLoopResultBuilder]: For program point L116-1(lines 116 120) no Hoare annotation was computed. [2022-02-20 16:44:05,871 INFO L854 garLoopResultBuilder]: At program point L116-2(lines 116 120) the Hoare annotation is: (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24)))))) (and (= |ULTIMATE.start___ieee754_expf_#res#1| .cse0) (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= .cse0 |ULTIMATE.start_isinf_float_~x#1|) (= currentRoundingMode roundNearestTiesToEven))) [2022-02-20 16:44:05,871 INFO L858 garLoopResultBuilder]: For program point L116-3(lines 116 120) no Hoare annotation was computed. [2022-02-20 16:44:05,871 INFO L861 garLoopResultBuilder]: At program point L141(lines 125 142) the Hoare annotation is: true [2022-02-20 16:44:05,871 INFO L858 garLoopResultBuilder]: For program point L84(lines 84 110) no Hoare annotation was computed. [2022-02-20 16:44:05,871 INFO L858 garLoopResultBuilder]: For program point L51(lines 51 52) no Hoare annotation was computed. [2022-02-20 16:44:05,871 INFO L854 garLoopResultBuilder]: At program point L109(lines 38 111) the Hoare annotation is: (and (= |ULTIMATE.start___ieee754_expf_#res#1| ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))))) (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:44:05,871 INFO L858 garLoopResultBuilder]: For program point L43-1(lines 43 47) no Hoare annotation was computed. [2022-02-20 16:44:05,871 INFO L854 garLoopResultBuilder]: At program point L43-2(lines 43 47) the Hoare annotation is: (and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:44:05,871 INFO L858 garLoopResultBuilder]: For program point L43-3(lines 43 47) no Hoare annotation was computed. [2022-02-20 16:44:05,874 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 16:44:05,875 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:44:05,880 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:44:05,880 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:44:05,880 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:44:05,880 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:44:05,881 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:44:05,881 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:44:05,881 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:44:05,881 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-02-20 16:44:05,881 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-02-20 16:44:05,882 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 16:44:05,882 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 16:44:05,882 WARN L170 areAnnotationChecker]: L116-1 has no Hoare annotation [2022-02-20 16:44:05,882 WARN L170 areAnnotationChecker]: L116-3 has no Hoare annotation [2022-02-20 16:44:05,883 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:44:05,883 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:44:05,883 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:44:05,883 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:44:05,883 WARN L170 areAnnotationChecker]: L116-1 has no Hoare annotation [2022-02-20 16:44:05,883 WARN L170 areAnnotationChecker]: L116-1 has no Hoare annotation [2022-02-20 16:44:05,883 WARN L170 areAnnotationChecker]: L116-3 has no Hoare annotation [2022-02-20 16:44:05,883 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2022-02-20 16:44:05,884 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:44:05,885 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:44:05,885 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:44:05,885 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:44:05,885 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:44:05,885 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:44:05,885 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-02-20 16:44:05,885 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:44:05,885 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:44:05,885 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:44:05,885 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:44:05,886 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:44:05,886 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 16:44:05,886 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:44:05,886 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:44:05,886 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:44:05,886 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:44:05,886 WARN L170 areAnnotationChecker]: L72-2 has no Hoare annotation [2022-02-20 16:44:05,887 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:44:05,887 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:44:05,887 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:44:05,887 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 16:44:05,887 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 16:44:05,887 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 16:44:05,887 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2022-02-20 16:44:05,887 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:44:05,887 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-02-20 16:44:05,888 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 16:44:05,888 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 16:44:05,888 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2022-02-20 16:44:05,888 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2022-02-20 16:44:05,888 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:44:05,888 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:44:05,888 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-02-20 16:44:05,888 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-02-20 16:44:05,888 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2022-02-20 16:44:05,888 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2022-02-20 16:44:05,889 WARN L170 areAnnotationChecker]: L91-2 has no Hoare annotation [2022-02-20 16:44:05,889 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 16:44:05,889 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 16:44:05,889 WARN L170 areAnnotationChecker]: L104-2 has no Hoare annotation [2022-02-20 16:44:05,889 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:44:05,892 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,893 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,893 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,893 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,893 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,905 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,906 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,906 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,906 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,906 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,907 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,908 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,909 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,909 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,909 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,909 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,909 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,909 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,913 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,914 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,914 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,914 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,916 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,917 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,918 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,918 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,919 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,922 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:05,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:44:05 BoogieIcfgContainer [2022-02-20 16:44:05,926 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:44:05,927 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:44:05,927 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:44:05,927 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:44:05,927 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:43:17" (3/4) ... [2022-02-20 16:44:05,930 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:44:05,942 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-02-20 16:44:05,942 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-02-20 16:44:05,942 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:44:05,943 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:44:05,963 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()))) && x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:44:05,964 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()))) && x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0), ~Pluszero~LONGDOUBLE())) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()))) == x) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:44:05,965 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~fp~LONGDOUBLE(ix[31:31], ix[30:23], ix[22:0]) == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()))) && \result == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())))) && x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0), ~Pluszero~LONGDOUBLE())) && \result == 1bv32) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()))) == x) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:44:05,994 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:44:05,995 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:44:05,996 INFO L158 Benchmark]: Toolchain (without parser) took 58718.13ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 28.8MB in the beginning and 32.9MB in the end (delta: -4.1MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2022-02-20 16:44:05,996 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 52.4MB. Free memory was 33.8MB in the beginning and 33.8MB in the end (delta: 37.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:44:05,996 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.11ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 28.6MB in the beginning and 45.4MB in the end (delta: -16.8MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2022-02-20 16:44:05,996 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.91ms. Allocated memory is still 67.1MB. Free memory was 45.4MB in the beginning and 42.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:44:05,997 INFO L158 Benchmark]: Boogie Preprocessor took 74.44ms. Allocated memory is still 67.1MB. Free memory was 42.7MB in the beginning and 40.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:44:05,997 INFO L158 Benchmark]: RCFGBuilder took 9433.38ms. Allocated memory is still 67.1MB. Free memory was 40.0MB in the beginning and 47.5MB in the end (delta: -7.5MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2022-02-20 16:44:05,997 INFO L158 Benchmark]: TraceAbstraction took 48661.94ms. Allocated memory is still 67.1MB. Free memory was 47.0MB in the beginning and 37.1MB in the end (delta: 9.9MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2022-02-20 16:44:05,998 INFO L158 Benchmark]: Witness Printer took 68.14ms. Allocated memory is still 67.1MB. Free memory was 37.1MB in the beginning and 32.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:44:06,001 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.19ms. Allocated memory is still 52.4MB. Free memory was 33.8MB in the beginning and 33.8MB in the end (delta: 37.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.11ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 28.6MB in the beginning and 45.4MB in the end (delta: -16.8MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.91ms. Allocated memory is still 67.1MB. Free memory was 45.4MB in the beginning and 42.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.44ms. Allocated memory is still 67.1MB. Free memory was 42.7MB in the beginning and 40.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 9433.38ms. Allocated memory is still 67.1MB. Free memory was 40.0MB in the beginning and 47.5MB in the end (delta: -7.5MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * TraceAbstraction took 48661.94ms. Allocated memory is still 67.1MB. Free memory was 47.0MB in the beginning and 37.1MB in the end (delta: 9.9MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Witness Printer took 68.14ms. Allocated memory is still 67.1MB. Free memory was 37.1MB in the beginning and 32.9MB in the end (delta: 4.2MB). 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 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: 137]: 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, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.6s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 42.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 322 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 39 IncrementalHoareTripleChecker+Unchecked, 202 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53 IncrementalHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 120 mSDtfsCounter, 53 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 27, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 12 NumberOfFragments, 132 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 71 NumberOfCodeBlocks, 71 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 66 ConstructedInterpolants, 15 QuantifiedInterpolants, 447 SizeOfPredicates, 32 NumberOfNonLiveVariables, 434 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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: 38]: Loop Invariant [2022-02-20 16:44:06,029 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,029 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,030 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,031 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,032 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,032 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,032 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (\result == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()))) && x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 43]: Loop Invariant [2022-02-20 16:44:06,033 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,033 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0), ~Pluszero~LONGDOUBLE()) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 116]: Loop Invariant [2022-02-20 16:44:06,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,034 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,035 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,036 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,036 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,036 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,036 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,036 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,036 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,037 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,037 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((\result == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()))) && x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0), ~Pluszero~LONGDOUBLE())) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()))) == x) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 114]: Loop Invariant [2022-02-20 16:44:06,037 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,037 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,038 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,038 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,038 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,038 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,038 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,038 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,039 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,039 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,039 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,039 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,039 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,040 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:44:06,041 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~fp~LONGDOUBLE(ix[31:31], ix[30:23], ix[22:0]) == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()))) && \result == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE())))) && x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0), ~Pluszero~LONGDOUBLE())) && \result == 1bv32) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~Pluszero~LONGDOUBLE()))) == x) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven RESULT: Ultimate proved your program to be correct! [2022-02-20 16:44:06,154 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 Writing output log to file Ultimate.log Result: TRUE