./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0684b.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_0684b.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 27ce6cfdcb9dfa0489011437b04a08db6e71d8edccf3dd91706f7dddce0310b4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:41:50,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:41:50,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:41:50,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:41:50,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:41:50,663 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:41:50,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:41:50,669 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:41:50,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:41:50,674 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:41:50,674 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:41:50,675 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:41:50,675 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:41:50,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:41:50,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:41:50,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:41:50,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:41:50,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:41:50,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:41:50,688 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:41:50,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:41:50,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:41:50,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:41:50,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:41:50,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:41:50,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:41:50,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:41:50,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:41:50,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:41:50,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:41:50,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:41:50,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:41:50,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:41:50,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:41:50,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:41:50,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:41:50,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:41:50,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:41:50,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:41:50,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:41:50,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:41:50,717 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:41:50,744 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:41:50,744 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:41:50,745 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:41:50,745 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:41:50,745 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:41:50,746 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:41:50,746 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:41:50,746 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:41:50,746 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:41:50,746 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:41:50,747 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:41:50,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:41:50,747 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:41:50,747 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:41:50,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:41:50,748 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:41:50,748 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:41:50,748 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:41:50,748 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:41:50,748 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:41:50,748 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:41:50,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:41:50,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:41:50,749 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:41:50,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:41:50,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:41:50,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:41:50,750 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:41:50,750 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:41:50,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:41:50,750 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:41:50,751 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:41:50,751 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:41:50,751 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 -> 27ce6cfdcb9dfa0489011437b04a08db6e71d8edccf3dd91706f7dddce0310b4 [2022-02-20 16:41:50,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:41:50,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:41:50,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:41:50,940 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:41:50,940 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:41:50,941 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0684b.c [2022-02-20 16:41:50,979 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e6a7c4d5/6c7d51f8ad1e4ff48dee8507b9ab2b58/FLAG92e3282fd [2022-02-20 16:41:51,496 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:41:51,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0684b.c [2022-02-20 16:41:51,516 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e6a7c4d5/6c7d51f8ad1e4ff48dee8507b9ab2b58/FLAG92e3282fd [2022-02-20 16:41:52,016 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e6a7c4d5/6c7d51f8ad1e4ff48dee8507b9ab2b58 [2022-02-20 16:41:52,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:41:52,019 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:41:52,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:41:52,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:41:52,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:41:52,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:41:52" (1/1) ... [2022-02-20 16:41:52,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ce18317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:52, skipping insertion in model container [2022-02-20 16:41:52,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:41:52" (1/1) ... [2022-02-20 16:41:52,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:41:52,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:41:52,254 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_0684b.c[5556,5569] [2022-02-20 16:41:52,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:41:52,277 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:41:52,334 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_0684b.c[5556,5569] [2022-02-20 16:41:52,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:41:52,354 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:41:52,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:52 WrapperNode [2022-02-20 16:41:52,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:41:52,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:41:52,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:41:52,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:41:52,363 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:41:52" (1/1) ... [2022-02-20 16:41:52,382 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:41:52" (1/1) ... [2022-02-20 16:41:52,429 INFO L137 Inliner]: procedures = 20, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 274 [2022-02-20 16:41:52,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:41:52,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:41:52,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:41:52,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:41:52,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:52" (1/1) ... [2022-02-20 16:41:52,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:52" (1/1) ... [2022-02-20 16:41:52,451 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:52" (1/1) ... [2022-02-20 16:41:52,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:52" (1/1) ... [2022-02-20 16:41:52,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:52" (1/1) ... [2022-02-20 16:41:52,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:52" (1/1) ... [2022-02-20 16:41:52,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:52" (1/1) ... [2022-02-20 16:41:52,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:41:52,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:41:52,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:41:52,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:41:52,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:52" (1/1) ... [2022-02-20 16:41:52,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:41:52,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:41:52,531 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:41:52,550 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:41:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:41:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:41:52,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:41:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:41:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:41:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:41:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-02-20 16:41:52,575 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-02-20 16:41:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:41:52,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:41:52,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:41:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:41:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-02-20 16:41:52,576 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-02-20 16:41:52,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:41:52,642 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:41:52,643 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:41:53,139 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:41:53,146 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:41:53,147 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-02-20 16:41:53,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:41:53 BoogieIcfgContainer [2022-02-20 16:41:53,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:41:53,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:41:53,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:41:53,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:41:53,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:41:52" (1/3) ... [2022-02-20 16:41:53,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5883c39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:41:53, skipping insertion in model container [2022-02-20 16:41:53,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:52" (2/3) ... [2022-02-20 16:41:53,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5883c39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:41:53, skipping insertion in model container [2022-02-20 16:41:53,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:41:53" (3/3) ... [2022-02-20 16:41:53,163 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0684b.c [2022-02-20 16:41:53,169 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:41:53,169 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:41:53,202 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:41:53,206 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:41:53,207 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:41:53,222 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 101 states have (on average 1.7227722772277227) internal successors, (174), 102 states have internal predecessors, (174), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:53,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:41:53,225 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:41:53,226 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:41:53,226 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:41:53,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:41:53,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1799288028, now seen corresponding path program 1 times [2022-02-20 16:41:53,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:41:53,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590220656] [2022-02-20 16:41:53,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:41:53,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:41:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:41:53,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {112#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~#atanhi_atan~0.base, ~#atanhi_atan~0.offset := 4, 0;call #Ultimate.allocInit(16, 4);call write~init~real(0.46364760399, ~#atanhi_atan~0.base, ~#atanhi_atan~0.offset, 4);call write~init~real(0.78539812565, ~#atanhi_atan~0.base, 4 + ~#atanhi_atan~0.offset, 4);call write~init~real(0.98279368877, ~#atanhi_atan~0.base, 8 + ~#atanhi_atan~0.offset, 4);call write~init~real(1.5707962513, ~#atanhi_atan~0.base, 12 + ~#atanhi_atan~0.offset, 4);~#atanlo_atan~0.base, ~#atanlo_atan~0.offset := 5, 0;call #Ultimate.allocInit(16, 5);call write~init~real(5.012158244E-9, ~#atanlo_atan~0.base, ~#atanlo_atan~0.offset, 4);call write~init~real(3.7748947079E-8, ~#atanlo_atan~0.base, 4 + ~#atanlo_atan~0.offset, 4);call write~init~real(3.447321717E-8, ~#atanlo_atan~0.base, 8 + ~#atanlo_atan~0.offset, 4);call write~init~real(7.5497894159E-8, ~#atanlo_atan~0.base, 12 + ~#atanlo_atan~0.offset, 4);~#aT_atan~0.base, ~#aT_atan~0.offset := 6, 0;call #Ultimate.allocInit(44, 6);call write~init~real(0.33333334327, ~#aT_atan~0.base, ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.20000000298), ~#aT_atan~0.base, 4 + ~#aT_atan~0.offset, 4);call write~init~real(0.14285714924, ~#aT_atan~0.base, 8 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.11111110449), ~#aT_atan~0.base, 12 + ~#aT_atan~0.offset, 4);call write~init~real(0.090908870101, ~#aT_atan~0.base, 16 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.076918758452), ~#aT_atan~0.base, 20 + ~#aT_atan~0.offset, 4);call write~init~real(0.066610731184, ~#aT_atan~0.base, 24 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.058335702866), ~#aT_atan~0.base, 28 + ~#aT_atan~0.offset, 4);call write~init~real(0.049768779427, ~#aT_atan~0.base, 32 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.036531571299), ~#aT_atan~0.base, 36 + ~#aT_atan~0.offset, 4);call write~init~real(0.016285819933, ~#aT_atan~0.base, 40 + ~#aT_atan~0.offset, 4);~one_atan~0 := 1.0;~huge_atan~0 := 1.0E30;~pi_o_4~0 := 0.78539818525;~pi_o_2~0 := 1.5707963705;~pi~0 := 3.141592741;~tiny_atan2~0 := 1.0E-30;~zero_atan2~0 := 0.0;~pi_lo_atan2~0 := ~someUnaryDOUBLEoperation(8.7422776573E-8); {112#true} is VALID [2022-02-20 16:41:53,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {112#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet44#1;havoc main_#t~nondet44#1;main_~y~0#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);assume { :begin_inline_isfinite_float } true;isfinite_float_#in~x#1 := main_~x~0#1;havoc isfinite_float_#res#1;havoc isfinite_float_#t~mem43#1, isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset, isfinite_float_~x#1, isfinite_float_~ix~3#1;isfinite_float_~x#1 := isfinite_float_#in~x#1;havoc isfinite_float_~ix~3#1; {112#true} is VALID [2022-02-20 16:41:53,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {112#true} assume !true; {113#false} is VALID [2022-02-20 16:41:53,352 INFO L290 TraceCheckUtils]: 3: Hoare triple {113#false} isfinite_float_~ix~3#1 := (if 0 == isfinite_float_~ix~3#1 then 0 else (if 1 == isfinite_float_~ix~3#1 then 1 else ~bitwiseAnd(isfinite_float_~ix~3#1, 2147483647)));isfinite_float_#res#1 := (if isfinite_float_~ix~3#1 < 2139095040 then 1 else 0); {113#false} is VALID [2022-02-20 16:41:53,352 INFO L290 TraceCheckUtils]: 4: Hoare triple {113#false} main_#t~ret45#1 := isfinite_float_#res#1;assume { :end_inline_isfinite_float } true;assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647; {113#false} is VALID [2022-02-20 16:41:53,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {113#false} assume 0 != main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline___ieee754_atan2f } true;__ieee754_atan2f_#in~y#1, __ieee754_atan2f_#in~x#1 := main_~y~0#1, main_~x~0#1;havoc __ieee754_atan2f_#res#1;havoc __ieee754_atan2f_#t~mem27#1, __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset, __ieee754_atan2f_#t~mem29#1, __ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset, __ieee754_atan2f_#t~ret31#1, __ieee754_atan2f_#t~switch33#1, __ieee754_atan2f_#t~ite34#1, __ieee754_atan2f_#t~switch35#1, __ieee754_atan2f_#t~switch36#1, __ieee754_atan2f_#t~ite37#1, __ieee754_atan2f_#t~ret38#1, __ieee754_atan2f_#t~ret39#1, __ieee754_atan2f_#t~switch40#1, __ieee754_atan2f_#t~mem41#1, __ieee754_atan2f_~#gf_u~4#1.base, __ieee754_atan2f_~#gf_u~4#1.offset, __ieee754_atan2f_#t~mem42#1, __ieee754_atan2f_~#sf_u~1#1.base, __ieee754_atan2f_~#sf_u~1#1.offset, __ieee754_atan2f_~zh~0#1, __ieee754_atan2f_~y#1, __ieee754_atan2f_~x#1, __ieee754_atan2f_~z~1#1, __ieee754_atan2f_~k~0#1, __ieee754_atan2f_~m~0#1, __ieee754_atan2f_~hx~1#1, __ieee754_atan2f_~hy~0#1, __ieee754_atan2f_~ix~2#1, __ieee754_atan2f_~iy~0#1, __ieee754_atan2f_#t~nondet28#1, __ieee754_atan2f_#t~nondet30#1, __ieee754_atan2f_#t~nondet32#1;__ieee754_atan2f_~y#1 := __ieee754_atan2f_#in~y#1;__ieee754_atan2f_~x#1 := __ieee754_atan2f_#in~x#1;havoc __ieee754_atan2f_~z~1#1;havoc __ieee754_atan2f_~k~0#1;havoc __ieee754_atan2f_~m~0#1;havoc __ieee754_atan2f_~hx~1#1;havoc __ieee754_atan2f_~hy~0#1;havoc __ieee754_atan2f_~ix~2#1;havoc __ieee754_atan2f_~iy~0#1; {113#false} is VALID [2022-02-20 16:41:53,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {113#false} assume !true; {113#false} is VALID [2022-02-20 16:41:53,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {113#false} assume 0 == __ieee754_atan2f_~hx~1#1;__ieee754_atan2f_~ix~2#1 := 0; {113#false} is VALID [2022-02-20 16:41:53,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {113#false} assume !true; {113#false} is VALID [2022-02-20 16:41:53,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {113#false} assume 0 == __ieee754_atan2f_~hy~0#1;__ieee754_atan2f_~iy~0#1 := 0; {113#false} is VALID [2022-02-20 16:41:53,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {113#false} assume __ieee754_atan2f_~ix~2#1 > 2139095040 || __ieee754_atan2f_~iy~0#1 > 2139095040;__ieee754_atan2f_#res#1 := ~someBinaryArithmeticFLOAToperation(__ieee754_atan2f_~x#1, __ieee754_atan2f_~y#1); {113#false} is VALID [2022-02-20 16:41:53,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {113#false} main_#t~ret46#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1; {113#false} is VALID [2022-02-20 16:41:53,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {113#false} assume ~someBinaryFLOATComparisonOperation(main_~res~0#1, ~someUnaryFLOAToperation(~pi_o_2~0)); {113#false} is VALID [2022-02-20 16:41:53,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {113#false} assume !false; {113#false} is VALID [2022-02-20 16:41:53,355 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:41:53,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:41:53,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590220656] [2022-02-20 16:41:53,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590220656] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:41:53,356 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:41:53,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:41:53,357 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400301774] [2022-02-20 16:41:53,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:41:53,360 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:41:53,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:41:53,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:53,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:41:53,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:41:53,376 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:41:53,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:41:53,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:41:53,393 INFO L87 Difference]: Start difference. First operand has 109 states, 101 states have (on average 1.7227722772277227) internal successors, (174), 102 states have internal predecessors, (174), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:53,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:53,529 INFO L93 Difference]: Finished difference Result 216 states and 366 transitions. [2022-02-20 16:41:53,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:41:53,529 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:41:53,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:41:53,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 366 transitions. [2022-02-20 16:41:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:53,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 366 transitions. [2022-02-20 16:41:53,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 366 transitions. [2022-02-20 16:41:53,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 366 edges. 366 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:41:53,841 INFO L225 Difference]: With dead ends: 216 [2022-02-20 16:41:53,841 INFO L226 Difference]: Without dead ends: 105 [2022-02-20 16:41:53,844 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:41:53,846 INFO L933 BasicCegarLoop]: 159 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, 159 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:41:53,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:41:53,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-02-20 16:41:53,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-02-20 16:41:53,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:41:53,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 105 states, 98 states have (on average 1.489795918367347) internal successors, (146), 98 states have internal predecessors, (146), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:53,872 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 105 states, 98 states have (on average 1.489795918367347) internal successors, (146), 98 states have internal predecessors, (146), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:53,872 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 105 states, 98 states have (on average 1.489795918367347) internal successors, (146), 98 states have internal predecessors, (146), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:53,877 INFO L93 Difference]: Finished difference Result 105 states and 154 transitions. [2022-02-20 16:41:53,878 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2022-02-20 16:41:53,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:41:53,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:41:53,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 98 states have (on average 1.489795918367347) internal successors, (146), 98 states have internal predecessors, (146), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 105 states. [2022-02-20 16:41:53,880 INFO L87 Difference]: Start difference. First operand has 105 states, 98 states have (on average 1.489795918367347) internal successors, (146), 98 states have internal predecessors, (146), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 105 states. [2022-02-20 16:41:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:53,884 INFO L93 Difference]: Finished difference Result 105 states and 154 transitions. [2022-02-20 16:41:53,885 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2022-02-20 16:41:53,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:41:53,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:41:53,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:41:53,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:41:53,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 98 states have (on average 1.489795918367347) internal successors, (146), 98 states have internal predecessors, (146), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2022-02-20 16:41:53,891 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 14 [2022-02-20 16:41:53,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:41:53,891 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2022-02-20 16:41:53,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:53,892 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2022-02-20 16:41:53,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:41:53,892 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:41:53,892 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:41:53,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:41:53,893 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:41:53,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:41:53,894 INFO L85 PathProgramCache]: Analyzing trace with hash 647324465, now seen corresponding path program 1 times [2022-02-20 16:41:53,894 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:41:53,894 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459657295] [2022-02-20 16:41:53,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:41:53,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:41:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:41:53,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {688#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~#atanhi_atan~0.base, ~#atanhi_atan~0.offset := 4, 0;call #Ultimate.allocInit(16, 4);call write~init~real(0.46364760399, ~#atanhi_atan~0.base, ~#atanhi_atan~0.offset, 4);call write~init~real(0.78539812565, ~#atanhi_atan~0.base, 4 + ~#atanhi_atan~0.offset, 4);call write~init~real(0.98279368877, ~#atanhi_atan~0.base, 8 + ~#atanhi_atan~0.offset, 4);call write~init~real(1.5707962513, ~#atanhi_atan~0.base, 12 + ~#atanhi_atan~0.offset, 4);~#atanlo_atan~0.base, ~#atanlo_atan~0.offset := 5, 0;call #Ultimate.allocInit(16, 5);call write~init~real(5.012158244E-9, ~#atanlo_atan~0.base, ~#atanlo_atan~0.offset, 4);call write~init~real(3.7748947079E-8, ~#atanlo_atan~0.base, 4 + ~#atanlo_atan~0.offset, 4);call write~init~real(3.447321717E-8, ~#atanlo_atan~0.base, 8 + ~#atanlo_atan~0.offset, 4);call write~init~real(7.5497894159E-8, ~#atanlo_atan~0.base, 12 + ~#atanlo_atan~0.offset, 4);~#aT_atan~0.base, ~#aT_atan~0.offset := 6, 0;call #Ultimate.allocInit(44, 6);call write~init~real(0.33333334327, ~#aT_atan~0.base, ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.20000000298), ~#aT_atan~0.base, 4 + ~#aT_atan~0.offset, 4);call write~init~real(0.14285714924, ~#aT_atan~0.base, 8 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.11111110449), ~#aT_atan~0.base, 12 + ~#aT_atan~0.offset, 4);call write~init~real(0.090908870101, ~#aT_atan~0.base, 16 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.076918758452), ~#aT_atan~0.base, 20 + ~#aT_atan~0.offset, 4);call write~init~real(0.066610731184, ~#aT_atan~0.base, 24 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.058335702866), ~#aT_atan~0.base, 28 + ~#aT_atan~0.offset, 4);call write~init~real(0.049768779427, ~#aT_atan~0.base, 32 + ~#aT_atan~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.036531571299), ~#aT_atan~0.base, 36 + ~#aT_atan~0.offset, 4);call write~init~real(0.016285819933, ~#aT_atan~0.base, 40 + ~#aT_atan~0.offset, 4);~one_atan~0 := 1.0;~huge_atan~0 := 1.0E30;~pi_o_4~0 := 0.78539818525;~pi_o_2~0 := 1.5707963705;~pi~0 := 3.141592741;~tiny_atan2~0 := 1.0E-30;~zero_atan2~0 := 0.0;~pi_lo_atan2~0 := ~someUnaryDOUBLEoperation(8.7422776573E-8); {688#true} is VALID [2022-02-20 16:41:53,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {688#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet44#1, main_#t~ret45#1, main_#t~ret46#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet44#1;havoc main_#t~nondet44#1;main_~y~0#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);assume { :begin_inline_isfinite_float } true;isfinite_float_#in~x#1 := main_~x~0#1;havoc isfinite_float_#res#1;havoc isfinite_float_#t~mem43#1, isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset, isfinite_float_~x#1, isfinite_float_~ix~3#1;isfinite_float_~x#1 := isfinite_float_#in~x#1;havoc isfinite_float_~ix~3#1; {688#true} is VALID [2022-02-20 16:41:53,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {688#true} call isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset := #Ultimate.allocOnStack(4);call write~real(isfinite_float_~x#1, isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset, 4);call isfinite_float_#t~mem43#1 := read~int(isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset, 4);isfinite_float_~ix~3#1 := (if isfinite_float_#t~mem43#1 % 4294967296 % 4294967296 <= 2147483647 then isfinite_float_#t~mem43#1 % 4294967296 % 4294967296 else isfinite_float_#t~mem43#1 % 4294967296 % 4294967296 - 4294967296);havoc isfinite_float_#t~mem43#1;call ULTIMATE.dealloc(isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset);havoc isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset; {688#true} is VALID [2022-02-20 16:41:53,980 INFO L290 TraceCheckUtils]: 3: Hoare triple {688#true} goto; {688#true} is VALID [2022-02-20 16:41:53,981 INFO L290 TraceCheckUtils]: 4: Hoare triple {688#true} isfinite_float_~ix~3#1 := (if 0 == isfinite_float_~ix~3#1 then 0 else (if 1 == isfinite_float_~ix~3#1 then 1 else ~bitwiseAnd(isfinite_float_~ix~3#1, 2147483647)));isfinite_float_#res#1 := (if isfinite_float_~ix~3#1 < 2139095040 then 1 else 0); {688#true} is VALID [2022-02-20 16:41:53,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {688#true} main_#t~ret45#1 := isfinite_float_#res#1;assume { :end_inline_isfinite_float } true;assume -2147483648 <= main_#t~ret45#1 && main_#t~ret45#1 <= 2147483647; {688#true} is VALID [2022-02-20 16:41:53,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {688#true} assume 0 != main_#t~ret45#1;havoc main_#t~ret45#1;assume { :begin_inline___ieee754_atan2f } true;__ieee754_atan2f_#in~y#1, __ieee754_atan2f_#in~x#1 := main_~y~0#1, main_~x~0#1;havoc __ieee754_atan2f_#res#1;havoc __ieee754_atan2f_#t~mem27#1, __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset, __ieee754_atan2f_#t~mem29#1, __ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset, __ieee754_atan2f_#t~ret31#1, __ieee754_atan2f_#t~switch33#1, __ieee754_atan2f_#t~ite34#1, __ieee754_atan2f_#t~switch35#1, __ieee754_atan2f_#t~switch36#1, __ieee754_atan2f_#t~ite37#1, __ieee754_atan2f_#t~ret38#1, __ieee754_atan2f_#t~ret39#1, __ieee754_atan2f_#t~switch40#1, __ieee754_atan2f_#t~mem41#1, __ieee754_atan2f_~#gf_u~4#1.base, __ieee754_atan2f_~#gf_u~4#1.offset, __ieee754_atan2f_#t~mem42#1, __ieee754_atan2f_~#sf_u~1#1.base, __ieee754_atan2f_~#sf_u~1#1.offset, __ieee754_atan2f_~zh~0#1, __ieee754_atan2f_~y#1, __ieee754_atan2f_~x#1, __ieee754_atan2f_~z~1#1, __ieee754_atan2f_~k~0#1, __ieee754_atan2f_~m~0#1, __ieee754_atan2f_~hx~1#1, __ieee754_atan2f_~hy~0#1, __ieee754_atan2f_~ix~2#1, __ieee754_atan2f_~iy~0#1, __ieee754_atan2f_#t~nondet28#1, __ieee754_atan2f_#t~nondet30#1, __ieee754_atan2f_#t~nondet32#1;__ieee754_atan2f_~y#1 := __ieee754_atan2f_#in~y#1;__ieee754_atan2f_~x#1 := __ieee754_atan2f_#in~x#1;havoc __ieee754_atan2f_~z~1#1;havoc __ieee754_atan2f_~k~0#1;havoc __ieee754_atan2f_~m~0#1;havoc __ieee754_atan2f_~hx~1#1;havoc __ieee754_atan2f_~hy~0#1;havoc __ieee754_atan2f_~ix~2#1;havoc __ieee754_atan2f_~iy~0#1; {688#true} is VALID [2022-02-20 16:41:53,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {688#true} call __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4);call write~real(__ieee754_atan2f_~x#1, __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset, 4);call __ieee754_atan2f_#t~mem27#1 := read~int(__ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset, 4);__ieee754_atan2f_~hx~1#1 := (if __ieee754_atan2f_#t~mem27#1 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_atan2f_#t~mem27#1 % 4294967296 % 4294967296 else __ieee754_atan2f_#t~mem27#1 % 4294967296 % 4294967296 - 4294967296);havoc __ieee754_atan2f_#t~mem27#1;call ULTIMATE.dealloc(__ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset);havoc __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset; {688#true} is VALID [2022-02-20 16:41:53,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {688#true} goto; {688#true} is VALID [2022-02-20 16:41:53,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {688#true} assume 0 == __ieee754_atan2f_~hx~1#1;__ieee754_atan2f_~ix~2#1 := 0; {690#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} is VALID [2022-02-20 16:41:53,982 INFO L290 TraceCheckUtils]: 10: Hoare triple {690#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} call __ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset := #Ultimate.allocOnStack(4);call write~real(__ieee754_atan2f_~y#1, __ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset, 4);call __ieee754_atan2f_#t~mem29#1 := read~int(__ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset, 4);__ieee754_atan2f_~hy~0#1 := (if __ieee754_atan2f_#t~mem29#1 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_atan2f_#t~mem29#1 % 4294967296 % 4294967296 else __ieee754_atan2f_#t~mem29#1 % 4294967296 % 4294967296 - 4294967296);havoc __ieee754_atan2f_#t~mem29#1;call ULTIMATE.dealloc(__ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset);havoc __ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset; {690#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} is VALID [2022-02-20 16:41:53,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {690#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} goto; {690#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} is VALID [2022-02-20 16:41:53,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {690#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} assume 0 == __ieee754_atan2f_~hy~0#1;__ieee754_atan2f_~iy~0#1 := 0; {691#(and (= |ULTIMATE.start___ieee754_atan2f_~iy~0#1| 0) (= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0))} is VALID [2022-02-20 16:41:53,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {691#(and (= |ULTIMATE.start___ieee754_atan2f_~iy~0#1| 0) (= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0))} assume __ieee754_atan2f_~ix~2#1 > 2139095040 || __ieee754_atan2f_~iy~0#1 > 2139095040;__ieee754_atan2f_#res#1 := ~someBinaryArithmeticFLOAToperation(__ieee754_atan2f_~x#1, __ieee754_atan2f_~y#1); {689#false} is VALID [2022-02-20 16:41:53,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {689#false} main_#t~ret46#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret46#1;havoc main_#t~ret46#1; {689#false} is VALID [2022-02-20 16:41:53,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {689#false} assume ~someBinaryFLOATComparisonOperation(main_~res~0#1, ~someUnaryFLOAToperation(~pi_o_2~0)); {689#false} is VALID [2022-02-20 16:41:53,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {689#false} assume !false; {689#false} is VALID [2022-02-20 16:41:53,985 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:41:53,985 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:41:53,985 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459657295] [2022-02-20 16:41:53,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459657295] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:41:53,986 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:41:53,986 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:41:53,986 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226879625] [2022-02-20 16:41:53,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:41:53,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 16:41:53,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:41:53,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:54,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:41:54,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:41:54,001 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:41:54,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:41:54,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:41:54,002 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:54,251 INFO L93 Difference]: Finished difference Result 218 states and 323 transitions. [2022-02-20 16:41:54,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:41:54,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 16:41:54,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:41:54,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:54,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 323 transitions. [2022-02-20 16:41:54,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 323 transitions. [2022-02-20 16:41:54,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 323 transitions. [2022-02-20 16:41:54,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 323 edges. 323 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:41:54,481 INFO L225 Difference]: With dead ends: 218 [2022-02-20 16:41:54,482 INFO L226 Difference]: Without dead ends: 147 [2022-02-20 16:41:54,482 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:41:54,483 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 57 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:41:54,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 434 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:41:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-02-20 16:41:54,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 132. [2022-02-20 16:41:54,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:41:54,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 132 states, 125 states have (on average 1.528) internal successors, (191), 125 states have internal predecessors, (191), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:54,490 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 132 states, 125 states have (on average 1.528) internal successors, (191), 125 states have internal predecessors, (191), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:54,491 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 132 states, 125 states have (on average 1.528) internal successors, (191), 125 states have internal predecessors, (191), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:54,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:54,495 INFO L93 Difference]: Finished difference Result 147 states and 215 transitions. [2022-02-20 16:41:54,495 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 215 transitions. [2022-02-20 16:41:54,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:41:54,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:41:54,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 125 states have (on average 1.528) internal successors, (191), 125 states have internal predecessors, (191), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 147 states. [2022-02-20 16:41:54,497 INFO L87 Difference]: Start difference. First operand has 132 states, 125 states have (on average 1.528) internal successors, (191), 125 states have internal predecessors, (191), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 147 states. [2022-02-20 16:41:54,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:54,501 INFO L93 Difference]: Finished difference Result 147 states and 215 transitions. [2022-02-20 16:41:54,501 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 215 transitions. [2022-02-20 16:41:54,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:41:54,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:41:54,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:41:54,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:41:54,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 125 states have (on average 1.528) internal successors, (191), 125 states have internal predecessors, (191), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:41:54,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 199 transitions. [2022-02-20 16:41:54,506 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 199 transitions. Word has length 17 [2022-02-20 16:41:54,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:41:54,507 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 199 transitions. [2022-02-20 16:41:54,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:54,507 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 199 transitions. [2022-02-20 16:41:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 16:41:54,508 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:41:54,508 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:41:54,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:41:54,508 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:41:54,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:41:54,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2009397772, now seen corresponding path program 1 times [2022-02-20 16:41:54,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:41:54,509 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061630841] [2022-02-20 16:41:54,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:41:54,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:41:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:41:54,572 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:41:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:41:54,632 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:41:54,632 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:41:54,633 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:41:54,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:41:54,636 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:41:54,638 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:41:54,663 WARN L170 areAnnotationChecker]: fabs_floatENTRY has no Hoare annotation [2022-02-20 16:41:54,663 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:41:54,663 WARN L170 areAnnotationChecker]: atan_floatENTRY has no Hoare annotation [2022-02-20 16:41:54,664 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 16:41:54,664 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 16:41:54,664 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:41:54,664 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-02-20 16:41:54,664 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-02-20 16:41:54,664 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:41:54,664 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:41:54,664 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:41:54,664 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:41:54,665 WARN L170 areAnnotationChecker]: L220-2 has no Hoare annotation [2022-02-20 16:41:54,665 WARN L170 areAnnotationChecker]: L220-2 has no Hoare annotation [2022-02-20 16:41:54,665 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-02-20 16:41:54,665 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-02-20 16:41:54,665 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2022-02-20 16:41:54,665 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2022-02-20 16:41:54,665 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 16:41:54,665 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 16:41:54,665 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:41:54,665 WARN L170 areAnnotationChecker]: L220-1 has no Hoare annotation [2022-02-20 16:41:54,666 WARN L170 areAnnotationChecker]: L220-1 has no Hoare annotation [2022-02-20 16:41:54,666 WARN L170 areAnnotationChecker]: L220-3 has no Hoare annotation [2022-02-20 16:41:54,666 WARN L170 areAnnotationChecker]: L62-7 has no Hoare annotation [2022-02-20 16:41:54,666 WARN L170 areAnnotationChecker]: L62-7 has no Hoare annotation [2022-02-20 16:41:54,666 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 16:41:54,666 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 16:41:54,666 WARN L170 areAnnotationChecker]: fabs_floatFINAL has no Hoare annotation [2022-02-20 16:41:54,666 WARN L170 areAnnotationChecker]: L226 has no Hoare annotation [2022-02-20 16:41:54,666 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 16:41:54,667 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 16:41:54,667 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 16:41:54,667 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 16:41:54,667 WARN L170 areAnnotationChecker]: L62-3 has no Hoare annotation [2022-02-20 16:41:54,667 WARN L170 areAnnotationChecker]: L62-3 has no Hoare annotation [2022-02-20 16:41:54,667 WARN L170 areAnnotationChecker]: fabs_floatEXIT has no Hoare annotation [2022-02-20 16:41:54,667 WARN L170 areAnnotationChecker]: fabs_floatEXIT has no Hoare annotation [2022-02-20 16:41:54,667 WARN L170 areAnnotationChecker]: L239 has no Hoare annotation [2022-02-20 16:41:54,667 WARN L170 areAnnotationChecker]: L239 has no Hoare annotation [2022-02-20 16:41:54,667 WARN L170 areAnnotationChecker]: atan_floatFINAL has no Hoare annotation [2022-02-20 16:41:54,668 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:41:54,668 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:41:54,668 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:41:54,668 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:41:54,668 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:41:54,668 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:41:54,668 WARN L170 areAnnotationChecker]: L62-5 has no Hoare annotation [2022-02-20 16:41:54,668 WARN L170 areAnnotationChecker]: L62-5 has no Hoare annotation [2022-02-20 16:41:54,668 WARN L170 areAnnotationChecker]: L192-1 has no Hoare annotation [2022-02-20 16:41:54,669 WARN L170 areAnnotationChecker]: L192-1 has no Hoare annotation [2022-02-20 16:41:54,669 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:41:54,669 WARN L170 areAnnotationChecker]: L124-2 has no Hoare annotation [2022-02-20 16:41:54,669 WARN L170 areAnnotationChecker]: L124-2 has no Hoare annotation [2022-02-20 16:41:54,669 WARN L170 areAnnotationChecker]: L239-2 has no Hoare annotation [2022-02-20 16:41:54,669 WARN L170 areAnnotationChecker]: atan_floatEXIT has no Hoare annotation [2022-02-20 16:41:54,669 WARN L170 areAnnotationChecker]: atan_floatEXIT has no Hoare annotation [2022-02-20 16:41:54,669 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:41:54,669 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:41:54,670 WARN L170 areAnnotationChecker]: L72-2 has no Hoare annotation [2022-02-20 16:41:54,670 WARN L170 areAnnotationChecker]: L192-2 has no Hoare annotation [2022-02-20 16:41:54,670 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:41:54,670 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:41:54,670 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-02-20 16:41:54,670 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-02-20 16:41:54,670 WARN L170 areAnnotationChecker]: L124-3 has no Hoare annotation [2022-02-20 16:41:54,670 WARN L170 areAnnotationChecker]: L124-3 has no Hoare annotation [2022-02-20 16:41:54,670 WARN L170 areAnnotationChecker]: L250 has no Hoare annotation [2022-02-20 16:41:54,670 WARN L170 areAnnotationChecker]: L139-1 has no Hoare annotation [2022-02-20 16:41:54,671 WARN L170 areAnnotationChecker]: L88-2 has no Hoare annotation [2022-02-20 16:41:54,671 WARN L170 areAnnotationChecker]: L189-2 has no Hoare annotation [2022-02-20 16:41:54,671 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:41:54,671 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:41:54,671 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:41:54,671 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:41:54,671 WARN L170 areAnnotationChecker]: L130-1 has no Hoare annotation [2022-02-20 16:41:54,671 WARN L170 areAnnotationChecker]: L130-1 has no Hoare annotation [2022-02-20 16:41:54,671 WARN L170 areAnnotationChecker]: L129-1 has no Hoare annotation [2022-02-20 16:41:54,672 WARN L170 areAnnotationChecker]: L129-1 has no Hoare annotation [2022-02-20 16:41:54,672 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:41:54,672 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-02-20 16:41:54,672 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:41:54,672 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:41:54,672 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-02-20 16:41:54,672 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-02-20 16:41:54,672 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2022-02-20 16:41:54,672 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2022-02-20 16:41:54,672 WARN L170 areAnnotationChecker]: L130-2 has no Hoare annotation [2022-02-20 16:41:54,673 WARN L170 areAnnotationChecker]: L130-2 has no Hoare annotation [2022-02-20 16:41:54,673 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-02-20 16:41:54,673 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-02-20 16:41:54,673 WARN L170 areAnnotationChecker]: L244 has no Hoare annotation [2022-02-20 16:41:54,673 WARN L170 areAnnotationChecker]: L244 has no Hoare annotation [2022-02-20 16:41:54,673 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 16:41:54,673 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 16:41:54,673 WARN L170 areAnnotationChecker]: L196 has no Hoare annotation [2022-02-20 16:41:54,673 WARN L170 areAnnotationChecker]: L196 has no Hoare annotation [2022-02-20 16:41:54,674 WARN L170 areAnnotationChecker]: L135-7 has no Hoare annotation [2022-02-20 16:41:54,674 WARN L170 areAnnotationChecker]: L135-7 has no Hoare annotation [2022-02-20 16:41:54,674 WARN L170 areAnnotationChecker]: L135-1 has no Hoare annotation [2022-02-20 16:41:54,674 WARN L170 areAnnotationChecker]: L135-1 has no Hoare annotation [2022-02-20 16:41:54,674 WARN L170 areAnnotationChecker]: L129-5 has no Hoare annotation [2022-02-20 16:41:54,674 WARN L170 areAnnotationChecker]: L129-5 has no Hoare annotation [2022-02-20 16:41:54,674 WARN L170 areAnnotationChecker]: L245 has no Hoare annotation [2022-02-20 16:41:54,674 WARN L170 areAnnotationChecker]: L245 has no Hoare annotation [2022-02-20 16:41:54,674 WARN L170 areAnnotationChecker]: L113-2 has no Hoare annotation [2022-02-20 16:41:54,674 WARN L170 areAnnotationChecker]: L198-2 has no Hoare annotation [2022-02-20 16:41:54,675 WARN L170 areAnnotationChecker]: L198-2 has no Hoare annotation [2022-02-20 16:41:54,675 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2022-02-20 16:41:54,675 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2022-02-20 16:41:54,675 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2022-02-20 16:41:54,675 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2022-02-20 16:41:54,675 WARN L170 areAnnotationChecker]: L135-3 has no Hoare annotation [2022-02-20 16:41:54,675 WARN L170 areAnnotationChecker]: L135-3 has no Hoare annotation [2022-02-20 16:41:54,675 WARN L170 areAnnotationChecker]: L198-1 has no Hoare annotation [2022-02-20 16:41:54,675 WARN L170 areAnnotationChecker]: L198-1 has no Hoare annotation [2022-02-20 16:41:54,676 WARN L170 areAnnotationChecker]: L203-1 has no Hoare annotation [2022-02-20 16:41:54,676 WARN L170 areAnnotationChecker]: L203-1 has no Hoare annotation [2022-02-20 16:41:54,676 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-02-20 16:41:54,676 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-02-20 16:41:54,676 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2022-02-20 16:41:54,676 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2022-02-20 16:41:54,676 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2022-02-20 16:41:54,676 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2022-02-20 16:41:54,676 WARN L170 areAnnotationChecker]: L135-5 has no Hoare annotation [2022-02-20 16:41:54,677 WARN L170 areAnnotationChecker]: L135-5 has no Hoare annotation [2022-02-20 16:41:54,677 WARN L170 areAnnotationChecker]: L203 has no Hoare annotation [2022-02-20 16:41:54,677 WARN L170 areAnnotationChecker]: L203 has no Hoare annotation [2022-02-20 16:41:54,677 WARN L170 areAnnotationChecker]: L203-2 has no Hoare annotation [2022-02-20 16:41:54,677 WARN L170 areAnnotationChecker]: L193 has no Hoare annotation [2022-02-20 16:41:54,677 WARN L170 areAnnotationChecker]: L140-8 has no Hoare annotation [2022-02-20 16:41:54,677 WARN L170 areAnnotationChecker]: L140-8 has no Hoare annotation [2022-02-20 16:41:54,677 WARN L170 areAnnotationChecker]: L140-2 has no Hoare annotation [2022-02-20 16:41:54,677 WARN L170 areAnnotationChecker]: L140-2 has no Hoare annotation [2022-02-20 16:41:54,678 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2022-02-20 16:41:54,678 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2022-02-20 16:41:54,678 WARN L170 areAnnotationChecker]: L142-1 has no Hoare annotation [2022-02-20 16:41:54,678 WARN L170 areAnnotationChecker]: L142-1 has no Hoare annotation [2022-02-20 16:41:54,678 WARN L170 areAnnotationChecker]: L140-4 has no Hoare annotation [2022-02-20 16:41:54,678 WARN L170 areAnnotationChecker]: L140-4 has no Hoare annotation [2022-02-20 16:41:54,678 WARN L170 areAnnotationChecker]: L144-2 has no Hoare annotation [2022-02-20 16:41:54,678 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-02-20 16:41:54,678 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-02-20 16:41:54,678 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-02-20 16:41:54,679 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-02-20 16:41:54,679 WARN L170 areAnnotationChecker]: L140-6 has no Hoare annotation [2022-02-20 16:41:54,679 WARN L170 areAnnotationChecker]: L140-6 has no Hoare annotation [2022-02-20 16:41:54,679 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-02-20 16:41:54,679 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-02-20 16:41:54,679 WARN L170 areAnnotationChecker]: L155-2 has no Hoare annotation [2022-02-20 16:41:54,679 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2022-02-20 16:41:54,679 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2022-02-20 16:41:54,680 WARN L170 areAnnotationChecker]: L157-1 has no Hoare annotation [2022-02-20 16:41:54,680 WARN L170 areAnnotationChecker]: L157-1 has no Hoare annotation [2022-02-20 16:41:54,680 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-02-20 16:41:54,680 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-02-20 16:41:54,680 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2022-02-20 16:41:54,680 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2022-02-20 16:41:54,680 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2022-02-20 16:41:54,680 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2022-02-20 16:41:54,681 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 16:41:54,681 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 16:41:54,681 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-02-20 16:41:54,681 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-02-20 16:41:54,681 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2022-02-20 16:41:54,681 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2022-02-20 16:41:54,681 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-02-20 16:41:54,681 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-02-20 16:41:54,681 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2022-02-20 16:41:54,682 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2022-02-20 16:41:54,682 WARN L170 areAnnotationChecker]: L184-2 has no Hoare annotation [2022-02-20 16:41:54,682 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-02-20 16:41:54,682 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-02-20 16:41:54,682 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-02-20 16:41:54,682 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-02-20 16:41:54,682 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-02-20 16:41:54,682 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-02-20 16:41:54,682 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-02-20 16:41:54,683 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2022-02-20 16:41:54,683 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2022-02-20 16:41:54,683 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2022-02-20 16:41:54,683 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2022-02-20 16:41:54,683 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-02-20 16:41:54,683 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-02-20 16:41:54,683 WARN L170 areAnnotationChecker]: L159 has no Hoare annotation [2022-02-20 16:41:54,683 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2022-02-20 16:41:54,684 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:41:54,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:41:54 BoogieIcfgContainer [2022-02-20 16:41:54,685 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:41:54,685 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:41:54,685 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:41:54,685 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:41:54,686 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:41:53" (3/4) ... [2022-02-20 16:41:54,688 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:41:54,688 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:41:54,689 INFO L158 Benchmark]: Toolchain (without parser) took 2669.80ms. Allocated memory was 100.7MB in the beginning and 178.3MB in the end (delta: 77.6MB). Free memory was 76.2MB in the beginning and 88.6MB in the end (delta: -12.4MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. [2022-02-20 16:41:54,689 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 100.7MB. Free memory is still 58.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:41:54,689 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.72ms. Allocated memory was 100.7MB in the beginning and 178.3MB in the end (delta: 77.6MB). Free memory was 75.9MB in the beginning and 148.1MB in the end (delta: -72.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:41:54,690 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.12ms. Allocated memory is still 178.3MB. Free memory was 148.1MB in the beginning and 144.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:41:54,690 INFO L158 Benchmark]: Boogie Preprocessor took 56.79ms. Allocated memory is still 178.3MB. Free memory was 144.5MB in the beginning and 141.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:41:54,690 INFO L158 Benchmark]: RCFGBuilder took 663.92ms. Allocated memory is still 178.3MB. Free memory was 141.4MB in the beginning and 108.3MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-02-20 16:41:54,691 INFO L158 Benchmark]: TraceAbstraction took 1527.66ms. Allocated memory is still 178.3MB. Free memory was 107.8MB in the beginning and 88.6MB in the end (delta: 19.2MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2022-02-20 16:41:54,691 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 178.3MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:41:54,693 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.13ms. Allocated memory is still 100.7MB. Free memory is still 58.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.72ms. Allocated memory was 100.7MB in the beginning and 178.3MB in the end (delta: 77.6MB). Free memory was 75.9MB in the beginning and 148.1MB in the end (delta: -72.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.12ms. Allocated memory is still 178.3MB. Free memory was 148.1MB in the beginning and 144.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.79ms. Allocated memory is still 178.3MB. Free memory was 144.5MB in the beginning and 141.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 663.92ms. Allocated memory is still 178.3MB. Free memory was 141.4MB in the beginning and 108.3MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1527.66ms. Allocated memory is still 178.3MB. Free memory was 107.8MB in the beginning and 88.6MB in the end (delta: 19.2MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 178.3MB. Free memory is still 88.6MB. 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: 245]: 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 244, overapproximation of someUnaryDOUBLEoperation at line 44, overapproximation of bitwiseAnd at line 225, overapproximation of someBinaryArithmeticFLOAToperation at line 137. Possible FailurePath: [L29-L34] static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L36-L41] static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L43-L47] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L49-L51] static const float one_atan = 1.0, huge_atan = 1.0e30, pi_o_4 = 7.8539818525e-01, pi_o_2 = 1.5707963705e+00, pi = 3.1415927410e+00; [L117-L118] static const float tiny_atan2 = 1.0e-30, zero_atan2 = 0.0, pi_lo_atan2 = -8.7422776573e-08; VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L236] float x = __VERIFIER_nondet_float(); [L237] float y = -1.0f / 0.0f; [L239] CALL isfinite_float(x) [L219] __int32_t ix; VAL [\old(x)=1000000000000000000000000000002, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, zero_atan2=0] [L221] ieee_float_shape_type gf_u; [L222] gf_u.value = (x) [L223] EXPR gf_u.word [L223] (ix) = gf_u.word [L225] ix &= 0x7fffffff [L226] return (((ix) < 0x7f800000L)); VAL [\old(x)=1000000000000000000000000000002, \result=1, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, ix=2139095039, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, zero_atan2=0] [L239] RET isfinite_float(x) [L239] COND TRUE isfinite_float(x) [L241] CALL, EXPR __ieee754_atan2f(y, x) [L121] float z; [L122] __int32_t k, m, hx, hy, ix, iy; VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L125] ieee_float_shape_type gf_u; [L126] gf_u.value = (x) [L127] EXPR gf_u.word [L127] (hx) = gf_u.word [L129] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L131] ieee_float_shape_type gf_u; [L132] gf_u.value = (y) [L133] EXPR gf_u.word [L133] (hy) = gf_u.word [L135] iy = hy & 0x7fffffff VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, hy=2147483647, ix=0, iy=2147483646, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L136] COND TRUE ((ix) > 0x7f800000L) || ((iy) > 0x7f800000L) [L137] return x + y; VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, hy=2147483647, ix=0, iy=2147483646, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L241] RET, EXPR __ieee754_atan2f(y, x) [L241] float res = __ieee754_atan2f(y, x); [L244] COND TRUE res != -pi_o_2 VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000003, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L245] reach_error() VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000003, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 593 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 276 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 317 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=2, InterpolantAutomatonStates: 6, 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, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 29 ConstructedInterpolants, 0 QuantifiedInterpolants, 41 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:41:54,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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_0684b.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 27ce6cfdcb9dfa0489011437b04a08db6e71d8edccf3dd91706f7dddce0310b4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:41:56,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:41:56,477 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:41:56,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:41:56,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:41:56,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:41:56,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:41:56,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:41:56,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:41:56,533 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:41:56,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:41:56,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:41:56,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:41:56,537 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:41:56,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:41:56,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:41:56,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:41:56,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:41:56,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:41:56,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:41:56,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:41:56,566 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:41:56,567 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:41:56,567 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:41:56,571 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:41:56,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:41:56,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:41:56,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:41:56,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:41:56,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:41:56,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:41:56,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:41:56,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:41:56,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:41:56,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:41:56,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:41:56,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:41:56,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:41:56,582 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:41:56,583 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:41:56,584 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:41:56,585 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:41:56,624 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:41:56,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:41:56,626 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:41:56,626 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:41:56,627 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:41:56,627 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:41:56,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:41:56,628 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:41:56,628 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:41:56,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:41:56,629 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:41:56,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:41:56,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:41:56,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:41:56,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:41:56,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:41:56,630 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:41:56,630 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:41:56,630 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:41:56,630 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:41:56,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:41:56,631 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:41:56,631 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:41:56,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:41:56,631 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:41:56,631 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:41:56,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:41:56,632 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:41:56,632 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:41:56,632 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:41:56,632 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:41:56,632 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:41:56,633 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:41:56,633 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:41:56,633 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:41:56,633 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:41:56,633 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 -> 27ce6cfdcb9dfa0489011437b04a08db6e71d8edccf3dd91706f7dddce0310b4 [2022-02-20 16:41:56,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:41:56,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:41:56,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:41:56,922 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:41:56,923 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:41:56,923 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0684b.c [2022-02-20 16:41:56,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fea60d4b3/b2788c79f0a24eb1ba4f06d079386769/FLAG7ded53ada [2022-02-20 16:41:57,370 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:41:57,371 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0684b.c [2022-02-20 16:41:57,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fea60d4b3/b2788c79f0a24eb1ba4f06d079386769/FLAG7ded53ada [2022-02-20 16:41:57,406 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fea60d4b3/b2788c79f0a24eb1ba4f06d079386769 [2022-02-20 16:41:57,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:41:57,409 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:41:57,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:41:57,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:41:57,412 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:41:57,416 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:41:57" (1/1) ... [2022-02-20 16:41:57,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30de29d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:57, skipping insertion in model container [2022-02-20 16:41:57,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:41:57" (1/1) ... [2022-02-20 16:41:57,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:41:57,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:41:57,676 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_0684b.c[5556,5569] [2022-02-20 16:41:57,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:41:57,700 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:41:57,756 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_0684b.c[5556,5569] [2022-02-20 16:41:57,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:41:57,775 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:41:57,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:57 WrapperNode [2022-02-20 16:41:57,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:41:57,777 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:41:57,777 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:41:57,777 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:41:57,781 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:41:57" (1/1) ... [2022-02-20 16:41:57,796 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:41:57" (1/1) ... [2022-02-20 16:41:57,834 INFO L137 Inliner]: procedures = 23, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 238 [2022-02-20 16:41:57,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:41:57,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:41:57,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:41:57,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:41:57,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:57" (1/1) ... [2022-02-20 16:41:57,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:57" (1/1) ... [2022-02-20 16:41:57,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:57" (1/1) ... [2022-02-20 16:41:57,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:57" (1/1) ... [2022-02-20 16:41:57,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:57" (1/1) ... [2022-02-20 16:41:57,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:57" (1/1) ... [2022-02-20 16:41:57,897 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:57" (1/1) ... [2022-02-20 16:41:57,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:41:57,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:41:57,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:41:57,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:41:57,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:57" (1/1) ... [2022-02-20 16:41:57,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:41:57,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:41:57,930 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:41:57,957 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:41:57,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:41:57,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:41:57,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:41:57,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:41:57,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:41:57,968 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-02-20 16:41:57,968 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-02-20 16:41:57,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:41:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:41:57,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:41:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:41:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-02-20 16:41:57,969 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-02-20 16:41:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:41:57,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:41:58,047 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:41:58,048 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:42:10,670 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:42:10,677 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:42:10,677 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-02-20 16:42:10,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:10 BoogieIcfgContainer [2022-02-20 16:42:10,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:42:10,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:42:10,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:42:10,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:42:10,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:41:57" (1/3) ... [2022-02-20 16:42:10,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623a4ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:10, skipping insertion in model container [2022-02-20 16:42:10,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:41:57" (2/3) ... [2022-02-20 16:42:10,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623a4ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:10, skipping insertion in model container [2022-02-20 16:42:10,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:10" (3/3) ... [2022-02-20 16:42:10,684 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0684b.c [2022-02-20 16:42:10,705 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:42:10,706 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:42:10,737 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:42:10,742 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:42:10,743 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:42:10,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 89 states have internal predecessors, (145), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:42:10,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:42:10,761 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:10,761 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:10,762 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:10,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:10,766 INFO L85 PathProgramCache]: Analyzing trace with hash -540288573, now seen corresponding path program 1 times [2022-02-20 16:42:10,777 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:10,777 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387091291] [2022-02-20 16:42:10,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:10,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:10,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:10,795 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:42:10,839 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:42:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:11,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:42:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:11,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:11,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~#atanhi_atan~0.base, ~#atanhi_atan~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(16bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.46364760399)), ~#atanhi_atan~0.base, ~#atanhi_atan~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.78539812565)), ~#atanhi_atan~0.base, ~bvadd32(4bv32, ~#atanhi_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.98279368877)), ~#atanhi_atan~0.base, ~bvadd32(8bv32, ~#atanhi_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.5707962513)), ~#atanhi_atan~0.base, ~bvadd32(12bv32, ~#atanhi_atan~0.offset), 4bv32);~#atanlo_atan~0.base, ~#atanlo_atan~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(16bv32, 5bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 5.012158244E-9)), ~#atanlo_atan~0.base, ~#atanlo_atan~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.7748947079E-8)), ~#atanlo_atan~0.base, ~bvadd32(4bv32, ~#atanlo_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.447321717E-8)), ~#atanlo_atan~0.base, ~bvadd32(8bv32, ~#atanlo_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.5497894159E-8)), ~#atanlo_atan~0.base, ~bvadd32(12bv32, ~#atanlo_atan~0.offset), 4bv32);~#aT_atan~0.base, ~#aT_atan~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(44bv32, 6bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.33333334327)), ~#aT_atan~0.base, ~#aT_atan~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.20000000298))), ~#aT_atan~0.base, ~bvadd32(4bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.14285714924)), ~#aT_atan~0.base, ~bvadd32(8bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.11111110449))), ~#aT_atan~0.base, ~bvadd32(12bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.090908870101)), ~#aT_atan~0.base, ~bvadd32(16bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.076918758452))), ~#aT_atan~0.base, ~bvadd32(20bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.066610731184)), ~#aT_atan~0.base, ~bvadd32(24bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.058335702866))), ~#aT_atan~0.base, ~bvadd32(28bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.049768779427)), ~#aT_atan~0.base, ~bvadd32(32bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.036531571299))), ~#aT_atan~0.base, ~bvadd32(36bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.016285819933)), ~#aT_atan~0.base, ~bvadd32(40bv32, ~#aT_atan~0.offset), 4bv32);~one_atan~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~huge_atan~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~pi_o_4~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.78539818525));~pi_o_2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.5707963705));~pi~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.141592741));~tiny_atan2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30));~zero_atan2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE());~pi_lo_atan2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 8.7422776573E-8))); {99#true} is VALID [2022-02-20 16:42:11,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet40#1;havoc main_#t~nondet40#1;main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline_isfinite_float } true;isfinite_float_#in~x#1 := main_~x~0#1;havoc isfinite_float_#res#1;havoc isfinite_float_#t~mem39#1, isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset, isfinite_float_~x#1, isfinite_float_~ix~3#1;isfinite_float_~x#1 := isfinite_float_#in~x#1;havoc isfinite_float_~ix~3#1; {99#true} is VALID [2022-02-20 16:42:11,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#true} assume !true; {100#false} is VALID [2022-02-20 16:42:11,715 INFO L290 TraceCheckUtils]: 3: Hoare triple {100#false} isfinite_float_~ix~3#1 := ~bvand32(2147483647bv32, isfinite_float_~ix~3#1);isfinite_float_#res#1 := (if ~bvslt32(isfinite_float_~ix~3#1, 2139095040bv32) then 1bv32 else 0bv32); {100#false} is VALID [2022-02-20 16:42:11,716 INFO L290 TraceCheckUtils]: 4: Hoare triple {100#false} main_#t~ret41#1 := isfinite_float_#res#1;assume { :end_inline_isfinite_float } true; {100#false} is VALID [2022-02-20 16:42:11,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {100#false} assume 0bv32 != main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline___ieee754_atan2f } true;__ieee754_atan2f_#in~y#1, __ieee754_atan2f_#in~x#1 := main_~y~0#1, main_~x~0#1;havoc __ieee754_atan2f_#res#1;havoc __ieee754_atan2f_#t~mem26#1, __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset, __ieee754_atan2f_#t~mem27#1, __ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset, __ieee754_atan2f_#t~ret28#1, __ieee754_atan2f_#t~switch29#1, __ieee754_atan2f_#t~ite30#1, __ieee754_atan2f_#t~switch31#1, __ieee754_atan2f_#t~switch32#1, __ieee754_atan2f_#t~ite33#1, __ieee754_atan2f_#t~ret34#1, __ieee754_atan2f_#t~ret35#1, __ieee754_atan2f_#t~switch36#1, __ieee754_atan2f_#t~mem37#1, __ieee754_atan2f_~#gf_u~4#1.base, __ieee754_atan2f_~#gf_u~4#1.offset, __ieee754_atan2f_#t~mem38#1, __ieee754_atan2f_~#sf_u~1#1.base, __ieee754_atan2f_~#sf_u~1#1.offset, __ieee754_atan2f_~zh~0#1, __ieee754_atan2f_~y#1, __ieee754_atan2f_~x#1, __ieee754_atan2f_~z~1#1, __ieee754_atan2f_~k~0#1, __ieee754_atan2f_~m~0#1, __ieee754_atan2f_~hx~1#1, __ieee754_atan2f_~hy~0#1, __ieee754_atan2f_~ix~2#1, __ieee754_atan2f_~iy~0#1;__ieee754_atan2f_~y#1 := __ieee754_atan2f_#in~y#1;__ieee754_atan2f_~x#1 := __ieee754_atan2f_#in~x#1;havoc __ieee754_atan2f_~z~1#1;havoc __ieee754_atan2f_~k~0#1;havoc __ieee754_atan2f_~m~0#1;havoc __ieee754_atan2f_~hx~1#1;havoc __ieee754_atan2f_~hy~0#1;havoc __ieee754_atan2f_~ix~2#1;havoc __ieee754_atan2f_~iy~0#1; {100#false} is VALID [2022-02-20 16:42:11,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {100#false} assume !true; {100#false} is VALID [2022-02-20 16:42:11,716 INFO L290 TraceCheckUtils]: 7: Hoare triple {100#false} __ieee754_atan2f_~ix~2#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hx~1#1); {100#false} is VALID [2022-02-20 16:42:11,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {100#false} assume !true; {100#false} is VALID [2022-02-20 16:42:11,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {100#false} __ieee754_atan2f_~iy~0#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hy~0#1); {100#false} is VALID [2022-02-20 16:42:11,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {100#false} assume ~bvsgt32(__ieee754_atan2f_~ix~2#1, 2139095040bv32) || ~bvsgt32(__ieee754_atan2f_~iy~0#1, 2139095040bv32);__ieee754_atan2f_#res#1 := ~fp.add~FLOAT(currentRoundingMode, __ieee754_atan2f_~x#1, __ieee754_atan2f_~y#1); {100#false} is VALID [2022-02-20 16:42:11,717 INFO L290 TraceCheckUtils]: 11: Hoare triple {100#false} main_#t~ret42#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret42#1;havoc main_#t~ret42#1; {100#false} is VALID [2022-02-20 16:42:11,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {100#false} assume !~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~pi_o_2~0)); {100#false} is VALID [2022-02-20 16:42:11,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {100#false} assume !false; {100#false} is VALID [2022-02-20 16:42:11,718 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:42:11,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:11,719 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:11,719 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387091291] [2022-02-20 16:42:11,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387091291] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:11,720 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:11,720 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:42:11,721 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268178123] [2022-02-20 16:42:11,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:11,725 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:42:11,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:11,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:11,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:11,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:42:11,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:11,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:42:11,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:42:11,796 INFO L87 Difference]: Start difference. First operand has 96 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 89 states have internal predecessors, (145), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:27,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:27,123 INFO L93 Difference]: Finished difference Result 190 states and 308 transitions. [2022-02-20 16:42:27,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:42:27,123 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:42:27,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:27,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 308 transitions. [2022-02-20 16:42:27,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:27,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 308 transitions. [2022-02-20 16:42:27,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 308 transitions. [2022-02-20 16:42:31,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 308 edges. 308 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:31,032 INFO L225 Difference]: With dead ends: 190 [2022-02-20 16:42:31,032 INFO L226 Difference]: Without dead ends: 92 [2022-02-20 16:42:31,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:42:31,045 INFO L933 BasicCegarLoop]: 136 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, 136 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:42:31,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:42:31,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-02-20 16:42:31,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-02-20 16:42:31,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:31,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:42:31,098 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:42:31,102 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:42:31,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:31,142 INFO L93 Difference]: Finished difference Result 92 states and 131 transitions. [2022-02-20 16:42:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2022-02-20 16:42:31,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:31,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:31,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 92 states. [2022-02-20 16:42:31,147 INFO L87 Difference]: Start difference. First operand has 92 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 92 states. [2022-02-20 16:42:31,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:31,157 INFO L93 Difference]: Finished difference Result 92 states and 131 transitions. [2022-02-20 16:42:31,157 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2022-02-20 16:42:31,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:31,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:31,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:31,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:31,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 16:42:31,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2022-02-20 16:42:31,181 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 14 [2022-02-20 16:42:31,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:31,181 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2022-02-20 16:42:31,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:31,182 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2022-02-20 16:42:31,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:42:31,182 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:31,182 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:31,226 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:42:31,383 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:42:31,384 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:31,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:31,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1209401097, now seen corresponding path program 1 times [2022-02-20 16:42:31,385 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:31,385 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749653428] [2022-02-20 16:42:31,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:31,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:31,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:31,387 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:42:31,426 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:42:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:32,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-20 16:42:32,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:32,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:32,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 16:42:34,136 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-02-20 16:42:34,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 35 [2022-02-20 16:42:35,190 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 16:42:35,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 26 [2022-02-20 16:42:36,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {652#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~#atanhi_atan~0.base, ~#atanhi_atan~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(16bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.46364760399)), ~#atanhi_atan~0.base, ~#atanhi_atan~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.78539812565)), ~#atanhi_atan~0.base, ~bvadd32(4bv32, ~#atanhi_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.98279368877)), ~#atanhi_atan~0.base, ~bvadd32(8bv32, ~#atanhi_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.5707962513)), ~#atanhi_atan~0.base, ~bvadd32(12bv32, ~#atanhi_atan~0.offset), 4bv32);~#atanlo_atan~0.base, ~#atanlo_atan~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(16bv32, 5bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 5.012158244E-9)), ~#atanlo_atan~0.base, ~#atanlo_atan~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.7748947079E-8)), ~#atanlo_atan~0.base, ~bvadd32(4bv32, ~#atanlo_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.447321717E-8)), ~#atanlo_atan~0.base, ~bvadd32(8bv32, ~#atanlo_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.5497894159E-8)), ~#atanlo_atan~0.base, ~bvadd32(12bv32, ~#atanlo_atan~0.offset), 4bv32);~#aT_atan~0.base, ~#aT_atan~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(44bv32, 6bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.33333334327)), ~#aT_atan~0.base, ~#aT_atan~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.20000000298))), ~#aT_atan~0.base, ~bvadd32(4bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.14285714924)), ~#aT_atan~0.base, ~bvadd32(8bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.11111110449))), ~#aT_atan~0.base, ~bvadd32(12bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.090908870101)), ~#aT_atan~0.base, ~bvadd32(16bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.076918758452))), ~#aT_atan~0.base, ~bvadd32(20bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.066610731184)), ~#aT_atan~0.base, ~bvadd32(24bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.058335702866))), ~#aT_atan~0.base, ~bvadd32(28bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.049768779427)), ~#aT_atan~0.base, ~bvadd32(32bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.036531571299))), ~#aT_atan~0.base, ~bvadd32(36bv32, ~#aT_atan~0.offset), 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.016285819933)), ~#aT_atan~0.base, ~bvadd32(40bv32, ~#aT_atan~0.offset), 4bv32);~one_atan~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~huge_atan~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~pi_o_4~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.78539818525));~pi_o_2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.5707963705));~pi~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.141592741));~tiny_atan2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30));~zero_atan2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE());~pi_lo_atan2~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 8.7422776573E-8))); {652#true} is VALID [2022-02-20 16:42:36,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {652#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet40#1, main_#t~ret41#1, main_#t~ret42#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet40#1;havoc main_#t~nondet40#1;main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline_isfinite_float } true;isfinite_float_#in~x#1 := main_~x~0#1;havoc isfinite_float_#res#1;havoc isfinite_float_#t~mem39#1, isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset, isfinite_float_~x#1, isfinite_float_~ix~3#1;isfinite_float_~x#1 := isfinite_float_#in~x#1;havoc isfinite_float_~ix~3#1; {660#(and (= |ULTIMATE.start_isfinite_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 16:42:36,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {660#(and (= |ULTIMATE.start_isfinite_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} call isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(isfinite_float_~x#1, isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset, 4bv32);call isfinite_float_#t~mem39#1 := read~intINTTYPE4(isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset, 4bv32);isfinite_float_~ix~3#1 := isfinite_float_#t~mem39#1;havoc isfinite_float_#t~mem39#1;call ULTIMATE.dealloc(isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset);havoc isfinite_float_~#gf_u~5#1.base, isfinite_float_~#gf_u~5#1.offset; {664#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32)) |ULTIMATE.start_isfinite_float_~ix~3#1|) (= |ULTIMATE.start_main_~x~0#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 16:42:36,445 INFO L290 TraceCheckUtils]: 3: Hoare triple {664#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32)) |ULTIMATE.start_isfinite_float_~ix~3#1|) (= |ULTIMATE.start_main_~x~0#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} goto; {664#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32)) |ULTIMATE.start_isfinite_float_~ix~3#1|) (= |ULTIMATE.start_main_~x~0#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 16:42:36,447 INFO L290 TraceCheckUtils]: 4: Hoare triple {664#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32)) |ULTIMATE.start_isfinite_float_~ix~3#1|) (= |ULTIMATE.start_main_~x~0#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} isfinite_float_~ix~3#1 := ~bvand32(2147483647bv32, isfinite_float_~ix~3#1);isfinite_float_#res#1 := (if ~bvslt32(isfinite_float_~ix~3#1, 2139095040bv32) then 1bv32 else 0bv32); {671#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6| (_ BitVec 32))) (and (or (and (not (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) (_ bv2139095040 32))) (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv0 32))) (and (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv1 32)))) (= |ULTIMATE.start_main_~x~0#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 16:42:36,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {671#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6| (_ BitVec 32))) (and (or (and (not (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) (_ bv2139095040 32))) (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv0 32))) (and (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv1 32)))) (= |ULTIMATE.start_main_~x~0#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} main_#t~ret41#1 := isfinite_float_#res#1;assume { :end_inline_isfinite_float } true; {675#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~x~0#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))))) (or (and (= |ULTIMATE.start_main_#t~ret41#1| (_ bv0 32)) (not (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)))) (and (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= |ULTIMATE.start_main_#t~ret41#1| (_ bv1 32)))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 16:42:36,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {675#(and (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6| (_ BitVec 32))) (and (= |ULTIMATE.start_main_~x~0#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))))) (or (and (= |ULTIMATE.start_main_#t~ret41#1| (_ bv0 32)) (not (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)))) (and (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= |ULTIMATE.start_main_#t~ret41#1| (_ bv1 32)))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|)))} assume 0bv32 != main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline___ieee754_atan2f } true;__ieee754_atan2f_#in~y#1, __ieee754_atan2f_#in~x#1 := main_~y~0#1, main_~x~0#1;havoc __ieee754_atan2f_#res#1;havoc __ieee754_atan2f_#t~mem26#1, __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset, __ieee754_atan2f_#t~mem27#1, __ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset, __ieee754_atan2f_#t~ret28#1, __ieee754_atan2f_#t~switch29#1, __ieee754_atan2f_#t~ite30#1, __ieee754_atan2f_#t~switch31#1, __ieee754_atan2f_#t~switch32#1, __ieee754_atan2f_#t~ite33#1, __ieee754_atan2f_#t~ret34#1, __ieee754_atan2f_#t~ret35#1, __ieee754_atan2f_#t~switch36#1, __ieee754_atan2f_#t~mem37#1, __ieee754_atan2f_~#gf_u~4#1.base, __ieee754_atan2f_~#gf_u~4#1.offset, __ieee754_atan2f_#t~mem38#1, __ieee754_atan2f_~#sf_u~1#1.base, __ieee754_atan2f_~#sf_u~1#1.offset, __ieee754_atan2f_~zh~0#1, __ieee754_atan2f_~y#1, __ieee754_atan2f_~x#1, __ieee754_atan2f_~z~1#1, __ieee754_atan2f_~k~0#1, __ieee754_atan2f_~m~0#1, __ieee754_atan2f_~hx~1#1, __ieee754_atan2f_~hy~0#1, __ieee754_atan2f_~ix~2#1, __ieee754_atan2f_~iy~0#1;__ieee754_atan2f_~y#1 := __ieee754_atan2f_#in~y#1;__ieee754_atan2f_~x#1 := __ieee754_atan2f_#in~x#1;havoc __ieee754_atan2f_~z~1#1;havoc __ieee754_atan2f_~k~0#1;havoc __ieee754_atan2f_~m~0#1;havoc __ieee754_atan2f_~hx~1#1;havoc __ieee754_atan2f_~hy~0#1;havoc __ieee754_atan2f_~ix~2#1;havoc __ieee754_atan2f_~iy~0#1; {679#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= |ULTIMATE.start___ieee754_atan2f_~x#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))))))))} is VALID [2022-02-20 16:42:36,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {679#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|)) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= |ULTIMATE.start___ieee754_atan2f_~x#1| (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))))))))} call __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_atan2f_~x#1, __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset, 4bv32);call __ieee754_atan2f_#t~mem26#1 := read~intINTTYPE4(__ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset, 4bv32);__ieee754_atan2f_~hx~1#1 := __ieee754_atan2f_#t~mem26#1;havoc __ieee754_atan2f_#t~mem26#1;call ULTIMATE.dealloc(__ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset);havoc __ieee754_atan2f_~#gf_u~2#1.base, __ieee754_atan2f_~#gf_u~2#1.offset; {683#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|)) (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)))) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|))))} is VALID [2022-02-20 16:42:36,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {683#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|)) (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)))) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|))))} goto; {683#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|)) (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)))) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|))))} is VALID [2022-02-20 16:42:36,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {683#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|)) (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)))) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))))) (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|))))} __ieee754_atan2f_~ix~2#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hx~1#1); {690#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|)) (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)))) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))))) (= (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|))))} is VALID [2022-02-20 16:42:36,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {690#(and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|)) (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6| (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)))) (fp ((_ extract 31 31) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 30 23) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) ((_ extract 22 0) (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))))) (= (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32))) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|))))} call __ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_atan2f_~y#1, __ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset, 4bv32);call __ieee754_atan2f_#t~mem27#1 := read~intINTTYPE4(__ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset, 4bv32);__ieee754_atan2f_~hy~0#1 := __ieee754_atan2f_#t~mem27#1;havoc __ieee754_atan2f_#t~mem27#1;call ULTIMATE.dealloc(__ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset);havoc __ieee754_atan2f_~#gf_u~3#1.base, __ieee754_atan2f_~#gf_u~3#1.offset; {694#(and (exists ((v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_3) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_2) (_ bv2139095040 32)))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)))))} is VALID [2022-02-20 16:42:36,523 INFO L290 TraceCheckUtils]: 11: Hoare triple {694#(and (exists ((v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_3) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_2) (_ bv2139095040 32)))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)))))} goto; {694#(and (exists ((v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_3) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_2) (_ bv2139095040 32)))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)))))} is VALID [2022-02-20 16:42:36,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {694#(and (exists ((v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_3) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_2) (_ bv2139095040 32)))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)))))} __ieee754_atan2f_~iy~0#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hy~0#1); {701#(and (exists ((v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_3) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_2) (_ bv2139095040 32)))) (exists ((|ULTIMATE.start___ieee754_atan2f_~hy~0#1| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|))) (= |ULTIMATE.start___ieee754_atan2f_~iy~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)))))} is VALID [2022-02-20 16:42:36,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {701#(and (exists ((v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_3) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (= (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)) (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_2) (_ bv2139095040 32)))) (exists ((|ULTIMATE.start___ieee754_atan2f_~hy~0#1| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|))) (= |ULTIMATE.start___ieee754_atan2f_~iy~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)))))} assume ~bvsgt32(__ieee754_atan2f_~ix~2#1, 2139095040bv32) || ~bvsgt32(__ieee754_atan2f_~iy~0#1, 2139095040bv32);__ieee754_atan2f_#res#1 := ~fp.add~FLOAT(currentRoundingMode, __ieee754_atan2f_~x#1, __ieee754_atan2f_~y#1); {653#false} is VALID [2022-02-20 16:42:36,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#false} main_#t~ret42#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret42#1;havoc main_#t~ret42#1; {653#false} is VALID [2022-02-20 16:42:36,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {653#false} assume !~fp.eq~FLOAT(main_~res~0#1, ~fp.neg~FLOAT(~pi_o_2~0)); {653#false} is VALID [2022-02-20 16:42:36,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {653#false} assume !false; {653#false} is VALID [2022-02-20 16:42:36,540 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:42:36,540 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:36,541 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:36,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749653428] [2022-02-20 16:42:36,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749653428] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:36,541 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:36,541 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 16:42:36,541 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971419744] [2022-02-20 16:42:36,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:36,542 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 16:42:36,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:36,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:36,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:36,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 16:42:36,752 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:36,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 16:42:36,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:42:36,753 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)