./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0661b.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_0661b.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 bb7f3afec9a7b0bf288c62eb95c6c2b13307d1b9b48696daca584c7566ec9aef --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:40:29,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:40:29,370 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:40:29,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:40:29,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:40:29,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:40:29,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:40:29,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:40:29,413 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:40:29,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:40:29,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:40:29,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:40:29,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:40:29,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:40:29,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:40:29,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:40:29,429 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:40:29,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:40:29,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:40:29,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:40:29,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:40:29,440 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:40:29,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:40:29,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:40:29,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:40:29,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:40:29,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:40:29,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:40:29,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:40:29,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:40:29,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:40:29,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:40:29,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:40:29,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:40:29,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:40:29,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:40:29,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:40:29,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:40:29,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:40:29,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:40:29,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:40:29,454 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:40:29,479 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:40:29,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:40:29,480 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:40:29,480 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:40:29,481 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:40:29,481 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:40:29,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:40:29,482 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:40:29,482 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:40:29,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:40:29,482 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:40:29,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:40:29,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:40:29,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:40:29,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:40:29,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:40:29,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:40:29,484 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:40:29,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:40:29,484 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:40:29,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:40:29,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:40:29,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:40:29,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:40:29,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:40:29,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:40:29,485 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:40:29,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:40:29,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:40:29,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:40:29,486 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:40:29,486 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:40:29,486 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:40:29,487 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 -> bb7f3afec9a7b0bf288c62eb95c6c2b13307d1b9b48696daca584c7566ec9aef [2022-02-20 16:40:29,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:40:29,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:40:29,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:40:29,733 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:40:29,733 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:40:29,734 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0661b.c [2022-02-20 16:40:29,791 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/119082ac3/875c5aa1828b4ca4b9e90921397cfa3e/FLAG9afbd0732 [2022-02-20 16:40:30,160 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:40:30,161 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0661b.c [2022-02-20 16:40:30,169 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/119082ac3/875c5aa1828b4ca4b9e90921397cfa3e/FLAG9afbd0732 [2022-02-20 16:40:30,179 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/119082ac3/875c5aa1828b4ca4b9e90921397cfa3e [2022-02-20 16:40:30,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:40:30,182 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:40:30,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:40:30,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:40:30,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:40:30,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:40:30" (1/1) ... [2022-02-20 16:40:30,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51767e5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:30, skipping insertion in model container [2022-02-20 16:40:30,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:40:30" (1/1) ... [2022-02-20 16:40:30,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:40:30,228 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:40:30,455 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_0661b.c[5269,5282] [2022-02-20 16:40:30,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:40:30,483 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:40:30,561 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_0661b.c[5269,5282] [2022-02-20 16:40:30,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:40:30,577 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:40:30,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:30 WrapperNode [2022-02-20 16:40:30,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:40:30,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:40:30,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:40:30,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:40:30,583 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:40:30" (1/1) ... [2022-02-20 16:40:30,602 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:40:30" (1/1) ... [2022-02-20 16:40:30,640 INFO L137 Inliner]: procedures = 19, calls = 79, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 254 [2022-02-20 16:40:30,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:40:30,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:40:30,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:40:30,642 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:40:30,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:30" (1/1) ... [2022-02-20 16:40:30,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:30" (1/1) ... [2022-02-20 16:40:30,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:30" (1/1) ... [2022-02-20 16:40:30,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:30" (1/1) ... [2022-02-20 16:40:30,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:30" (1/1) ... [2022-02-20 16:40:30,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:30" (1/1) ... [2022-02-20 16:40:30,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:30" (1/1) ... [2022-02-20 16:40:30,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:40:30,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:40:30,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:40:30,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:40:30,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:30" (1/1) ... [2022-02-20 16:40:30,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:40:30,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:40:30,723 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:40:30,731 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:40:30,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:40:30,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:40:30,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:40:30,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:40:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:40:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:40:30,760 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-02-20 16:40:30,761 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-02-20 16:40:30,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:40:30,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:40:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:40:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:40:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-02-20 16:40:30,763 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-02-20 16:40:30,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:40:30,863 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:40:30,864 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:40:31,374 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:40:31,385 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:40:31,389 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 16:40:31,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:40:31 BoogieIcfgContainer [2022-02-20 16:40:31,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:40:31,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:40:31,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:40:31,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:40:31,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:40:30" (1/3) ... [2022-02-20 16:40:31,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11041f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:40:31, skipping insertion in model container [2022-02-20 16:40:31,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:30" (2/3) ... [2022-02-20 16:40:31,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11041f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:40:31, skipping insertion in model container [2022-02-20 16:40:31,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:40:31" (3/3) ... [2022-02-20 16:40:31,403 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0661b.c [2022-02-20 16:40:31,410 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:40:31,410 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:40:31,456 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:40:31,468 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:40:31,469 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:40:31,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 97 states have (on average 1.731958762886598) internal successors, (168), 98 states have internal predecessors, (168), 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:40:31,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:40:31,491 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:40:31,492 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:40:31,493 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:40:31,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:40:31,498 INFO L85 PathProgramCache]: Analyzing trace with hash -498009200, now seen corresponding path program 1 times [2022-02-20 16:40:31,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:40:31,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120152098] [2022-02-20 16:40:31,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:40:31,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:40:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:31,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {108#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); {108#true} is VALID [2022-02-20 16:40:31,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {108#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet43#1;havoc main_#t~nondet43#1;main_~y~0#1 := 0.0; {108#true} is VALID [2022-02-20 16:40:31,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {108#true} assume ~someBinaryFLOATComparisonOperation(main_~x~0#1, 0.0);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; {108#true} is VALID [2022-02-20 16:40:31,680 INFO L290 TraceCheckUtils]: 3: Hoare triple {108#true} assume !true; {109#false} is VALID [2022-02-20 16:40:31,680 INFO L290 TraceCheckUtils]: 4: Hoare triple {109#false} assume 0 == __ieee754_atan2f_~hx~1#1;__ieee754_atan2f_~ix~2#1 := 0; {109#false} is VALID [2022-02-20 16:40:31,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {109#false} assume !true; {109#false} is VALID [2022-02-20 16:40:31,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {109#false} assume 0 == __ieee754_atan2f_~hy~0#1;__ieee754_atan2f_~iy~0#1 := 0; {109#false} is VALID [2022-02-20 16:40:31,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {109#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); {109#false} is VALID [2022-02-20 16:40:31,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {109#false} main_#t~ret44#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret44#1;havoc main_#t~ret44#1; {109#false} is VALID [2022-02-20 16:40:31,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {109#false} assume ~someBinaryFLOATComparisonOperation(main_~res~0#1, 0.0); {109#false} is VALID [2022-02-20 16:40:31,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {109#false} assume !false; {109#false} is VALID [2022-02-20 16:40:31,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:40:31,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:40:31,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120152098] [2022-02-20 16:40:31,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120152098] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:40:31,686 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:40:31,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:40:31,688 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835114250] [2022-02-20 16:40:31,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:40:31,694 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:40:31,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:40:31,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:31,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:31,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:40:31,713 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:40:31,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:40:31,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:40:31,744 INFO L87 Difference]: Start difference. First operand has 105 states, 97 states have (on average 1.731958762886598) internal successors, (168), 98 states have internal predecessors, (168), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:31,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:31,903 INFO L93 Difference]: Finished difference Result 207 states and 352 transitions. [2022-02-20 16:40:31,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:40:31,903 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:40:31,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:40:31,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:31,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 352 transitions. [2022-02-20 16:40:31,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:31,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 352 transitions. [2022-02-20 16:40:31,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 352 transitions. [2022-02-20 16:40:32,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:32,267 INFO L225 Difference]: With dead ends: 207 [2022-02-20 16:40:32,267 INFO L226 Difference]: Without dead ends: 101 [2022-02-20 16:40:32,271 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:40:32,274 INFO L933 BasicCegarLoop]: 155 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, 155 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:40:32,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:40:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-20 16:40:32,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-02-20 16:40:32,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:40:32,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 94 states have internal predecessors, (142), 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:40:32,310 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 94 states have internal predecessors, (142), 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:40:32,311 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 94 states have internal predecessors, (142), 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:40:32,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:32,317 INFO L93 Difference]: Finished difference Result 101 states and 150 transitions. [2022-02-20 16:40:32,318 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2022-02-20 16:40:32,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:32,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:32,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 94 states have internal predecessors, (142), 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 101 states. [2022-02-20 16:40:32,320 INFO L87 Difference]: Start difference. First operand has 101 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 94 states have internal predecessors, (142), 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 101 states. [2022-02-20 16:40:32,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:32,326 INFO L93 Difference]: Finished difference Result 101 states and 150 transitions. [2022-02-20 16:40:32,326 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2022-02-20 16:40:32,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:32,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:32,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:40:32,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:40:32,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 94 states have internal predecessors, (142), 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:40:32,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 150 transitions. [2022-02-20 16:40:32,334 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 150 transitions. Word has length 11 [2022-02-20 16:40:32,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:40:32,334 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 150 transitions. [2022-02-20 16:40:32,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:32,335 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 150 transitions. [2022-02-20 16:40:32,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:40:32,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:40:32,336 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:40:32,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:40:32,336 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:40:32,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:40:32,337 INFO L85 PathProgramCache]: Analyzing trace with hash -148901144, now seen corresponding path program 1 times [2022-02-20 16:40:32,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:40:32,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164322392] [2022-02-20 16:40:32,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:40:32,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:40:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:32,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {657#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); {657#true} is VALID [2022-02-20 16:40:32,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {657#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet43#1, main_#t~ret44#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet43#1;havoc main_#t~nondet43#1;main_~y~0#1 := 0.0; {657#true} is VALID [2022-02-20 16:40:32,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {657#true} assume ~someBinaryFLOATComparisonOperation(main_~x~0#1, 0.0);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; {657#true} is VALID [2022-02-20 16:40:32,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {657#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; {657#true} is VALID [2022-02-20 16:40:32,447 INFO L290 TraceCheckUtils]: 4: Hoare triple {657#true} goto; {657#true} is VALID [2022-02-20 16:40:32,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {657#true} assume 0 == __ieee754_atan2f_~hx~1#1;__ieee754_atan2f_~ix~2#1 := 0; {659#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} is VALID [2022-02-20 16:40:32,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {659#(= |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; {659#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} is VALID [2022-02-20 16:40:32,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} goto; {659#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} is VALID [2022-02-20 16:40:32,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#(= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0)} assume 0 == __ieee754_atan2f_~hy~0#1;__ieee754_atan2f_~iy~0#1 := 0; {660#(and (= |ULTIMATE.start___ieee754_atan2f_~iy~0#1| 0) (= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| 0))} is VALID [2022-02-20 16:40:32,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {660#(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); {658#false} is VALID [2022-02-20 16:40:32,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {658#false} main_#t~ret44#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret44#1;havoc main_#t~ret44#1; {658#false} is VALID [2022-02-20 16:40:32,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {658#false} assume ~someBinaryFLOATComparisonOperation(main_~res~0#1, 0.0); {658#false} is VALID [2022-02-20 16:40:32,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {658#false} assume !false; {658#false} is VALID [2022-02-20 16:40:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:40:32,451 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:40:32,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164322392] [2022-02-20 16:40:32,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164322392] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:40:32,451 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:40:32,451 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:40:32,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485603037] [2022-02-20 16:40:32,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:40:32,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:40:32,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:40:32,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:32,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:32,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:40:32,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:40:32,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:40:32,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:40:32,466 INFO L87 Difference]: Start difference. First operand 101 states and 150 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:32,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:32,701 INFO L93 Difference]: Finished difference Result 214 states and 319 transitions. [2022-02-20 16:40:32,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:40:32,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:40:32,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:40:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:32,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 319 transitions. [2022-02-20 16:40:32,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:32,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 319 transitions. [2022-02-20 16:40:32,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 319 transitions. [2022-02-20 16:40:32,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 319 edges. 319 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:32,956 INFO L225 Difference]: With dead ends: 214 [2022-02-20 16:40:32,957 INFO L226 Difference]: Without dead ends: 143 [2022-02-20 16:40:32,957 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:40:32,958 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 80 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:40:32,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 318 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:40:32,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-02-20 16:40:32,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 128. [2022-02-20 16:40:32,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:40:32,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 128 states, 121 states have (on average 1.5454545454545454) internal successors, (187), 121 states have internal predecessors, (187), 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:40:32,969 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 128 states, 121 states have (on average 1.5454545454545454) internal successors, (187), 121 states have internal predecessors, (187), 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:40:32,969 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 128 states, 121 states have (on average 1.5454545454545454) internal successors, (187), 121 states have internal predecessors, (187), 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:40:32,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:32,975 INFO L93 Difference]: Finished difference Result 143 states and 211 transitions. [2022-02-20 16:40:32,975 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 211 transitions. [2022-02-20 16:40:32,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:32,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:32,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 121 states have (on average 1.5454545454545454) internal successors, (187), 121 states have internal predecessors, (187), 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 143 states. [2022-02-20 16:40:32,977 INFO L87 Difference]: Start difference. First operand has 128 states, 121 states have (on average 1.5454545454545454) internal successors, (187), 121 states have internal predecessors, (187), 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 143 states. [2022-02-20 16:40:32,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:32,983 INFO L93 Difference]: Finished difference Result 143 states and 211 transitions. [2022-02-20 16:40:32,983 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 211 transitions. [2022-02-20 16:40:32,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:32,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:32,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:40:32,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:40:32,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 121 states have (on average 1.5454545454545454) internal successors, (187), 121 states have internal predecessors, (187), 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:40:32,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 195 transitions. [2022-02-20 16:40:32,990 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 195 transitions. Word has length 13 [2022-02-20 16:40:32,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:40:32,991 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 195 transitions. [2022-02-20 16:40:32,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:32,991 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 195 transitions. [2022-02-20 16:40:32,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:40:32,992 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:40:32,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:40:32,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:40:32,992 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:40:32,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:40:32,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1534369806, now seen corresponding path program 1 times [2022-02-20 16:40:32,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:40:32,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635268178] [2022-02-20 16:40:32,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:40:32,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:40:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:40:33,041 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:40:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:40:33,088 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:40:33,089 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:40:33,090 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:40:33,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:40:33,094 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:40:33,096 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:40:33,123 WARN L170 areAnnotationChecker]: fabs_floatENTRY has no Hoare annotation [2022-02-20 16:40:33,124 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:40:33,124 WARN L170 areAnnotationChecker]: atan_floatENTRY has no Hoare annotation [2022-02-20 16:40:33,124 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 16:40:33,124 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 16:40:33,124 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:40:33,124 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-02-20 16:40:33,124 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-02-20 16:40:33,124 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:40:33,125 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:40:33,125 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:40:33,125 WARN L170 areAnnotationChecker]: L21-1 has no Hoare annotation [2022-02-20 16:40:33,125 WARN L170 areAnnotationChecker]: L226 has no Hoare annotation [2022-02-20 16:40:33,125 WARN L170 areAnnotationChecker]: L226 has no Hoare annotation [2022-02-20 16:40:33,125 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-02-20 16:40:33,125 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-02-20 16:40:33,126 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2022-02-20 16:40:33,126 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2022-02-20 16:40:33,126 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 16:40:33,126 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 16:40:33,126 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:40:33,126 WARN L170 areAnnotationChecker]: L124-2 has no Hoare annotation [2022-02-20 16:40:33,126 WARN L170 areAnnotationChecker]: L124-2 has no Hoare annotation [2022-02-20 16:40:33,126 WARN L170 areAnnotationChecker]: L226-2 has no Hoare annotation [2022-02-20 16:40:33,127 WARN L170 areAnnotationChecker]: L62-7 has no Hoare annotation [2022-02-20 16:40:33,127 WARN L170 areAnnotationChecker]: L62-7 has no Hoare annotation [2022-02-20 16:40:33,127 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 16:40:33,127 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 16:40:33,127 WARN L170 areAnnotationChecker]: fabs_floatFINAL has no Hoare annotation [2022-02-20 16:40:33,127 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-02-20 16:40:33,127 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-02-20 16:40:33,128 WARN L170 areAnnotationChecker]: L124-3 has no Hoare annotation [2022-02-20 16:40:33,128 WARN L170 areAnnotationChecker]: L124-3 has no Hoare annotation [2022-02-20 16:40:33,128 WARN L170 areAnnotationChecker]: L238 has no Hoare annotation [2022-02-20 16:40:33,128 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 16:40:33,128 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 16:40:33,128 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 16:40:33,128 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 16:40:33,129 WARN L170 areAnnotationChecker]: L62-3 has no Hoare annotation [2022-02-20 16:40:33,129 WARN L170 areAnnotationChecker]: L62-3 has no Hoare annotation [2022-02-20 16:40:33,129 WARN L170 areAnnotationChecker]: fabs_floatEXIT has no Hoare annotation [2022-02-20 16:40:33,129 WARN L170 areAnnotationChecker]: fabs_floatEXIT has no Hoare annotation [2022-02-20 16:40:33,129 WARN L170 areAnnotationChecker]: L130-1 has no Hoare annotation [2022-02-20 16:40:33,129 WARN L170 areAnnotationChecker]: L130-1 has no Hoare annotation [2022-02-20 16:40:33,129 WARN L170 areAnnotationChecker]: L129-1 has no Hoare annotation [2022-02-20 16:40:33,129 WARN L170 areAnnotationChecker]: L129-1 has no Hoare annotation [2022-02-20 16:40:33,129 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:40:33,129 WARN L170 areAnnotationChecker]: atan_floatFINAL has no Hoare annotation [2022-02-20 16:40:33,130 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:40:33,130 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:40:33,130 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:40:33,130 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:40:33,130 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:40:33,130 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:40:33,130 WARN L170 areAnnotationChecker]: L62-5 has no Hoare annotation [2022-02-20 16:40:33,130 WARN L170 areAnnotationChecker]: L62-5 has no Hoare annotation [2022-02-20 16:40:33,130 WARN L170 areAnnotationChecker]: L192-1 has no Hoare annotation [2022-02-20 16:40:33,130 WARN L170 areAnnotationChecker]: L192-1 has no Hoare annotation [2022-02-20 16:40:33,130 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:40:33,130 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2022-02-20 16:40:33,130 WARN L170 areAnnotationChecker]: L130 has no Hoare annotation [2022-02-20 16:40:33,130 WARN L170 areAnnotationChecker]: L130-2 has no Hoare annotation [2022-02-20 16:40:33,130 WARN L170 areAnnotationChecker]: L130-2 has no Hoare annotation [2022-02-20 16:40:33,131 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-02-20 16:40:33,131 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-02-20 16:40:33,131 WARN L170 areAnnotationChecker]: atan_floatEXIT has no Hoare annotation [2022-02-20 16:40:33,131 WARN L170 areAnnotationChecker]: atan_floatEXIT has no Hoare annotation [2022-02-20 16:40:33,131 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:40:33,131 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:40:33,131 WARN L170 areAnnotationChecker]: L72-2 has no Hoare annotation [2022-02-20 16:40:33,131 WARN L170 areAnnotationChecker]: L192-2 has no Hoare annotation [2022-02-20 16:40:33,131 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:40:33,131 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:40:33,132 WARN L170 areAnnotationChecker]: L135-7 has no Hoare annotation [2022-02-20 16:40:33,132 WARN L170 areAnnotationChecker]: L135-7 has no Hoare annotation [2022-02-20 16:40:33,132 WARN L170 areAnnotationChecker]: L135-1 has no Hoare annotation [2022-02-20 16:40:33,132 WARN L170 areAnnotationChecker]: L135-1 has no Hoare annotation [2022-02-20 16:40:33,132 WARN L170 areAnnotationChecker]: L129-5 has no Hoare annotation [2022-02-20 16:40:33,132 WARN L170 areAnnotationChecker]: L129-5 has no Hoare annotation [2022-02-20 16:40:33,132 WARN L170 areAnnotationChecker]: L139-1 has no Hoare annotation [2022-02-20 16:40:33,133 WARN L170 areAnnotationChecker]: L88-2 has no Hoare annotation [2022-02-20 16:40:33,133 WARN L170 areAnnotationChecker]: L189-2 has no Hoare annotation [2022-02-20 16:40:33,133 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:40:33,133 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:40:33,133 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:40:33,133 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:40:33,133 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-02-20 16:40:33,133 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2022-02-20 16:40:33,134 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2022-02-20 16:40:33,134 WARN L170 areAnnotationChecker]: L135-3 has no Hoare annotation [2022-02-20 16:40:33,134 WARN L170 areAnnotationChecker]: L135-3 has no Hoare annotation [2022-02-20 16:40:33,134 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:40:33,134 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:40:33,134 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-02-20 16:40:33,134 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-02-20 16:40:33,135 WARN L170 areAnnotationChecker]: L232 has no Hoare annotation [2022-02-20 16:40:33,135 WARN L170 areAnnotationChecker]: L232 has no Hoare annotation [2022-02-20 16:40:33,135 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2022-02-20 16:40:33,135 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2022-02-20 16:40:33,135 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2022-02-20 16:40:33,135 WARN L170 areAnnotationChecker]: L140 has no Hoare annotation [2022-02-20 16:40:33,135 WARN L170 areAnnotationChecker]: L135-5 has no Hoare annotation [2022-02-20 16:40:33,135 WARN L170 areAnnotationChecker]: L135-5 has no Hoare annotation [2022-02-20 16:40:33,136 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 16:40:33,136 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 16:40:33,136 WARN L170 areAnnotationChecker]: L196 has no Hoare annotation [2022-02-20 16:40:33,136 WARN L170 areAnnotationChecker]: L196 has no Hoare annotation [2022-02-20 16:40:33,136 WARN L170 areAnnotationChecker]: L233 has no Hoare annotation [2022-02-20 16:40:33,136 WARN L170 areAnnotationChecker]: L233 has no Hoare annotation [2022-02-20 16:40:33,136 WARN L170 areAnnotationChecker]: L140-8 has no Hoare annotation [2022-02-20 16:40:33,137 WARN L170 areAnnotationChecker]: L140-8 has no Hoare annotation [2022-02-20 16:40:33,137 WARN L170 areAnnotationChecker]: L140-2 has no Hoare annotation [2022-02-20 16:40:33,137 WARN L170 areAnnotationChecker]: L140-2 has no Hoare annotation [2022-02-20 16:40:33,137 WARN L170 areAnnotationChecker]: L113-2 has no Hoare annotation [2022-02-20 16:40:33,137 WARN L170 areAnnotationChecker]: L198-2 has no Hoare annotation [2022-02-20 16:40:33,137 WARN L170 areAnnotationChecker]: L198-2 has no Hoare annotation [2022-02-20 16:40:33,137 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2022-02-20 16:40:33,137 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2022-02-20 16:40:33,138 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2022-02-20 16:40:33,138 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2022-02-20 16:40:33,138 WARN L170 areAnnotationChecker]: L142-1 has no Hoare annotation [2022-02-20 16:40:33,138 WARN L170 areAnnotationChecker]: L142-1 has no Hoare annotation [2022-02-20 16:40:33,138 WARN L170 areAnnotationChecker]: L140-4 has no Hoare annotation [2022-02-20 16:40:33,138 WARN L170 areAnnotationChecker]: L140-4 has no Hoare annotation [2022-02-20 16:40:33,138 WARN L170 areAnnotationChecker]: L198-1 has no Hoare annotation [2022-02-20 16:40:33,138 WARN L170 areAnnotationChecker]: L198-1 has no Hoare annotation [2022-02-20 16:40:33,139 WARN L170 areAnnotationChecker]: L203-1 has no Hoare annotation [2022-02-20 16:40:33,139 WARN L170 areAnnotationChecker]: L203-1 has no Hoare annotation [2022-02-20 16:40:33,139 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-02-20 16:40:33,139 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2022-02-20 16:40:33,139 WARN L170 areAnnotationChecker]: L144-2 has no Hoare annotation [2022-02-20 16:40:33,139 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-02-20 16:40:33,139 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2022-02-20 16:40:33,140 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-02-20 16:40:33,140 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-02-20 16:40:33,140 WARN L170 areAnnotationChecker]: L140-6 has no Hoare annotation [2022-02-20 16:40:33,140 WARN L170 areAnnotationChecker]: L140-6 has no Hoare annotation [2022-02-20 16:40:33,140 WARN L170 areAnnotationChecker]: L203 has no Hoare annotation [2022-02-20 16:40:33,140 WARN L170 areAnnotationChecker]: L203 has no Hoare annotation [2022-02-20 16:40:33,140 WARN L170 areAnnotationChecker]: L203-2 has no Hoare annotation [2022-02-20 16:40:33,140 WARN L170 areAnnotationChecker]: L193 has no Hoare annotation [2022-02-20 16:40:33,141 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-02-20 16:40:33,141 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-02-20 16:40:33,141 WARN L170 areAnnotationChecker]: L155-2 has no Hoare annotation [2022-02-20 16:40:33,141 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2022-02-20 16:40:33,141 WARN L170 areAnnotationChecker]: L158 has no Hoare annotation [2022-02-20 16:40:33,141 WARN L170 areAnnotationChecker]: L157-1 has no Hoare annotation [2022-02-20 16:40:33,141 WARN L170 areAnnotationChecker]: L157-1 has no Hoare annotation [2022-02-20 16:40:33,142 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-02-20 16:40:33,142 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-02-20 16:40:33,142 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2022-02-20 16:40:33,142 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2022-02-20 16:40:33,142 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2022-02-20 16:40:33,142 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2022-02-20 16:40:33,142 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 16:40:33,143 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 16:40:33,143 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-02-20 16:40:33,143 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-02-20 16:40:33,143 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2022-02-20 16:40:33,143 WARN L170 areAnnotationChecker]: L149 has no Hoare annotation [2022-02-20 16:40:33,143 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-02-20 16:40:33,143 WARN L170 areAnnotationChecker]: L162 has no Hoare annotation [2022-02-20 16:40:33,144 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2022-02-20 16:40:33,144 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2022-02-20 16:40:33,144 WARN L170 areAnnotationChecker]: L184-2 has no Hoare annotation [2022-02-20 16:40:33,144 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-02-20 16:40:33,144 WARN L170 areAnnotationChecker]: L189 has no Hoare annotation [2022-02-20 16:40:33,144 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-02-20 16:40:33,144 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-02-20 16:40:33,144 WARN L170 areAnnotationChecker]: L164 has no Hoare annotation [2022-02-20 16:40:33,145 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-02-20 16:40:33,145 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-02-20 16:40:33,145 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2022-02-20 16:40:33,145 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2022-02-20 16:40:33,145 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2022-02-20 16:40:33,145 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2022-02-20 16:40:33,145 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-02-20 16:40:33,145 WARN L170 areAnnotationChecker]: L177 has no Hoare annotation [2022-02-20 16:40:33,146 WARN L170 areAnnotationChecker]: L159 has no Hoare annotation [2022-02-20 16:40:33,146 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2022-02-20 16:40:33,146 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:40:33,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:40:33 BoogieIcfgContainer [2022-02-20 16:40:33,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:40:33,147 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:40:33,148 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:40:33,148 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:40:33,148 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:40:31" (3/4) ... [2022-02-20 16:40:33,151 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:40:33,151 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:40:33,152 INFO L158 Benchmark]: Toolchain (without parser) took 2969.54ms. Allocated memory was 86.0MB in the beginning and 107.0MB in the end (delta: 21.0MB). Free memory was 47.6MB in the beginning and 38.3MB in the end (delta: 9.3MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2022-02-20 16:40:33,152 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 86.0MB. Free memory was 64.8MB in the beginning and 64.7MB in the end (delta: 71.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:40:33,153 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.92ms. Allocated memory was 86.0MB in the beginning and 107.0MB in the end (delta: 21.0MB). Free memory was 47.3MB in the beginning and 84.1MB in the end (delta: -36.7MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2022-02-20 16:40:33,153 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.06ms. Allocated memory is still 107.0MB. Free memory was 84.1MB in the beginning and 80.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:40:33,154 INFO L158 Benchmark]: Boogie Preprocessor took 35.45ms. Allocated memory is still 107.0MB. Free memory was 80.8MB in the beginning and 77.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:40:33,154 INFO L158 Benchmark]: RCFGBuilder took 714.44ms. Allocated memory is still 107.0MB. Free memory was 77.6MB in the beginning and 82.1MB in the end (delta: -4.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-02-20 16:40:33,155 INFO L158 Benchmark]: TraceAbstraction took 1753.52ms. Allocated memory is still 107.0MB. Free memory was 81.6MB in the beginning and 38.3MB in the end (delta: 43.4MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2022-02-20 16:40:33,161 INFO L158 Benchmark]: Witness Printer took 3.37ms. Allocated memory is still 107.0MB. Free memory is still 38.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:40:33,163 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 86.0MB. Free memory was 64.8MB in the beginning and 64.7MB in the end (delta: 71.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.92ms. Allocated memory was 86.0MB in the beginning and 107.0MB in the end (delta: 21.0MB). Free memory was 47.3MB in the beginning and 84.1MB in the end (delta: -36.7MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.06ms. Allocated memory is still 107.0MB. Free memory was 84.1MB in the beginning and 80.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.45ms. Allocated memory is still 107.0MB. Free memory was 80.8MB in the beginning and 77.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 714.44ms. Allocated memory is still 107.0MB. Free memory was 77.6MB in the beginning and 82.1MB in the end (delta: -4.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1753.52ms. Allocated memory is still 107.0MB. Free memory was 81.6MB in the beginning and 38.3MB in the end (delta: 43.4MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. * Witness Printer took 3.37ms. Allocated memory is still 107.0MB. Free memory is still 38.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 233]: 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 232, overapproximation of someUnaryDOUBLEoperation at line 44, 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] [L218] float x = __VERIFIER_nondet_float(); [L219] float y = 0.0f; 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, y=0, zero_atan2=0] [L226] COND TRUE x > 0.0f [L229] CALL, EXPR __ieee754_atan2f(y, x) [L121] float z; [L122] __int32_t k, m, hx, hy, ix, iy; VAL [\old(x)=1000000000000000000000000000002, \old(y)=0, 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=0, 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)=0, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=2147483647, ix=2147483646, ix = hx & 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=0, 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)=0, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=2147483647, hy=0, ix=2147483646, ix = hx & 0x7fffffff=2147483647, iy=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=0, zero_atan2=0] [L136] COND TRUE ((ix) > 0x7f800000L) || ((iy) > 0x7f800000L) [L137] return x + y; VAL [\old(x)=1000000000000000000000000000002, \old(y)=0, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=2147483647, hy=0, ix=2147483646, ix = hx & 0x7fffffff=2147483647, iy=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=0, zero_atan2=0] [L229] RET, EXPR __ieee754_atan2f(y, x) [L229] float res = __ieee754_atan2f(y, x); [L232] COND TRUE res != 0.0f VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, ix = hx & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000001, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=0, zero_atan2=0] [L233] reach_error() VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, ix = hx & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000001, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=0, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 473 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 158 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 315 mSDtfsCounter, 23 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=128occurred 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, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 34 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:40:33,201 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_0661b.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 bb7f3afec9a7b0bf288c62eb95c6c2b13307d1b9b48696daca584c7566ec9aef --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:40:35,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:40:35,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:40:35,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:40:35,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:40:35,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:40:35,052 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:40:35,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:40:35,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:40:35,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:40:35,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:40:35,064 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:40:35,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:40:35,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:40:35,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:40:35,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:40:35,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:40:35,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:40:35,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:40:35,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:40:35,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:40:35,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:40:35,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:40:35,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:40:35,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:40:35,101 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:40:35,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:40:35,103 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:40:35,104 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:40:35,104 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:40:35,105 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:40:35,105 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:40:35,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:40:35,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:40:35,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:40:35,109 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:40:35,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:40:35,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:40:35,110 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:40:35,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:40:35,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:40:35,112 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:40:35,146 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:40:35,147 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:40:35,148 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:40:35,148 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:40:35,149 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:40:35,149 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:40:35,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:40:35,150 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:40:35,151 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:40:35,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:40:35,152 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:40:35,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:40:35,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:40:35,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:40:35,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:40:35,153 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:40:35,153 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:40:35,153 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:40:35,153 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:40:35,153 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:40:35,154 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:40:35,154 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:40:35,154 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:40:35,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:40:35,155 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:40:35,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:40:35,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:40:35,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:40:35,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:40:35,156 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:40:35,156 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:40:35,156 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:40:35,156 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:40:35,157 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:40:35,157 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:40:35,157 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:40:35,157 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 -> bb7f3afec9a7b0bf288c62eb95c6c2b13307d1b9b48696daca584c7566ec9aef [2022-02-20 16:40:35,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:40:35,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:40:35,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:40:35,494 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:40:35,499 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:40:35,500 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0661b.c [2022-02-20 16:40:35,560 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53a6dd161/6043f97510f34232b6487670618c4cac/FLAGf22f53ed5 [2022-02-20 16:40:35,969 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:40:35,972 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0661b.c [2022-02-20 16:40:35,982 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53a6dd161/6043f97510f34232b6487670618c4cac/FLAGf22f53ed5 [2022-02-20 16:40:35,998 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53a6dd161/6043f97510f34232b6487670618c4cac [2022-02-20 16:40:36,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:40:36,002 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:40:36,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:40:36,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:40:36,008 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:40:36,009 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:40:35" (1/1) ... [2022-02-20 16:40:36,010 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e8338de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:36, skipping insertion in model container [2022-02-20 16:40:36,010 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:40:35" (1/1) ... [2022-02-20 16:40:36,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:40:36,044 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:40:36,286 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_0661b.c[5269,5282] [2022-02-20 16:40:36,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:40:36,323 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:40:36,392 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_0661b.c[5269,5282] [2022-02-20 16:40:36,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:40:36,416 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:40:36,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:36 WrapperNode [2022-02-20 16:40:36,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:40:36,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:40:36,417 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:40:36,418 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:40:36,423 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:40:36" (1/1) ... [2022-02-20 16:40:36,446 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:40:36" (1/1) ... [2022-02-20 16:40:36,490 INFO L137 Inliner]: procedures = 22, calls = 79, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 219 [2022-02-20 16:40:36,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:40:36,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:40:36,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:40:36,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:40:36,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:36" (1/1) ... [2022-02-20 16:40:36,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:36" (1/1) ... [2022-02-20 16:40:36,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:36" (1/1) ... [2022-02-20 16:40:36,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:36" (1/1) ... [2022-02-20 16:40:36,538 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:36" (1/1) ... [2022-02-20 16:40:36,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:36" (1/1) ... [2022-02-20 16:40:36,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:36" (1/1) ... [2022-02-20 16:40:36,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:40:36,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:40:36,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:40:36,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:40:36,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:36" (1/1) ... [2022-02-20 16:40:36,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:40:36,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:40:36,608 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:40:36,630 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:40:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:40:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:40:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:40:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:40:36,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:40:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-02-20 16:40:36,652 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-02-20 16:40:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:40:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:40:36,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:40:36,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:40:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-02-20 16:40:36,653 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-02-20 16:40:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:40:36,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:40:36,761 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:40:36,763 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:40:46,034 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:40:46,041 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:40:46,041 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 16:40:46,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:40:46 BoogieIcfgContainer [2022-02-20 16:40:46,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:40:46,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:40:46,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:40:46,048 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:40:46,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:40:35" (1/3) ... [2022-02-20 16:40:46,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fdf14c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:40:46, skipping insertion in model container [2022-02-20 16:40:46,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:40:36" (2/3) ... [2022-02-20 16:40:46,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fdf14c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:40:46, skipping insertion in model container [2022-02-20 16:40:46,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:40:46" (3/3) ... [2022-02-20 16:40:46,051 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0661b.c [2022-02-20 16:40:46,058 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:40:46,058 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:40:46,101 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:40:46,106 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:40:46,106 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:40:46,129 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 84 states have (on average 1.6547619047619047) internal successors, (139), 85 states have internal predecessors, (139), 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:40:46,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:40:46,133 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:40:46,133 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:40:46,134 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:40:46,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:40:46,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1457381495, now seen corresponding path program 1 times [2022-02-20 16:40:46,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:40:46,162 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080675565] [2022-02-20 16:40:46,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:40:46,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:40:46,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:40:46,166 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:40:46,192 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:40:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:46,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:40:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:46,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:40:47,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {95#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))); {95#true} is VALID [2022-02-20 16:40:47,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {95#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet39#1, main_#t~ret40#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet39#1;havoc main_#t~nondet39#1;main_~y~0#1 := ~Pluszero~FLOAT(); {95#true} is VALID [2022-02-20 16:40:47,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {95#true} assume ~fp.gt~FLOAT(main_~x~0#1, ~Pluszero~FLOAT());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; {95#true} is VALID [2022-02-20 16:40:47,096 INFO L290 TraceCheckUtils]: 3: Hoare triple {95#true} assume !true; {96#false} is VALID [2022-02-20 16:40:47,096 INFO L290 TraceCheckUtils]: 4: Hoare triple {96#false} __ieee754_atan2f_~ix~2#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hx~1#1); {96#false} is VALID [2022-02-20 16:40:47,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {96#false} assume !true; {96#false} is VALID [2022-02-20 16:40:47,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {96#false} __ieee754_atan2f_~iy~0#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hy~0#1); {96#false} is VALID [2022-02-20 16:40:47,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {96#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); {96#false} is VALID [2022-02-20 16:40:47,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {96#false} main_#t~ret40#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1; {96#false} is VALID [2022-02-20 16:40:47,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {96#false} assume !~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {96#false} is VALID [2022-02-20 16:40:47,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {96#false} assume !false; {96#false} is VALID [2022-02-20 16:40:47,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:40:47,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:40:47,100 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:40:47,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080675565] [2022-02-20 16:40:47,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080675565] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:40:47,101 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:40:47,101 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:40:47,103 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272821163] [2022-02-20 16:40:47,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:40:47,107 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:40:47,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:40:47,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:47,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:47,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:40:47,150 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:40:47,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:40:47,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:40:47,182 INFO L87 Difference]: Start difference. First operand has 92 states, 84 states have (on average 1.6547619047619047) internal successors, (139), 85 states have internal predecessors, (139), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:59,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:59,682 INFO L93 Difference]: Finished difference Result 181 states and 294 transitions. [2022-02-20 16:40:59,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:40:59,682 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:40:59,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:40:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 294 transitions. [2022-02-20 16:40:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 294 transitions. [2022-02-20 16:40:59,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 294 transitions. [2022-02-20 16:41:03,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 294 edges. 294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:41:03,372 INFO L225 Difference]: With dead ends: 181 [2022-02-20 16:41:03,372 INFO L226 Difference]: Without dead ends: 88 [2022-02-20 16:41:03,375 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:41:03,378 INFO L933 BasicCegarLoop]: 132 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, 132 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:03,379 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 132 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:03,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-02-20 16:41:03,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-02-20 16:41:03,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:41:03,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 88 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 81 states have internal predecessors, (119), 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:03,410 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 88 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 81 states have internal predecessors, (119), 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:03,411 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 88 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 81 states have internal predecessors, (119), 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:03,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:03,417 INFO L93 Difference]: Finished difference Result 88 states and 127 transitions. [2022-02-20 16:41:03,417 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2022-02-20 16:41:03,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:41:03,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:41:03,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 81 states have internal predecessors, (119), 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 88 states. [2022-02-20 16:41:03,419 INFO L87 Difference]: Start difference. First operand has 88 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 81 states have internal predecessors, (119), 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 88 states. [2022-02-20 16:41:03,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:41:03,425 INFO L93 Difference]: Finished difference Result 88 states and 127 transitions. [2022-02-20 16:41:03,425 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2022-02-20 16:41:03,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:41:03,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:41:03,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:41:03,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:41:03,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 81 states have internal predecessors, (119), 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:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 127 transitions. [2022-02-20 16:41:03,432 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 127 transitions. Word has length 11 [2022-02-20 16:41:03,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:41:03,433 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 127 transitions. [2022-02-20 16:41:03,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:03,433 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 127 transitions. [2022-02-20 16:41:03,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:41:03,434 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:41:03,434 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:41:03,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:41:03,651 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:41:03,651 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:41:03,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:41:03,652 INFO L85 PathProgramCache]: Analyzing trace with hash 413175488, now seen corresponding path program 1 times [2022-02-20 16:41:03,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:41:03,653 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737010206] [2022-02-20 16:41:03,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:41:03,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:41:03,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:41:03,654 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:41:03,655 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:41:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:41:04,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 16:41:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:41:04,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:41:04,710 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:41:05,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-02-20 16:41:05,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {612#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))); {612#true} is VALID [2022-02-20 16:41:05,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {612#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet39#1, main_#t~ret40#1, main_~res~0#1, main_~x~0#1, main_~y~0#1;main_~x~0#1 := main_#t~nondet39#1;havoc main_#t~nondet39#1;main_~y~0#1 := ~Pluszero~FLOAT(); {620#(= (_ +zero 8 24) |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 16:41:05,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {620#(= (_ +zero 8 24) |ULTIMATE.start_main_~y~0#1|)} assume ~fp.gt~FLOAT(main_~x~0#1, ~Pluszero~FLOAT());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; {624#(and (fp.gt |ULTIMATE.start___ieee754_atan2f_~x#1| (_ +zero 8 24)) (= (_ +zero 8 24) |ULTIMATE.start___ieee754_atan2f_~y#1|))} is VALID [2022-02-20 16:41:05,855 INFO L290 TraceCheckUtils]: 3: Hoare triple {624#(and (fp.gt |ULTIMATE.start___ieee754_atan2f_~x#1| (_ +zero 8 24)) (= (_ +zero 8 24) |ULTIMATE.start___ieee754_atan2f_~y#1|))} 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; {628#(and (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|) (fp.gt (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)))) (_ +zero 8 24)))) (= (_ +zero 8 24) |ULTIMATE.start___ieee754_atan2f_~y#1|))} is VALID [2022-02-20 16:41:05,856 INFO L290 TraceCheckUtils]: 4: Hoare triple {628#(and (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|) (fp.gt (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)))) (_ +zero 8 24)))) (= (_ +zero 8 24) |ULTIMATE.start___ieee754_atan2f_~y#1|))} goto; {628#(and (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|) (fp.gt (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)))) (_ +zero 8 24)))) (= (_ +zero 8 24) |ULTIMATE.start___ieee754_atan2f_~y#1|))} is VALID [2022-02-20 16:41:05,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {628#(and (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (= (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|) (fp.gt (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)))) (_ +zero 8 24)))) (= (_ +zero 8 24) |ULTIMATE.start___ieee754_atan2f_~y#1|))} __ieee754_atan2f_~ix~2#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hx~1#1); {635#(and (= (_ +zero 8 24) |ULTIMATE.start___ieee754_atan2f_~y#1|) (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (= (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|) (fp.gt (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)))) (_ +zero 8 24)))))} is VALID [2022-02-20 16:41:05,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {635#(and (= (_ +zero 8 24) |ULTIMATE.start___ieee754_atan2f_~y#1|) (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32))) (and (= (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|) (fp.gt (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)))) (_ +zero 8 24)))))} 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; {639#(and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +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|)) (_ +zero 8 24)))} is VALID [2022-02-20 16:41:05,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {639#(and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +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|)) (_ +zero 8 24)))} goto; {639#(and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +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|)) (_ +zero 8 24)))} is VALID [2022-02-20 16:41:05,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {639#(and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +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|)) (_ +zero 8 24)))} __ieee754_atan2f_~iy~0#1 := ~bvand32(2147483647bv32, __ieee754_atan2f_~hy~0#1); {646#(and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +zero 8 24)))) (exists ((|ULTIMATE.start___ieee754_atan2f_~hy~0#1| (_ BitVec 32))) (and (= (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|)) (_ +zero 8 24)) (= |ULTIMATE.start___ieee754_atan2f_~iy~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)))))} is VALID [2022-02-20 16:41:05,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {646#(and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_arrayElimCell_1) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (fp.gt (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)) (_ +zero 8 24)))) (exists ((|ULTIMATE.start___ieee754_atan2f_~hy~0#1| (_ BitVec 32))) (and (= (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|)) (_ +zero 8 24)) (= |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); {613#false} is VALID [2022-02-20 16:41:05,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {613#false} main_#t~ret40#1 := __ieee754_atan2f_#res#1;assume { :end_inline___ieee754_atan2f } true;main_~res~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1; {613#false} is VALID [2022-02-20 16:41:05,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {613#false} assume !~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {613#false} is VALID [2022-02-20 16:41:05,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {613#false} assume !false; {613#false} is VALID [2022-02-20 16:41:05,894 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:05,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:41:05,895 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:41:05,895 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737010206] [2022-02-20 16:41:05,895 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [737010206] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:41:05,895 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:41:05,895 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 16:41:05,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573429553] [2022-02-20 16:41:05,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:41:05,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:41:05,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:41:05,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:41:05,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:41:05,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 16:41:05,944 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:41:05,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 16:41:05,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:41:05,945 INFO L87 Difference]: Start difference. First operand 88 states and 127 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)