./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0470.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_0470.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 e0354aec5a4f4371d364552f3633553fca009761fb9af21d0bd61e13bc971b74 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:39:03,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:39:03,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:39:03,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:39:03,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:39:03,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:39:03,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:39:03,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:39:03,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:39:03,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:39:03,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:39:03,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:39:03,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:39:03,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:39:03,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:39:03,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:39:03,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:39:03,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:39:03,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:39:03,256 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:39:03,257 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:39:03,258 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:39:03,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:39:03,259 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:39:03,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:39:03,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:39:03,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:39:03,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:39:03,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:39:03,263 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:39:03,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:39:03,264 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:39:03,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:39:03,265 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:39:03,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:39:03,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:39:03,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:39:03,267 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:39:03,267 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:39:03,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:39:03,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:39:03,271 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:39:03,284 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:39:03,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:39:03,285 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:39:03,285 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:39:03,286 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:39:03,286 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:39:03,286 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:39:03,286 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:39:03,286 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:39:03,286 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:39:03,287 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:39:03,287 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:39:03,287 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:39:03,287 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:39:03,287 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:39:03,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:39:03,287 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:39:03,288 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:39:03,288 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:39:03,288 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:39:03,288 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:39:03,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:39:03,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:39:03,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:39:03,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:39:03,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:39:03,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:39:03,289 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:39:03,289 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:39:03,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:39:03,289 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:39:03,290 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:39:03,290 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:39:03,290 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 -> e0354aec5a4f4371d364552f3633553fca009761fb9af21d0bd61e13bc971b74 [2022-02-20 16:39:03,477 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:39:03,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:39:03,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:39:03,498 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:39:03,498 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:39:03,499 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0470.c [2022-02-20 16:39:03,553 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e306f005/fbb61e6889fa490fba99b56d5db3173c/FLAG518c2f2da [2022-02-20 16:39:03,913 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:39:03,913 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0470.c [2022-02-20 16:39:03,918 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e306f005/fbb61e6889fa490fba99b56d5db3173c/FLAG518c2f2da [2022-02-20 16:39:03,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e306f005/fbb61e6889fa490fba99b56d5db3173c [2022-02-20 16:39:03,930 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:39:03,931 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:39:03,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:39:03,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:39:03,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:39:03,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:39:03" (1/1) ... [2022-02-20 16:39:03,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@910c7db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:03, skipping insertion in model container [2022-02-20 16:39:03,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:39:03" (1/1) ... [2022-02-20 16:39:03,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:39:03,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:39:04,133 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_0470.c[4369,4382] [2022-02-20 16:39:04,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:39:04,149 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:39:04,185 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_0470.c[4369,4382] [2022-02-20 16:39:04,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:39:04,195 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:39:04,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:04 WrapperNode [2022-02-20 16:39:04,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:39:04,197 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:39:04,197 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:39:04,197 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:39:04,201 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:39:04" (1/1) ... [2022-02-20 16:39:04,208 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:39:04" (1/1) ... [2022-02-20 16:39:04,234 INFO L137 Inliner]: procedures = 18, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 143 [2022-02-20 16:39:04,235 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:39:04,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:39:04,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:39:04,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:39:04,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:04" (1/1) ... [2022-02-20 16:39:04,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:04" (1/1) ... [2022-02-20 16:39:04,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:04" (1/1) ... [2022-02-20 16:39:04,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:04" (1/1) ... [2022-02-20 16:39:04,254 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:04" (1/1) ... [2022-02-20 16:39:04,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:04" (1/1) ... [2022-02-20 16:39:04,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:04" (1/1) ... [2022-02-20 16:39:04,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:39:04,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:39:04,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:39:04,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:39:04,267 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:04" (1/1) ... [2022-02-20 16:39:04,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:39:04,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:39:04,288 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:39:04,295 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:39:04,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:39:04,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:39:04,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:39:04,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:39:04,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:39:04,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:39:04,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:39:04,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:39:04,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:39:04,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:39:04,318 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2022-02-20 16:39:04,318 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2022-02-20 16:39:04,391 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:39:04,392 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:39:04,698 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:39:04,705 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:39:04,705 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-02-20 16:39:04,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:39:04 BoogieIcfgContainer [2022-02-20 16:39:04,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:39:04,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:39:04,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:39:04,711 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:39:04,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:39:03" (1/3) ... [2022-02-20 16:39:04,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7571e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:39:04, skipping insertion in model container [2022-02-20 16:39:04,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:04" (2/3) ... [2022-02-20 16:39:04,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a7571e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:39:04, skipping insertion in model container [2022-02-20 16:39:04,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:39:04" (3/3) ... [2022-02-20 16:39:04,713 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0470.c [2022-02-20 16:39:04,717 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:39:04,717 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:39:04,774 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:39:04,782 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:39:04,782 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:39:04,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 59 states have (on average 1.728813559322034) internal successors, (102), 60 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:04,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:39:04,810 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:39:04,810 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:39:04,811 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:39:04,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:39:04,815 INFO L85 PathProgramCache]: Analyzing trace with hash -898803059, now seen corresponding path program 1 times [2022-02-20 16:39:04,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:39:04,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293199114] [2022-02-20 16:39:04,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:39:04,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:39:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:04,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {67#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_sqrt~0 := 1.0;~tiny_sqrt~0 := 1.0E-30;~one_acos~0 := 1.0;~pi~0 := 3.1415925026;~pio2_hi_acos~0 := 1.5707962513;~pio2_lo_acos~0 := 7.5497894159E-8;~pS0_acos~0 := 0.16666667163;~pS1_acos~0 := ~someUnaryDOUBLEoperation(0.32556581497);~pS2_acos~0 := 0.20121252537;~pS3_acos~0 := ~someUnaryDOUBLEoperation(0.040055535734);~pS4_acos~0 := 7.9153501429E-4;~pS5_acos~0 := 3.4793309169E-5;~qS1_acos~0 := ~someUnaryDOUBLEoperation(2.4033949375);~qS2_acos~0 := 2.0209457874;~qS3_acos~0 := ~someUnaryDOUBLEoperation(0.68828397989);~qS4_acos~0 := 0.077038154006; {67#true} is VALID [2022-02-20 16:39:04,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret15#1, main_#t~ret16#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);assume { :begin_inline___ieee754_acosf } true;__ieee754_acosf_#in~x#1 := main_~x~0#1;havoc __ieee754_acosf_#res#1;havoc __ieee754_acosf_#t~mem9#1, __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset, __ieee754_acosf_#t~ret11#1, __ieee754_acosf_#t~ret12#1, __ieee754_acosf_#t~mem13#1, __ieee754_acosf_~#gf_u~2#1.base, __ieee754_acosf_~#gf_u~2#1.offset, __ieee754_acosf_#t~mem14#1, __ieee754_acosf_~#sf_u~1#1.base, __ieee754_acosf_~#sf_u~1#1.offset, __ieee754_acosf_~idf~0#1, __ieee754_acosf_~x#1, __ieee754_acosf_~z~1#1, __ieee754_acosf_~p~0#1, __ieee754_acosf_~q~1#1, __ieee754_acosf_~r~1#1, __ieee754_acosf_~w~0#1, __ieee754_acosf_~s~1#1, __ieee754_acosf_~c~0#1, __ieee754_acosf_~df~0#1, __ieee754_acosf_~hx~1#1, __ieee754_acosf_~ix~1#1, __ieee754_acosf_#t~nondet10#1;__ieee754_acosf_~x#1 := __ieee754_acosf_#in~x#1;havoc __ieee754_acosf_~z~1#1;havoc __ieee754_acosf_~p~0#1;havoc __ieee754_acosf_~q~1#1;havoc __ieee754_acosf_~r~1#1;havoc __ieee754_acosf_~w~0#1;havoc __ieee754_acosf_~s~1#1;havoc __ieee754_acosf_~c~0#1;havoc __ieee754_acosf_~df~0#1;havoc __ieee754_acosf_~hx~1#1;havoc __ieee754_acosf_~ix~1#1; {67#true} is VALID [2022-02-20 16:39:04,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume !true; {68#false} is VALID [2022-02-20 16:39:04,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {68#false} assume 0 == __ieee754_acosf_~hx~1#1;__ieee754_acosf_~ix~1#1 := 0; {68#false} is VALID [2022-02-20 16:39:04,953 INFO L290 TraceCheckUtils]: 4: Hoare triple {68#false} assume 1065353216 == __ieee754_acosf_~ix~1#1; {68#false} is VALID [2022-02-20 16:39:04,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {68#false} assume __ieee754_acosf_~hx~1#1 > 0;__ieee754_acosf_#res#1 := 0.0; {68#false} is VALID [2022-02-20 16:39:04,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {68#false} main_#t~ret15#1 := __ieee754_acosf_#res#1;assume { :end_inline___ieee754_acosf } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x#1, isnan_float_~x#1) then 1 else 0); {68#false} is VALID [2022-02-20 16:39:04,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {68#false} main_#t~ret16#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret16#1 && main_#t~ret16#1 <= 2147483647; {68#false} is VALID [2022-02-20 16:39:04,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {68#false} assume 0 == main_#t~ret16#1;havoc main_#t~ret16#1; {68#false} is VALID [2022-02-20 16:39:04,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#false} assume !false; {68#false} is VALID [2022-02-20 16:39:04,956 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:39:04,956 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:39:04,956 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293199114] [2022-02-20 16:39:04,957 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293199114] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:39:04,957 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:39:04,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:39:04,960 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327813626] [2022-02-20 16:39:04,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:39:04,966 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2022-02-20 16:39:04,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:39:04,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:39:04,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:39:04,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:39:04,984 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:39:05,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:39:05,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:39:05,006 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.728813559322034) internal successors, (102), 60 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:39:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:05,096 INFO L93 Difference]: Finished difference Result 126 states and 212 transitions. [2022-02-20 16:39:05,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:39:05,097 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2022-02-20 16:39:05,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:39:05,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:39:05,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 212 transitions. [2022-02-20 16:39:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:39:05,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 212 transitions. [2022-02-20 16:39:05,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 212 transitions. [2022-02-20 16:39:05,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:39:05,298 INFO L225 Difference]: With dead ends: 126 [2022-02-20 16:39:05,298 INFO L226 Difference]: Without dead ends: 61 [2022-02-20 16:39:05,301 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:39:05,305 INFO L933 BasicCegarLoop]: 86 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, 86 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:39:05,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:39:05,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-20 16:39:05,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-02-20 16:39:05,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:39:05,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:05,339 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:05,342 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:05,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:05,347 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-02-20 16:39:05,347 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-02-20 16:39:05,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:05,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:05,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 61 states. [2022-02-20 16:39:05,349 INFO L87 Difference]: Start difference. First operand has 61 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 61 states. [2022-02-20 16:39:05,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:05,355 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-02-20 16:39:05,355 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-02-20 16:39:05,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:05,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:05,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:39:05,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:39:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:05,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2022-02-20 16:39:05,360 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 10 [2022-02-20 16:39:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:39:05,361 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2022-02-20 16:39:05,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:39:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-02-20 16:39:05,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:39:05,362 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:39:05,362 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:39:05,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:39:05,363 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:39:05,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:39:05,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1060857040, now seen corresponding path program 1 times [2022-02-20 16:39:05,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:39:05,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093463190] [2022-02-20 16:39:05,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:39:05,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:39:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:05,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {415#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_sqrt~0 := 1.0;~tiny_sqrt~0 := 1.0E-30;~one_acos~0 := 1.0;~pi~0 := 3.1415925026;~pio2_hi_acos~0 := 1.5707962513;~pio2_lo_acos~0 := 7.5497894159E-8;~pS0_acos~0 := 0.16666667163;~pS1_acos~0 := ~someUnaryDOUBLEoperation(0.32556581497);~pS2_acos~0 := 0.20121252537;~pS3_acos~0 := ~someUnaryDOUBLEoperation(0.040055535734);~pS4_acos~0 := 7.9153501429E-4;~pS5_acos~0 := 3.4793309169E-5;~qS1_acos~0 := ~someUnaryDOUBLEoperation(2.4033949375);~qS2_acos~0 := 2.0209457874;~qS3_acos~0 := ~someUnaryDOUBLEoperation(0.68828397989);~qS4_acos~0 := 0.077038154006; {415#true} is VALID [2022-02-20 16:39:05,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {415#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret15#1, main_#t~ret16#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);assume { :begin_inline___ieee754_acosf } true;__ieee754_acosf_#in~x#1 := main_~x~0#1;havoc __ieee754_acosf_#res#1;havoc __ieee754_acosf_#t~mem9#1, __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset, __ieee754_acosf_#t~ret11#1, __ieee754_acosf_#t~ret12#1, __ieee754_acosf_#t~mem13#1, __ieee754_acosf_~#gf_u~2#1.base, __ieee754_acosf_~#gf_u~2#1.offset, __ieee754_acosf_#t~mem14#1, __ieee754_acosf_~#sf_u~1#1.base, __ieee754_acosf_~#sf_u~1#1.offset, __ieee754_acosf_~idf~0#1, __ieee754_acosf_~x#1, __ieee754_acosf_~z~1#1, __ieee754_acosf_~p~0#1, __ieee754_acosf_~q~1#1, __ieee754_acosf_~r~1#1, __ieee754_acosf_~w~0#1, __ieee754_acosf_~s~1#1, __ieee754_acosf_~c~0#1, __ieee754_acosf_~df~0#1, __ieee754_acosf_~hx~1#1, __ieee754_acosf_~ix~1#1, __ieee754_acosf_#t~nondet10#1;__ieee754_acosf_~x#1 := __ieee754_acosf_#in~x#1;havoc __ieee754_acosf_~z~1#1;havoc __ieee754_acosf_~p~0#1;havoc __ieee754_acosf_~q~1#1;havoc __ieee754_acosf_~r~1#1;havoc __ieee754_acosf_~w~0#1;havoc __ieee754_acosf_~s~1#1;havoc __ieee754_acosf_~c~0#1;havoc __ieee754_acosf_~df~0#1;havoc __ieee754_acosf_~hx~1#1;havoc __ieee754_acosf_~ix~1#1; {415#true} is VALID [2022-02-20 16:39:05,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {415#true} call __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4);call write~real(__ieee754_acosf_~x#1, __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset, 4);call __ieee754_acosf_#t~mem9#1 := read~int(__ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset, 4);__ieee754_acosf_~hx~1#1 := (if __ieee754_acosf_#t~mem9#1 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_acosf_#t~mem9#1 % 4294967296 % 4294967296 else __ieee754_acosf_#t~mem9#1 % 4294967296 % 4294967296 - 4294967296);havoc __ieee754_acosf_#t~mem9#1;call ULTIMATE.dealloc(__ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset);havoc __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset; {415#true} is VALID [2022-02-20 16:39:05,435 INFO L290 TraceCheckUtils]: 3: Hoare triple {415#true} goto; {415#true} is VALID [2022-02-20 16:39:05,436 INFO L290 TraceCheckUtils]: 4: Hoare triple {415#true} assume 0 == __ieee754_acosf_~hx~1#1;__ieee754_acosf_~ix~1#1 := 0; {417#(= |ULTIMATE.start___ieee754_acosf_~ix~1#1| 0)} is VALID [2022-02-20 16:39:05,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#(= |ULTIMATE.start___ieee754_acosf_~ix~1#1| 0)} assume 1065353216 == __ieee754_acosf_~ix~1#1; {416#false} is VALID [2022-02-20 16:39:05,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {416#false} assume __ieee754_acosf_~hx~1#1 > 0;__ieee754_acosf_#res#1 := 0.0; {416#false} is VALID [2022-02-20 16:39:05,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {416#false} main_#t~ret15#1 := __ieee754_acosf_#res#1;assume { :end_inline___ieee754_acosf } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x#1, isnan_float_~x#1) then 1 else 0); {416#false} is VALID [2022-02-20 16:39:05,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {416#false} main_#t~ret16#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret16#1 && main_#t~ret16#1 <= 2147483647; {416#false} is VALID [2022-02-20 16:39:05,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {416#false} assume 0 == main_#t~ret16#1;havoc main_#t~ret16#1; {416#false} is VALID [2022-02-20 16:39:05,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {416#false} assume !false; {416#false} is VALID [2022-02-20 16:39:05,438 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:39:05,438 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:39:05,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093463190] [2022-02-20 16:39:05,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093463190] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:39:05,439 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:39:05,439 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:39:05,439 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262107437] [2022-02-20 16:39:05,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:39:05,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:39:05,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:39:05,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:39:05,449 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:39:05,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:39:05,450 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:39:05,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:39:05,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:39:05,451 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:39:05,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:05,567 INFO L93 Difference]: Finished difference Result 119 states and 160 transitions. [2022-02-20 16:39:05,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:39:05,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:39:05,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:39:05,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:39:05,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2022-02-20 16:39:05,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:39:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2022-02-20 16:39:05,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 160 transitions. [2022-02-20 16:39:05,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:39:05,687 INFO L225 Difference]: With dead ends: 119 [2022-02-20 16:39:05,688 INFO L226 Difference]: Without dead ends: 70 [2022-02-20 16:39:05,691 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:39:05,693 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 8 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:39:05,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 150 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:39:05,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-20 16:39:05,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2022-02-20 16:39:05,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:39:05,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 65 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:05,705 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 65 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:05,705 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 65 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:05,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:05,709 INFO L93 Difference]: Finished difference Result 70 states and 91 transitions. [2022-02-20 16:39:05,709 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2022-02-20 16:39:05,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:05,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:05,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 70 states. [2022-02-20 16:39:05,714 INFO L87 Difference]: Start difference. First operand has 65 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 70 states. [2022-02-20 16:39:05,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:05,720 INFO L93 Difference]: Finished difference Result 70 states and 91 transitions. [2022-02-20 16:39:05,720 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2022-02-20 16:39:05,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:05,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:05,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:39:05,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:39:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2022-02-20 16:39:05,725 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 11 [2022-02-20 16:39:05,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:39:05,725 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2022-02-20 16:39:05,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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:39:05,725 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-02-20 16:39:05,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:39:05,726 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:39:05,726 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:39:05,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:39:05,726 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:39:05,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:39:05,727 INFO L85 PathProgramCache]: Analyzing trace with hash -951703019, now seen corresponding path program 1 times [2022-02-20 16:39:05,727 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:39:05,727 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064406779] [2022-02-20 16:39:05,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:39:05,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:39:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:39:05,766 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:39:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:39:05,815 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:39:05,816 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:39:05,816 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:39:05,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:39:05,820 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:39:05,822 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:39:05,842 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:39:05,848 WARN L170 areAnnotationChecker]: __ieee754_sqrtfENTRY has no Hoare annotation [2022-02-20 16:39:05,848 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:39:05,848 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-02-20 16:39:05,848 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-02-20 16:39:05,848 WARN L170 areAnnotationChecker]: L98-2 has no Hoare annotation [2022-02-20 16:39:05,849 WARN L170 areAnnotationChecker]: L98-2 has no Hoare annotation [2022-02-20 16:39:05,849 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 16:39:05,849 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 16:39:05,849 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 16:39:05,849 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 16:39:05,849 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2022-02-20 16:39:05,849 WARN L170 areAnnotationChecker]: L98-1 has no Hoare annotation [2022-02-20 16:39:05,849 WARN L170 areAnnotationChecker]: L98-3 has no Hoare annotation [2022-02-20 16:39:05,849 WARN L170 areAnnotationChecker]: L98-3 has no Hoare annotation [2022-02-20 16:39:05,850 WARN L170 areAnnotationChecker]: L29-7 has no Hoare annotation [2022-02-20 16:39:05,850 WARN L170 areAnnotationChecker]: L29-7 has no Hoare annotation [2022-02-20 16:39:05,850 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-20 16:39:05,850 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-20 16:39:05,850 WARN L170 areAnnotationChecker]: L103-7 has no Hoare annotation [2022-02-20 16:39:05,850 WARN L170 areAnnotationChecker]: L103-7 has no Hoare annotation [2022-02-20 16:39:05,850 WARN L170 areAnnotationChecker]: L103-1 has no Hoare annotation [2022-02-20 16:39:05,850 WARN L170 areAnnotationChecker]: L103-1 has no Hoare annotation [2022-02-20 16:39:05,850 WARN L170 areAnnotationChecker]: __ieee754_sqrtfFINAL has no Hoare annotation [2022-02-20 16:39:05,851 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:39:05,851 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:39:05,851 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-02-20 16:39:05,854 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-02-20 16:39:05,855 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-02-20 16:39:05,855 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-02-20 16:39:05,855 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:39:05,855 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:39:05,855 WARN L170 areAnnotationChecker]: L103-3 has no Hoare annotation [2022-02-20 16:39:05,855 WARN L170 areAnnotationChecker]: L103-3 has no Hoare annotation [2022-02-20 16:39:05,855 WARN L170 areAnnotationChecker]: __ieee754_sqrtfEXIT has no Hoare annotation [2022-02-20 16:39:05,856 WARN L170 areAnnotationChecker]: __ieee754_sqrtfEXIT has no Hoare annotation [2022-02-20 16:39:05,858 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:39:05,858 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:39:05,858 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2022-02-20 16:39:05,859 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2022-02-20 16:39:05,859 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2022-02-20 16:39:05,859 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-02-20 16:39:05,859 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-02-20 16:39:05,859 WARN L170 areAnnotationChecker]: L103-5 has no Hoare annotation [2022-02-20 16:39:05,859 WARN L170 areAnnotationChecker]: L103-5 has no Hoare annotation [2022-02-20 16:39:05,859 WARN L170 areAnnotationChecker]: L132-1 has no Hoare annotation [2022-02-20 16:39:05,859 WARN L170 areAnnotationChecker]: L139-1 has no Hoare annotation [2022-02-20 16:39:05,859 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:39:05,859 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:39:05,860 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 16:39:05,860 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 16:39:05,860 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 16:39:05,860 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:39:05,860 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:39:05,860 WARN L170 areAnnotationChecker]: L141-2 has no Hoare annotation [2022-02-20 16:39:05,860 WARN L170 areAnnotationChecker]: L141-2 has no Hoare annotation [2022-02-20 16:39:05,860 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-02-20 16:39:05,860 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-02-20 16:39:05,860 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-02-20 16:39:05,861 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-20 16:39:05,861 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-02-20 16:39:05,861 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-02-20 16:39:05,861 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-02-20 16:39:05,861 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-02-20 16:39:05,861 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2022-02-20 16:39:05,861 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2022-02-20 16:39:05,862 WARN L170 areAnnotationChecker]: L141-1 has no Hoare annotation [2022-02-20 16:39:05,862 WARN L170 areAnnotationChecker]: L141-1 has no Hoare annotation [2022-02-20 16:39:05,862 WARN L170 areAnnotationChecker]: L146-1 has no Hoare annotation [2022-02-20 16:39:05,862 WARN L170 areAnnotationChecker]: L146-1 has no Hoare annotation [2022-02-20 16:39:05,862 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2022-02-20 16:39:05,862 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 16:39:05,862 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:39:05,862 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:39:05,862 WARN L170 areAnnotationChecker]: L176 has no Hoare annotation [2022-02-20 16:39:05,862 WARN L170 areAnnotationChecker]: L176 has no Hoare annotation [2022-02-20 16:39:05,863 WARN L170 areAnnotationChecker]: L180 has no Hoare annotation [2022-02-20 16:39:05,863 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2022-02-20 16:39:05,863 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2022-02-20 16:39:05,863 WARN L170 areAnnotationChecker]: L146-2 has no Hoare annotation [2022-02-20 16:39:05,863 WARN L170 areAnnotationChecker]: L46-8 has no Hoare annotation [2022-02-20 16:39:05,863 WARN L170 areAnnotationChecker]: L46-8 has no Hoare annotation [2022-02-20 16:39:05,863 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2022-02-20 16:39:05,863 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2022-02-20 16:39:05,863 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:39:05,863 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-02-20 16:39:05,864 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-02-20 16:39:05,864 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-02-20 16:39:05,864 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:39:05,865 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:39:05,865 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:39:05,865 WARN L170 areAnnotationChecker]: L46-6 has no Hoare annotation [2022-02-20 16:39:05,865 WARN L170 areAnnotationChecker]: L46-6 has no Hoare annotation [2022-02-20 16:39:05,865 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2022-02-20 16:39:05,865 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2022-02-20 16:39:05,865 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:39:05,865 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:39:05,865 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:39:05,866 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:39:05,866 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:39:05,866 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-02-20 16:39:05,866 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:39:05,866 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:39:05,866 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:39:05,866 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:39:05,866 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:39:05,866 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:39:05,866 WARN L170 areAnnotationChecker]: L78-3 has no Hoare annotation [2022-02-20 16:39:05,867 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:39:05,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:39:05 BoogieIcfgContainer [2022-02-20 16:39:05,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:39:05,869 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:39:05,869 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:39:05,869 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:39:05,870 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:39:04" (3/4) ... [2022-02-20 16:39:05,872 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:39:05,872 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:39:05,873 INFO L158 Benchmark]: Toolchain (without parser) took 1941.83ms. Allocated memory was 123.7MB in the beginning and 151.0MB in the end (delta: 27.3MB). Free memory was 93.9MB in the beginning and 88.3MB in the end (delta: 5.6MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2022-02-20 16:39:05,874 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 79.7MB. Free memory is still 35.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:39:05,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.96ms. Allocated memory is still 123.7MB. Free memory was 93.9MB in the beginning and 93.9MB in the end (delta: 14.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:39:05,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.12ms. Allocated memory is still 123.7MB. Free memory was 93.9MB in the beginning and 91.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:39:05,879 INFO L158 Benchmark]: Boogie Preprocessor took 29.99ms. Allocated memory is still 123.7MB. Free memory was 91.5MB in the beginning and 89.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:39:05,879 INFO L158 Benchmark]: RCFGBuilder took 441.16ms. Allocated memory is still 123.7MB. Free memory was 89.1MB in the beginning and 67.1MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-02-20 16:39:05,880 INFO L158 Benchmark]: TraceAbstraction took 1160.20ms. Allocated memory was 123.7MB in the beginning and 151.0MB in the end (delta: 27.3MB). Free memory was 66.7MB in the beginning and 88.3MB in the end (delta: -21.6MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2022-02-20 16:39:05,882 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 151.0MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:39:05,883 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.14ms. Allocated memory is still 79.7MB. Free memory is still 35.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.96ms. Allocated memory is still 123.7MB. Free memory was 93.9MB in the beginning and 93.9MB in the end (delta: 14.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.12ms. Allocated memory is still 123.7MB. Free memory was 93.9MB in the beginning and 91.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.99ms. Allocated memory is still 123.7MB. Free memory was 91.5MB in the beginning and 89.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 441.16ms. Allocated memory is still 123.7MB. Free memory was 89.1MB in the beginning and 67.1MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1160.20ms. Allocated memory was 123.7MB in the beginning and 151.0MB in the end (delta: 27.3MB). Free memory was 66.7MB in the beginning and 88.3MB in the end (delta: -21.6MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 151.0MB. Free memory is still 88.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: 176]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 15, overapproximation of someUnaryDOUBLEoperation at line 89, overapproximation of someBinaryArithmeticFLOAToperation at line 114. Possible FailurePath: [L17] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; [L86-L93] static const float one_acos = 1.0000000000e+00, pi = 3.1415925026e+00, pio2_hi_acos = 1.5707962513e+00, pio2_lo_acos = 7.5497894159e-08, pS0_acos = 1.6666667163e-01, pS1_acos = -3.2556581497e-01, pS2_acos = 2.0121252537e-01, pS3_acos = -4.0055535734e-02, pS4_acos = 7.9153501429e-04, pS5_acos = 3.4793309169e-05, qS1_acos = -2.4033949375e+00, qS2_acos = 2.0209457874e+00, qS3_acos = -6.8828397989e-01, qS4_acos = 7.7038154006e-02; VAL [one_acos=1, one_sqrt=1, pi=15707962513/5000000000, pi=75497894159/1000000000000000000, pi=15707962513/10000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000] [L171] float x = 0.0f / 0.0f; [L172] CALL, EXPR __ieee754_acosf(x) [L96] float z, p, q, r, w, s, c, df; [L97] __int32_t hx, ix; VAL [\old(x)=4294967298, one_acos=1, one_sqrt=1, pi=15707962513/5000000000, pi=15707962513/10000000000, pi=75497894159/1000000000000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=4294967298] [L99] ieee_float_shape_type gf_u; [L100] gf_u.value = (x) [L101] EXPR gf_u.word [L101] (hx) = gf_u.word [L103] ix = hx & 0x7fffffff VAL [\old(x)=4294967298, hx=0, ix=0, one_acos=1, one_sqrt=1, pi=15707962513/10000000000, pi=15707962513/5000000000, pi=75497894159/1000000000000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=4294967298] [L104] COND FALSE !(ix == 0x3f800000) VAL [\old(x)=4294967298, hx=0, ix=0, one_acos=1, one_sqrt=1, pi=15707962513/10000000000, pi=75497894159/1000000000000000000, pi=15707962513/5000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=4294967298] [L109] COND FALSE !(ix > 0x3f800000) VAL [\old(x)=4294967298, hx=0, ix=0, one_acos=1, one_sqrt=1, pi=75497894159/1000000000000000000, pi=15707962513/10000000000, pi=15707962513/5000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=4294967298] [L112] COND TRUE ix < 0x3f000000 VAL [\old(x)=4294967298, hx=0, ix=0, one_acos=1, one_sqrt=1, pi=15707962513/5000000000, pi=75497894159/1000000000000000000, pi=15707962513/10000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=4294967298] [L113] COND TRUE ix <= 0x23000000 [L114] return pio2_hi_acos + pio2_lo_acos; VAL [\old(x)=4294967298, hx=0, ix=0, one_acos=1, one_sqrt=1, pi=75497894159/1000000000000000000, pi=15707962513/10000000000, pi=15707962513/5000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=4294967298] [L172] RET, EXPR __ieee754_acosf(x) [L172] float res = __ieee754_acosf(x); [L175] CALL, EXPR isnan_float(res) [L15] return x != x; VAL [\old(x)=4294967297, \result=0, one_acos=1, one_sqrt=1, pi=15707962513/5000000000, pi=15707962513/10000000000, pi=75497894159/1000000000000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=4294967297] [L175] RET, EXPR isnan_float(res) [L175] COND TRUE !isnan_float(res) [L176] reach_error() VAL [one_acos=1, one_sqrt=1, pi=15707962513/5000000000, pi=75497894159/1000000000000000000, pi=15707962513/10000000000, pS0_acos=16666667163/100000000000, pS2_acos=20121252537/100000000000, pS4_acos=79153501429/100000000000000, pS5_acos=34793309169/1000000000000000, qS2_acos=10104728937/5000000000, qS4_acos=38519077003/500000000000, res=4294967297, tiny_sqrt=1/1000000000000000000000000000000, x=4294967298] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 236 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 165 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=2, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 21 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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:39:05,911 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_0470.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 e0354aec5a4f4371d364552f3633553fca009761fb9af21d0bd61e13bc971b74 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:39:07,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:39:07,562 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:39:07,596 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:39:07,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:39:07,599 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:39:07,600 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:39:07,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:39:07,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:39:07,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:39:07,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:39:07,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:39:07,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:39:07,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:39:07,615 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:39:07,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:39:07,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:39:07,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:39:07,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:39:07,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:39:07,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:39:07,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:39:07,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:39:07,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:39:07,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:39:07,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:39:07,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:39:07,635 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:39:07,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:39:07,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:39:07,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:39:07,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:39:07,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:39:07,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:39:07,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:39:07,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:39:07,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:39:07,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:39:07,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:39:07,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:39:07,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:39:07,642 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:39:07,671 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:39:07,671 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:39:07,672 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:39:07,672 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:39:07,673 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:39:07,673 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:39:07,674 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:39:07,675 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:39:07,675 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:39:07,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:39:07,676 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:39:07,676 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:39:07,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:39:07,676 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:39:07,676 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:39:07,676 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:39:07,676 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:39:07,677 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:39:07,677 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:39:07,677 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:39:07,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:39:07,677 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:39:07,677 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:39:07,677 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:39:07,678 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:39:07,678 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:39:07,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:39:07,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:39:07,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:39:07,683 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:39:07,683 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:39:07,683 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:39:07,684 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:39:07,684 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:39:07,684 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:39:07,684 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:39:07,684 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 -> e0354aec5a4f4371d364552f3633553fca009761fb9af21d0bd61e13bc971b74 [2022-02-20 16:39:07,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:39:07,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:39:07,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:39:07,945 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:39:07,945 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:39:07,946 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0470.c [2022-02-20 16:39:08,001 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eda69ddd/04bc679c8947456cb6fe5dd1e3b8578d/FLAG5b19db157 [2022-02-20 16:39:08,401 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:39:08,402 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0470.c [2022-02-20 16:39:08,406 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eda69ddd/04bc679c8947456cb6fe5dd1e3b8578d/FLAG5b19db157 [2022-02-20 16:39:08,813 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1eda69ddd/04bc679c8947456cb6fe5dd1e3b8578d [2022-02-20 16:39:08,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:39:08,817 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:39:08,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:39:08,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:39:08,821 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:39:08,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:39:08" (1/1) ... [2022-02-20 16:39:08,823 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a6a1f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:08, skipping insertion in model container [2022-02-20 16:39:08,823 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:39:08" (1/1) ... [2022-02-20 16:39:08,828 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:39:08,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:39:09,075 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_0470.c[4369,4382] [2022-02-20 16:39:09,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:39:09,089 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:39:09,115 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_0470.c[4369,4382] [2022-02-20 16:39:09,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:39:09,127 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:39:09,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:09 WrapperNode [2022-02-20 16:39:09,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:39:09,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:39:09,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:39:09,129 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:39:09,133 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:39:09" (1/1) ... [2022-02-20 16:39:09,154 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:39:09" (1/1) ... [2022-02-20 16:39:09,192 INFO L137 Inliner]: procedures = 21, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 131 [2022-02-20 16:39:09,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:39:09,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:39:09,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:39:09,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:39:09,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:09" (1/1) ... [2022-02-20 16:39:09,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:09" (1/1) ... [2022-02-20 16:39:09,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:09" (1/1) ... [2022-02-20 16:39:09,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:09" (1/1) ... [2022-02-20 16:39:09,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:09" (1/1) ... [2022-02-20 16:39:09,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:09" (1/1) ... [2022-02-20 16:39:09,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:09" (1/1) ... [2022-02-20 16:39:09,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:39:09,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:39:09,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:39:09,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:39:09,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:09" (1/1) ... [2022-02-20 16:39:09,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:39:09,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:39:09,288 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:39:09,311 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:39:09,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:39:09,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:39:09,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:39:09,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:39:09,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:39:09,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:39:09,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:39:09,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:39:09,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:39:09,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:39:09,320 INFO L130 BoogieDeclarations]: Found specification of procedure __ieee754_sqrtf [2022-02-20 16:39:09,320 INFO L138 BoogieDeclarations]: Found implementation of procedure __ieee754_sqrtf [2022-02-20 16:39:09,435 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:39:09,436 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:39:19,609 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:39:19,614 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:39:19,614 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-02-20 16:39:19,615 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:39:19 BoogieIcfgContainer [2022-02-20 16:39:19,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:39:19,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:39:19,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:39:19,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:39:19,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:39:08" (1/3) ... [2022-02-20 16:39:19,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d6b809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:39:19, skipping insertion in model container [2022-02-20 16:39:19,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:09" (2/3) ... [2022-02-20 16:39:19,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d6b809 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:39:19, skipping insertion in model container [2022-02-20 16:39:19,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:39:19" (3/3) ... [2022-02-20 16:39:19,621 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0470.c [2022-02-20 16:39:19,624 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:39:19,625 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:39:19,662 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:39:19,667 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:39:19,667 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:39:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 50 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:39:19,687 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:39:19,687 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:39:19,688 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:39:19,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:39:19,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1029487755, now seen corresponding path program 1 times [2022-02-20 16:39:19,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:39:19,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672151302] [2022-02-20 16:39:19,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:39:19,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:39:19,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:39:19,702 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:39:19,704 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:39:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:20,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:39:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:20,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:39:20,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {57#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_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30));~one_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~pi~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.1415925026));~pio2_hi_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.5707962513));~pio2_lo_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.5497894159E-8));~pS0_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.16666667163));~pS1_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.32556581497)));~pS2_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.20121252537));~pS3_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.040055535734)));~pS4_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.9153501429E-4));~pS5_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.4793309169E-5));~qS1_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.4033949375)));~qS2_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 2.0209457874));~qS3_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.68828397989)));~qS4_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.077038154006)); {57#true} is VALID [2022-02-20 16:39:20,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1, main_#t~ret13#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_acosf } true;__ieee754_acosf_#in~x#1 := main_~x~0#1;havoc __ieee754_acosf_#res#1;havoc __ieee754_acosf_#t~mem7#1, __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset, __ieee754_acosf_#t~ret8#1, __ieee754_acosf_#t~ret9#1, __ieee754_acosf_#t~mem10#1, __ieee754_acosf_~#gf_u~2#1.base, __ieee754_acosf_~#gf_u~2#1.offset, __ieee754_acosf_#t~mem11#1, __ieee754_acosf_~#sf_u~1#1.base, __ieee754_acosf_~#sf_u~1#1.offset, __ieee754_acosf_~idf~0#1, __ieee754_acosf_~x#1, __ieee754_acosf_~z~1#1, __ieee754_acosf_~p~0#1, __ieee754_acosf_~q~1#1, __ieee754_acosf_~r~1#1, __ieee754_acosf_~w~0#1, __ieee754_acosf_~s~1#1, __ieee754_acosf_~c~0#1, __ieee754_acosf_~df~0#1, __ieee754_acosf_~hx~1#1, __ieee754_acosf_~ix~1#1;__ieee754_acosf_~x#1 := __ieee754_acosf_#in~x#1;havoc __ieee754_acosf_~z~1#1;havoc __ieee754_acosf_~p~0#1;havoc __ieee754_acosf_~q~1#1;havoc __ieee754_acosf_~r~1#1;havoc __ieee754_acosf_~w~0#1;havoc __ieee754_acosf_~s~1#1;havoc __ieee754_acosf_~c~0#1;havoc __ieee754_acosf_~df~0#1;havoc __ieee754_acosf_~hx~1#1;havoc __ieee754_acosf_~ix~1#1; {57#true} is VALID [2022-02-20 16:39:20,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {57#true} assume !true; {58#false} is VALID [2022-02-20 16:39:20,226 INFO L290 TraceCheckUtils]: 3: Hoare triple {58#false} __ieee754_acosf_~ix~1#1 := ~bvand32(2147483647bv32, __ieee754_acosf_~hx~1#1); {58#false} is VALID [2022-02-20 16:39:20,226 INFO L290 TraceCheckUtils]: 4: Hoare triple {58#false} assume 1065353216bv32 == __ieee754_acosf_~ix~1#1; {58#false} is VALID [2022-02-20 16:39:20,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {58#false} assume ~bvsgt32(__ieee754_acosf_~hx~1#1, 0bv32);__ieee754_acosf_#res#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()); {58#false} is VALID [2022-02-20 16:39:20,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {58#false} main_#t~ret12#1 := __ieee754_acosf_#res#1;assume { :end_inline___ieee754_acosf } true;main_~res~0#1 := main_#t~ret12#1;havoc main_#t~ret12#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {58#false} is VALID [2022-02-20 16:39:20,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {58#false} main_#t~ret13#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {58#false} is VALID [2022-02-20 16:39:20,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {58#false} assume 0bv32 == main_#t~ret13#1;havoc main_#t~ret13#1; {58#false} is VALID [2022-02-20 16:39:20,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {58#false} assume !false; {58#false} is VALID [2022-02-20 16:39:20,228 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:39:20,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:39:20,228 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:39:20,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672151302] [2022-02-20 16:39:20,229 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672151302] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:39:20,229 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:39:20,229 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:39:20,230 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419350221] [2022-02-20 16:39:20,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:39:20,234 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2022-02-20 16:39:20,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:39:20,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:39:20,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:39:20,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:39:20,261 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:39:20,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:39:20,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:39:20,282 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 50 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:39:30,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:30,623 INFO L93 Difference]: Finished difference Result 106 states and 168 transitions. [2022-02-20 16:39:30,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:39:30,631 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2022-02-20 16:39:30,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:39:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:39:30,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 168 transitions. [2022-02-20 16:39:30,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:39:30,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 168 transitions. [2022-02-20 16:39:30,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 168 transitions. [2022-02-20 16:39:35,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:39:35,687 INFO L225 Difference]: With dead ends: 106 [2022-02-20 16:39:35,687 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 16:39:35,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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:39:35,694 INFO L933 BasicCegarLoop]: 71 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, 71 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:39:35,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:39:35,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 16:39:35,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-02-20 16:39:35,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:39:35,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:35,727 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:35,729 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:35,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:35,738 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-02-20 16:39:35,738 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-02-20 16:39:35,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:35,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:35,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 51 states. [2022-02-20 16:39:35,741 INFO L87 Difference]: Start difference. First operand has 51 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 51 states. [2022-02-20 16:39:35,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:35,744 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-02-20 16:39:35,744 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-02-20 16:39:35,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:35,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:35,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:39:35,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:39:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:39:35,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2022-02-20 16:39:35,751 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 10 [2022-02-20 16:39:35,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:39:35,752 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2022-02-20 16:39:35,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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:39:35,752 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-02-20 16:39:35,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:39:35,753 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:39:35,754 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:39:35,771 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:39:35,963 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:39:35,964 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:39:35,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:39:35,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1305819442, now seen corresponding path program 1 times [2022-02-20 16:39:35,965 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:39:35,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863852589] [2022-02-20 16:39:35,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:39:35,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:39:35,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:39:35,966 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:39:35,967 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:39:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:36,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:39:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:36,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:39:36,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {382#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_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30));~one_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~pi~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.1415925026));~pio2_hi_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.5707962513));~pio2_lo_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.5497894159E-8));~pS0_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.16666667163));~pS1_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.32556581497)));~pS2_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.20121252537));~pS3_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.040055535734)));~pS4_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.9153501429E-4));~pS5_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.4793309169E-5));~qS1_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.4033949375)));~qS2_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 2.0209457874));~qS3_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.68828397989)));~qS4_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.077038154006)); {382#true} is VALID [2022-02-20 16:39:36,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {382#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1, main_#t~ret13#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_acosf } true;__ieee754_acosf_#in~x#1 := main_~x~0#1;havoc __ieee754_acosf_#res#1;havoc __ieee754_acosf_#t~mem7#1, __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset, __ieee754_acosf_#t~ret8#1, __ieee754_acosf_#t~ret9#1, __ieee754_acosf_#t~mem10#1, __ieee754_acosf_~#gf_u~2#1.base, __ieee754_acosf_~#gf_u~2#1.offset, __ieee754_acosf_#t~mem11#1, __ieee754_acosf_~#sf_u~1#1.base, __ieee754_acosf_~#sf_u~1#1.offset, __ieee754_acosf_~idf~0#1, __ieee754_acosf_~x#1, __ieee754_acosf_~z~1#1, __ieee754_acosf_~p~0#1, __ieee754_acosf_~q~1#1, __ieee754_acosf_~r~1#1, __ieee754_acosf_~w~0#1, __ieee754_acosf_~s~1#1, __ieee754_acosf_~c~0#1, __ieee754_acosf_~df~0#1, __ieee754_acosf_~hx~1#1, __ieee754_acosf_~ix~1#1;__ieee754_acosf_~x#1 := __ieee754_acosf_#in~x#1;havoc __ieee754_acosf_~z~1#1;havoc __ieee754_acosf_~p~0#1;havoc __ieee754_acosf_~q~1#1;havoc __ieee754_acosf_~r~1#1;havoc __ieee754_acosf_~w~0#1;havoc __ieee754_acosf_~s~1#1;havoc __ieee754_acosf_~c~0#1;havoc __ieee754_acosf_~df~0#1;havoc __ieee754_acosf_~hx~1#1;havoc __ieee754_acosf_~ix~1#1; {390#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_acosf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:39:36,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {390#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_acosf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_acosf_~x#1, __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset, 4bv32);call __ieee754_acosf_#t~mem7#1 := read~intINTTYPE4(__ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset, 4bv32);__ieee754_acosf_~hx~1#1 := __ieee754_acosf_#t~mem7#1;havoc __ieee754_acosf_#t~mem7#1;call ULTIMATE.dealloc(__ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset);havoc __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset; {394#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_acosf_~hx~1#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:39:36,943 INFO L290 TraceCheckUtils]: 3: Hoare triple {394#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_acosf_~hx~1#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} goto; {394#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_acosf_~hx~1#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:39:36,945 INFO L290 TraceCheckUtils]: 4: Hoare triple {394#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_acosf_~hx~1#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} __ieee754_acosf_~ix~1#1 := ~bvand32(2147483647bv32, __ieee754_acosf_~hx~1#1); {401#(exists ((|ULTIMATE.start___ieee754_acosf_~hx~1#1| (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) |ULTIMATE.start___ieee754_acosf_~ix~1#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_acosf_~hx~1#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))))} is VALID [2022-02-20 16:39:36,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {401#(exists ((|ULTIMATE.start___ieee754_acosf_~hx~1#1| (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) |ULTIMATE.start___ieee754_acosf_~ix~1#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_acosf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_acosf_~hx~1#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))))} assume 1065353216bv32 == __ieee754_acosf_~ix~1#1; {383#false} is VALID [2022-02-20 16:39:36,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {383#false} assume ~bvsgt32(__ieee754_acosf_~hx~1#1, 0bv32);__ieee754_acosf_#res#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()); {383#false} is VALID [2022-02-20 16:39:36,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {383#false} main_#t~ret12#1 := __ieee754_acosf_#res#1;assume { :end_inline___ieee754_acosf } true;main_~res~0#1 := main_#t~ret12#1;havoc main_#t~ret12#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {383#false} is VALID [2022-02-20 16:39:36,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {383#false} main_#t~ret13#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {383#false} is VALID [2022-02-20 16:39:36,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {383#false} assume 0bv32 == main_#t~ret13#1;havoc main_#t~ret13#1; {383#false} is VALID [2022-02-20 16:39:36,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {383#false} assume !false; {383#false} is VALID [2022-02-20 16:39:36,947 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:39:36,947 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:39:36,947 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:39:36,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863852589] [2022-02-20 16:39:36,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863852589] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:39:36,947 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:39:36,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:39:36,947 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760377967] [2022-02-20 16:39:36,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:39:36,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:39:36,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:39:36,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:39:36,984 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:39:36,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:39:36,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:39:36,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:39:36,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:39:36,985 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:40:08,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:08,813 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2022-02-20 16:40:08,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:40:08,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:40:08,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:40:08,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:40:08,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-02-20 16:40:08,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:40:08,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-02-20 16:40:08,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-02-20 16:40:11,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:11,328 INFO L225 Difference]: With dead ends: 56 [2022-02-20 16:40:11,328 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 16:40:11,329 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:40:11,329 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:40:11,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 17 Unchecked, 0.0s Time] [2022-02-20 16:40:11,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 16:40:11,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-02-20 16:40:11,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:40:11,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:40:11,334 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:40:11,334 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:40:11,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:11,336 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-02-20 16:40:11,336 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2022-02-20 16:40:11,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:11,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:11,337 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 50 states. [2022-02-20 16:40:11,337 INFO L87 Difference]: Start difference. First operand has 50 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 50 states. [2022-02-20 16:40:11,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:11,339 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2022-02-20 16:40:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2022-02-20 16:40:11,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:11,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:11,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:40:11,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:40:11,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:40:11,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2022-02-20 16:40:11,342 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 11 [2022-02-20 16:40:11,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:40:11,342 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2022-02-20 16:40:11,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:40:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2022-02-20 16:40:11,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:40:11,343 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:40:11,343 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:40:11,362 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:40:11,559 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:40:11,560 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:40:11,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:40:11,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1098950738, now seen corresponding path program 1 times [2022-02-20 16:40:11,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:40:11,561 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871674458] [2022-02-20 16:40:11,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:40:11,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:40:11,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:40:11,562 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:40:11,563 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:40:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:12,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:40:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:12,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:40:13,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {649#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_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30));~one_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~pi~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.1415925026));~pio2_hi_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.5707962513));~pio2_lo_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.5497894159E-8));~pS0_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.16666667163));~pS1_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.32556581497)));~pS2_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.20121252537));~pS3_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.040055535734)));~pS4_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.9153501429E-4));~pS5_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.4793309169E-5));~qS1_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.4033949375)));~qS2_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 2.0209457874));~qS3_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.68828397989)));~qS4_acos~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.077038154006)); {654#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:40:13,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {654#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1, main_#t~ret13#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_acosf } true;__ieee754_acosf_#in~x#1 := main_~x~0#1;havoc __ieee754_acosf_#res#1;havoc __ieee754_acosf_#t~mem7#1, __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset, __ieee754_acosf_#t~ret8#1, __ieee754_acosf_#t~ret9#1, __ieee754_acosf_#t~mem10#1, __ieee754_acosf_~#gf_u~2#1.base, __ieee754_acosf_~#gf_u~2#1.offset, __ieee754_acosf_#t~mem11#1, __ieee754_acosf_~#sf_u~1#1.base, __ieee754_acosf_~#sf_u~1#1.offset, __ieee754_acosf_~idf~0#1, __ieee754_acosf_~x#1, __ieee754_acosf_~z~1#1, __ieee754_acosf_~p~0#1, __ieee754_acosf_~q~1#1, __ieee754_acosf_~r~1#1, __ieee754_acosf_~w~0#1, __ieee754_acosf_~s~1#1, __ieee754_acosf_~c~0#1, __ieee754_acosf_~df~0#1, __ieee754_acosf_~hx~1#1, __ieee754_acosf_~ix~1#1;__ieee754_acosf_~x#1 := __ieee754_acosf_#in~x#1;havoc __ieee754_acosf_~z~1#1;havoc __ieee754_acosf_~p~0#1;havoc __ieee754_acosf_~q~1#1;havoc __ieee754_acosf_~r~1#1;havoc __ieee754_acosf_~w~0#1;havoc __ieee754_acosf_~s~1#1;havoc __ieee754_acosf_~c~0#1;havoc __ieee754_acosf_~df~0#1;havoc __ieee754_acosf_~hx~1#1;havoc __ieee754_acosf_~ix~1#1; {658#(and (= |ULTIMATE.start___ieee754_acosf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:40:13,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {658#(and (= |ULTIMATE.start___ieee754_acosf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} call __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_acosf_~x#1, __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset, 4bv32);call __ieee754_acosf_#t~mem7#1 := read~intINTTYPE4(__ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset, 4bv32);__ieee754_acosf_~hx~1#1 := __ieee754_acosf_#t~mem7#1;havoc __ieee754_acosf_#t~mem7#1;call ULTIMATE.dealloc(__ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset);havoc __ieee754_acosf_~#gf_u~1#1.base, __ieee754_acosf_~#gf_u~1#1.offset; {658#(and (= |ULTIMATE.start___ieee754_acosf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:40:13,047 INFO L290 TraceCheckUtils]: 3: Hoare triple {658#(and (= |ULTIMATE.start___ieee754_acosf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} goto; {658#(and (= |ULTIMATE.start___ieee754_acosf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:40:13,048 INFO L290 TraceCheckUtils]: 4: Hoare triple {658#(and (= |ULTIMATE.start___ieee754_acosf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} __ieee754_acosf_~ix~1#1 := ~bvand32(2147483647bv32, __ieee754_acosf_~hx~1#1); {658#(and (= |ULTIMATE.start___ieee754_acosf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:40:13,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {658#(and (= |ULTIMATE.start___ieee754_acosf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} assume !(1065353216bv32 == __ieee754_acosf_~ix~1#1); {658#(and (= |ULTIMATE.start___ieee754_acosf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:40:13,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {658#(and (= |ULTIMATE.start___ieee754_acosf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvsgt32(__ieee754_acosf_~ix~1#1, 1065353216bv32);__ieee754_acosf_#res#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.sub~FLOAT(currentRoundingMode, __ieee754_acosf_~x#1, __ieee754_acosf_~x#1), ~fp.sub~FLOAT(currentRoundingMode, __ieee754_acosf_~x#1, __ieee754_acosf_~x#1)); {674#(= (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24))) (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) |ULTIMATE.start___ieee754_acosf_#res#1|)} is VALID [2022-02-20 16:40:13,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {674#(= (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24))) (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) |ULTIMATE.start___ieee754_acosf_#res#1|)} main_#t~ret12#1 := __ieee754_acosf_#res#1;assume { :end_inline___ieee754_acosf } true;main_~res~0#1 := main_#t~ret12#1;havoc main_#t~ret12#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {678#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} is VALID [2022-02-20 16:40:13,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {678#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} main_#t~ret13#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {682#(= |ULTIMATE.start_main_#t~ret13#1| (_ bv1 32))} is VALID [2022-02-20 16:40:13,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#(= |ULTIMATE.start_main_#t~ret13#1| (_ bv1 32))} assume 0bv32 == main_#t~ret13#1;havoc main_#t~ret13#1; {650#false} is VALID [2022-02-20 16:40:13,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {650#false} assume !false; {650#false} is VALID [2022-02-20 16:40:13,050 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:40:13,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:40:13,051 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:40:13,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871674458] [2022-02-20 16:40:13,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871674458] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:40:13,051 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:40:13,051 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:40:13,052 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083870939] [2022-02-20 16:40:13,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:40:13,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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:40:13,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:40:13,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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:40:13,207 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:40:13,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:40:13,208 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:40:13,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:40:13,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:40:13,209 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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:40:18,259 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:40:20,820 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []