./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0620a.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_0620a.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 0682c5b0aa15583147a7e08f281b31c84f28e6f8db41872cc8e834f12ff21a47 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:39:36,540 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:39:36,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:39:36,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:39:36,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:39:36,587 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:39:36,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:39:36,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:39:36,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:39:36,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:39:36,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:39:36,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:39:36,598 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:39:36,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:39:36,601 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:39:36,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:39:36,604 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:39:36,605 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:39:36,606 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:39:36,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:39:36,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:39:36,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:39:36,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:39:36,613 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:39:36,615 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:39:36,616 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:39:36,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:39:36,618 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:39:36,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:39:36,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:39:36,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:39:36,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:39:36,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:39:36,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:39:36,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:39:36,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:39:36,623 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:39:36,623 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:39:36,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:39:36,624 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:39:36,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:39:36,625 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:39:36,645 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:39:36,647 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:39:36,647 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:39:36,648 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:39:36,648 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:39:36,648 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:39:36,649 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:39:36,649 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:39:36,649 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:39:36,649 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:39:36,650 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:39:36,650 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:39:36,650 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:39:36,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:39:36,651 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:39:36,651 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:39:36,651 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:39:36,651 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:39:36,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:39:36,651 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:39:36,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:39:36,652 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:39:36,652 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:39:36,652 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:39:36,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:39:36,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:39:36,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:39:36,652 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:39:36,653 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:39:36,653 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:39:36,653 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:39:36,653 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:39:36,653 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:39:36,653 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 -> 0682c5b0aa15583147a7e08f281b31c84f28e6f8db41872cc8e834f12ff21a47 [2022-02-20 16:39:36,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:39:36,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:39:36,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:39:36,864 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:39:36,866 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:39:36,867 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0620a.c [2022-02-20 16:39:36,923 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae914f96/65f3ea8d8c0c4682be818eb4327424bf/FLAGefa37d590 [2022-02-20 16:39:37,303 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:39:37,304 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0620a.c [2022-02-20 16:39:37,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae914f96/65f3ea8d8c0c4682be818eb4327424bf/FLAGefa37d590 [2022-02-20 16:39:37,331 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae914f96/65f3ea8d8c0c4682be818eb4327424bf [2022-02-20 16:39:37,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:39:37,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:39:37,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:39:37,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:39:37,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:39:37,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:39:37" (1/1) ... [2022-02-20 16:39:37,343 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1efb99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:37, skipping insertion in model container [2022-02-20 16:39:37,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:39:37" (1/1) ... [2022-02-20 16:39:37,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:39:37,368 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:39:37,558 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_0620a.c[3328,3341] [2022-02-20 16:39:37,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:39:37,578 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:39:37,627 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_0620a.c[3328,3341] [2022-02-20 16:39:37,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:39:37,650 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:39:37,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:37 WrapperNode [2022-02-20 16:39:37,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:39:37,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:39:37,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:39:37,652 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:39:37,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:37" (1/1) ... [2022-02-20 16:39:37,684 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:37" (1/1) ... [2022-02-20 16:39:37,716 INFO L137 Inliner]: procedures = 19, calls = 65, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 210 [2022-02-20 16:39:37,723 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:39:37,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:39:37,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:39:37,724 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:39:37,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:37" (1/1) ... [2022-02-20 16:39:37,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:37" (1/1) ... [2022-02-20 16:39:37,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:37" (1/1) ... [2022-02-20 16:39:37,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:37" (1/1) ... [2022-02-20 16:39:37,749 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:37" (1/1) ... [2022-02-20 16:39:37,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:37" (1/1) ... [2022-02-20 16:39:37,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:37" (1/1) ... [2022-02-20 16:39:37,766 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:39:37,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:39:37,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:39:37,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:39:37,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:37" (1/1) ... [2022-02-20 16:39:37,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:39:37,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:39:37,795 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:39:37,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:39:37,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:39:37,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:39:37,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:39:37,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:39:37,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:39:37,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:39:37,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:39:37,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:39:37,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:39:37,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:39:37,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:39:37,939 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:39:37,941 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:39:38,176 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:39:38,181 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:39:38,181 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 16:39:38,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:39:38 BoogieIcfgContainer [2022-02-20 16:39:38,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:39:38,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:39:38,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:39:38,186 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:39:38,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:39:37" (1/3) ... [2022-02-20 16:39:38,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3760560c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:39:38, skipping insertion in model container [2022-02-20 16:39:38,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:37" (2/3) ... [2022-02-20 16:39:38,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3760560c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:39:38, skipping insertion in model container [2022-02-20 16:39:38,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:39:38" (3/3) ... [2022-02-20 16:39:38,188 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0620a.c [2022-02-20 16:39:38,191 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:39:38,192 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:39:38,222 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:39:38,226 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:39:38,226 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:39:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 39 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:38,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:39:38,239 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:39:38,240 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:39:38,240 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:39:38,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:39:38,244 INFO L85 PathProgramCache]: Analyzing trace with hash -897861633, now seen corresponding path program 1 times [2022-02-20 16:39:38,250 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:39:38,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395263127] [2022-02-20 16:39:38,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:39:38,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:39:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:38,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~huge_floor~0 := 1.0E30;~#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; {43#true} is VALID [2022-02-20 16:39:38,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret28#1, main_#t~ret29#1, main_#t~short30#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := 0.0;assume { :begin_inline_atan_float } true;atan_float_#in~x#1 := main_~x~0#1;havoc atan_float_#res#1;havoc atan_float_#t~mem6#1, atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset, atan_float_#t~mem8#1, atan_float_#t~mem9#1, atan_float_#t~mem10#1, atan_float_#t~mem11#1, atan_float_#t~ret12#1, atan_float_#t~mem18#1, atan_float_#t~mem17#1, atan_float_#t~mem16#1, atan_float_#t~mem15#1, atan_float_#t~mem14#1, atan_float_#t~mem13#1, atan_float_#t~mem23#1, atan_float_#t~mem22#1, atan_float_#t~mem21#1, atan_float_#t~mem20#1, atan_float_#t~mem19#1, atan_float_#t~mem25#1, atan_float_#t~mem24#1, atan_float_#t~ite26#1, atan_float_~x#1, atan_float_~w~0#1, atan_float_~s1~0#1, atan_float_~s2~0#1, atan_float_~z~0#1, atan_float_~ix~1#1, atan_float_~hx~0#1, atan_float_~id~0#1, atan_float_#t~nondet7#1;atan_float_~x#1 := atan_float_#in~x#1;havoc atan_float_~w~0#1;havoc atan_float_~s1~0#1;havoc atan_float_~s2~0#1;havoc atan_float_~z~0#1;havoc atan_float_~ix~1#1;havoc atan_float_~hx~0#1;havoc atan_float_~id~0#1; {43#true} is VALID [2022-02-20 16:39:38,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume !true; {44#false} is VALID [2022-02-20 16:39:38,354 INFO L290 TraceCheckUtils]: 3: Hoare triple {44#false} assume 0 == atan_float_~hx~0#1;atan_float_~ix~1#1 := 0; {44#false} is VALID [2022-02-20 16:39:38,354 INFO L290 TraceCheckUtils]: 4: Hoare triple {44#false} assume atan_float_~ix~1#1 >= 1350565888; {44#false} is VALID [2022-02-20 16:39:38,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {44#false} assume atan_float_~ix~1#1 > 2139095040;atan_float_#res#1 := ~someBinaryArithmeticFLOAToperation(atan_float_~x#1, atan_float_~x#1); {44#false} is VALID [2022-02-20 16:39:38,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {44#false} main_#t~ret28#1 := atan_float_#res#1;assume { :end_inline_atan_float } true;main_~res~0#1 := main_#t~ret28#1;havoc main_#t~ret28#1;main_#t~short30#1 := ~someBinaryFLOATComparisonOperation(main_~res~0#1, 0.0); {44#false} is VALID [2022-02-20 16:39:38,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {44#false} assume !main_#t~short30#1; {44#false} is VALID [2022-02-20 16:39:38,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {44#false} assume !main_#t~short30#1;havoc main_#t~ret29#1;havoc main_#t~short30#1; {44#false} is VALID [2022-02-20 16:39:38,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-02-20 16:39:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:39:38,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:39:38,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395263127] [2022-02-20 16:39:38,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395263127] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:39:38,357 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:39:38,381 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:39:38,382 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379834322] [2022-02-20 16:39:38,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:39:38,387 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:39:38,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:39:38,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:38,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:39:38,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:39:38,407 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:39:38,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:39:38,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:39:38,428 INFO L87 Difference]: Start difference. First operand has 40 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 39 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:38,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:38,485 INFO L93 Difference]: Finished difference Result 78 states and 126 transitions. [2022-02-20 16:39:38,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:39:38,486 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:39:38,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:39:38,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 126 transitions. [2022-02-20 16:39:38,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:38,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 126 transitions. [2022-02-20 16:39:38,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 126 transitions. [2022-02-20 16:39:38,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:39:38,646 INFO L225 Difference]: With dead ends: 78 [2022-02-20 16:39:38,659 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 16:39:38,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:39:38,664 INFO L933 BasicCegarLoop]: 53 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, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:39:38,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:39:38,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 16:39:38,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-02-20 16:39:38,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:39:38,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:38,709 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:38,709 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:38,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:38,712 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-02-20 16:39:38,712 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2022-02-20 16:39:38,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:38,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:38,713 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-20 16:39:38,713 INFO L87 Difference]: Start difference. First operand has 37 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-20 16:39:38,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:38,716 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-02-20 16:39:38,716 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2022-02-20 16:39:38,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:38,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:38,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:39:38,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:39:38,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:38,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2022-02-20 16:39:38,720 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 10 [2022-02-20 16:39:38,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:39:38,735 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-02-20 16:39:38,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:38,735 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2022-02-20 16:39:38,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:39:38,736 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:39:38,736 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:39:38,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:39:38,737 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:39:38,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:39:38,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1061798466, now seen corresponding path program 1 times [2022-02-20 16:39:38,738 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:39:38,738 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107204297] [2022-02-20 16:39:38,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:39:38,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:39:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:38,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~huge_floor~0 := 1.0E30;~#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; {256#true} is VALID [2022-02-20 16:39:38,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret28#1, main_#t~ret29#1, main_#t~short30#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := 0.0;assume { :begin_inline_atan_float } true;atan_float_#in~x#1 := main_~x~0#1;havoc atan_float_#res#1;havoc atan_float_#t~mem6#1, atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset, atan_float_#t~mem8#1, atan_float_#t~mem9#1, atan_float_#t~mem10#1, atan_float_#t~mem11#1, atan_float_#t~ret12#1, atan_float_#t~mem18#1, atan_float_#t~mem17#1, atan_float_#t~mem16#1, atan_float_#t~mem15#1, atan_float_#t~mem14#1, atan_float_#t~mem13#1, atan_float_#t~mem23#1, atan_float_#t~mem22#1, atan_float_#t~mem21#1, atan_float_#t~mem20#1, atan_float_#t~mem19#1, atan_float_#t~mem25#1, atan_float_#t~mem24#1, atan_float_#t~ite26#1, atan_float_~x#1, atan_float_~w~0#1, atan_float_~s1~0#1, atan_float_~s2~0#1, atan_float_~z~0#1, atan_float_~ix~1#1, atan_float_~hx~0#1, atan_float_~id~0#1, atan_float_#t~nondet7#1;atan_float_~x#1 := atan_float_#in~x#1;havoc atan_float_~w~0#1;havoc atan_float_~s1~0#1;havoc atan_float_~s2~0#1;havoc atan_float_~z~0#1;havoc atan_float_~ix~1#1;havoc atan_float_~hx~0#1;havoc atan_float_~id~0#1; {256#true} is VALID [2022-02-20 16:39:38,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} call atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4);call write~real(atan_float_~x#1, atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset, 4);call atan_float_#t~mem6#1 := read~int(atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset, 4);atan_float_~hx~0#1 := (if atan_float_#t~mem6#1 % 4294967296 % 4294967296 <= 2147483647 then atan_float_#t~mem6#1 % 4294967296 % 4294967296 else atan_float_#t~mem6#1 % 4294967296 % 4294967296 - 4294967296);havoc atan_float_#t~mem6#1;call ULTIMATE.dealloc(atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset);havoc atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset; {256#true} is VALID [2022-02-20 16:39:38,836 INFO L290 TraceCheckUtils]: 3: Hoare triple {256#true} goto; {256#true} is VALID [2022-02-20 16:39:38,837 INFO L290 TraceCheckUtils]: 4: Hoare triple {256#true} assume 0 == atan_float_~hx~0#1;atan_float_~ix~1#1 := 0; {258#(= |ULTIMATE.start_atan_float_~ix~1#1| 0)} is VALID [2022-02-20 16:39:38,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {258#(= |ULTIMATE.start_atan_float_~ix~1#1| 0)} assume atan_float_~ix~1#1 >= 1350565888; {257#false} is VALID [2022-02-20 16:39:38,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {257#false} assume atan_float_~ix~1#1 > 2139095040;atan_float_#res#1 := ~someBinaryArithmeticFLOAToperation(atan_float_~x#1, atan_float_~x#1); {257#false} is VALID [2022-02-20 16:39:38,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {257#false} main_#t~ret28#1 := atan_float_#res#1;assume { :end_inline_atan_float } true;main_~res~0#1 := main_#t~ret28#1;havoc main_#t~ret28#1;main_#t~short30#1 := ~someBinaryFLOATComparisonOperation(main_~res~0#1, 0.0); {257#false} is VALID [2022-02-20 16:39:38,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {257#false} assume !main_#t~short30#1; {257#false} is VALID [2022-02-20 16:39:38,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {257#false} assume !main_#t~short30#1;havoc main_#t~ret29#1;havoc main_#t~short30#1; {257#false} is VALID [2022-02-20 16:39:38,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-02-20 16:39:38,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:39:38,838 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:39:38,839 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107204297] [2022-02-20 16:39:38,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107204297] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:39:38,839 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:39:38,839 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:39:38,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940186927] [2022-02-20 16:39:38,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:39:38,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:39:38,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:39:38,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:38,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:39:38,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:39:38,854 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:39:38,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:39:38,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:39:38,856 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:38,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:38,939 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2022-02-20 16:39:38,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:39:38,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:39:38,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:39:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:38,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2022-02-20 16:39:38,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:38,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2022-02-20 16:39:38,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2022-02-20 16:39:39,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:39:39,034 INFO L225 Difference]: With dead ends: 80 [2022-02-20 16:39:39,034 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 16:39:39,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:39:39,035 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 21 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:39:39,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 79 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:39:39,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 16:39:39,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2022-02-20 16:39:39,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:39:39,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 40 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:39,040 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 40 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:39,040 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 40 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:39,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:39,042 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2022-02-20 16:39:39,042 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2022-02-20 16:39:39,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:39,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:39,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 55 states. [2022-02-20 16:39:39,043 INFO L87 Difference]: Start difference. First operand has 40 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 55 states. [2022-02-20 16:39:39,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:39,045 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2022-02-20 16:39:39,045 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2022-02-20 16:39:39,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:39,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:39,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:39:39,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:39:39,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2022-02-20 16:39:39,047 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 11 [2022-02-20 16:39:39,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:39:39,048 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2022-02-20 16:39:39,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:39,048 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-02-20 16:39:39,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:39:39,048 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:39:39,049 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:39:39,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:39:39,049 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:39:39,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:39:39,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1924524549, now seen corresponding path program 1 times [2022-02-20 16:39:39,050 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:39:39,050 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636831501] [2022-02-20 16:39:39,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:39:39,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:39:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:39:39,082 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:39:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:39:39,114 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:39:39,115 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:39:39,115 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:39:39,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:39:39,119 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:39:39,120 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:39:39,143 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:39:39,143 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:39:39,143 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2022-02-20 16:39:39,143 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2022-02-20 16:39:39,144 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2022-02-20 16:39:39,144 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2022-02-20 16:39:39,144 WARN L170 areAnnotationChecker]: L59-3 has no Hoare annotation [2022-02-20 16:39:39,144 WARN L170 areAnnotationChecker]: L59-3 has no Hoare annotation [2022-02-20 16:39:39,144 WARN L170 areAnnotationChecker]: L64-7 has no Hoare annotation [2022-02-20 16:39:39,144 WARN L170 areAnnotationChecker]: L64-7 has no Hoare annotation [2022-02-20 16:39:39,144 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2022-02-20 16:39:39,144 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2022-02-20 16:39:39,144 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:39:39,145 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:39:39,145 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:39:39,145 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:39:39,145 WARN L170 areAnnotationChecker]: L64-3 has no Hoare annotation [2022-02-20 16:39:39,145 WARN L170 areAnnotationChecker]: L64-3 has no Hoare annotation [2022-02-20 16:39:39,145 WARN L170 areAnnotationChecker]: L115-3 has no Hoare annotation [2022-02-20 16:39:39,145 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:39:39,145 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:39:39,145 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2022-02-20 16:39:39,146 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2022-02-20 16:39:39,146 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-20 16:39:39,146 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-20 16:39:39,146 WARN L170 areAnnotationChecker]: L64-5 has no Hoare annotation [2022-02-20 16:39:39,146 WARN L170 areAnnotationChecker]: L64-5 has no Hoare annotation [2022-02-20 16:39:39,146 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-02-20 16:39:39,146 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-02-20 16:39:39,146 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2022-02-20 16:39:39,146 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2022-02-20 16:39:39,147 WARN L170 areAnnotationChecker]: L74-2 has no Hoare annotation [2022-02-20 16:39:39,147 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:39:39,147 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-20 16:39:39,147 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-20 16:39:39,147 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-02-20 16:39:39,147 WARN L170 areAnnotationChecker]: L122-2 has no Hoare annotation [2022-02-20 16:39:39,147 WARN L170 areAnnotationChecker]: L122-2 has no Hoare annotation [2022-02-20 16:39:39,147 WARN L170 areAnnotationChecker]: L143-2 has no Hoare annotation [2022-02-20 16:39:39,147 WARN L170 areAnnotationChecker]: L143-2 has no Hoare annotation [2022-02-20 16:39:39,147 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:39:39,148 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 16:39:39,148 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 16:39:39,148 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-02-20 16:39:39,148 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2022-02-20 16:39:39,148 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2022-02-20 16:39:39,148 WARN L170 areAnnotationChecker]: L122-3 has no Hoare annotation [2022-02-20 16:39:39,148 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2022-02-20 16:39:39,148 WARN L170 areAnnotationChecker]: L144 has no Hoare annotation [2022-02-20 16:39:39,148 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2022-02-20 16:39:39,149 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-02-20 16:39:39,149 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-02-20 16:39:39,149 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:39:39,149 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-02-20 16:39:39,149 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:39:39,149 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2022-02-20 16:39:39,149 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2022-02-20 16:39:39,149 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:39:39,149 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 16:39:39,150 WARN L170 areAnnotationChecker]: L115-2 has no Hoare annotation [2022-02-20 16:39:39,150 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:39:39,150 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:39:39,150 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-02-20 16:39:39,150 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-02-20 16:39:39,150 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:39:39,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:39:39 BoogieIcfgContainer [2022-02-20 16:39:39,151 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:39:39,151 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:39:39,152 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:39:39,152 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:39:39,152 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:39:38" (3/4) ... [2022-02-20 16:39:39,154 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:39:39,155 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:39:39,155 INFO L158 Benchmark]: Toolchain (without parser) took 1821.68ms. Allocated memory is still 98.6MB. Free memory was 66.1MB in the beginning and 59.6MB in the end (delta: 6.4MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-02-20 16:39:39,156 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory was 54.5MB in the beginning and 54.5MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:39:39,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.75ms. Allocated memory is still 98.6MB. Free memory was 65.8MB in the beginning and 72.5MB in the end (delta: -6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:39:39,157 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.81ms. Allocated memory is still 98.6MB. Free memory was 72.5MB in the beginning and 69.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:39:39,157 INFO L158 Benchmark]: Boogie Preprocessor took 43.81ms. Allocated memory is still 98.6MB. Free memory was 69.8MB in the beginning and 67.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:39:39,157 INFO L158 Benchmark]: RCFGBuilder took 413.82ms. Allocated memory is still 98.6MB. Free memory was 67.1MB in the beginning and 48.7MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 16:39:39,158 INFO L158 Benchmark]: TraceAbstraction took 967.78ms. Allocated memory is still 98.6MB. Free memory was 48.2MB in the beginning and 59.6MB in the end (delta: -11.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:39:39,158 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 98.6MB. Free memory is still 59.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:39:39,159 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.17ms. Allocated memory is still 81.8MB. Free memory was 54.5MB in the beginning and 54.5MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.75ms. Allocated memory is still 98.6MB. Free memory was 65.8MB in the beginning and 72.5MB in the end (delta: -6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.81ms. Allocated memory is still 98.6MB. Free memory was 72.5MB in the beginning and 69.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.81ms. Allocated memory is still 98.6MB. Free memory was 69.8MB in the beginning and 67.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 413.82ms. Allocated memory is still 98.6MB. Free memory was 67.1MB in the beginning and 48.7MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 967.78ms. Allocated memory is still 98.6MB. Free memory was 48.2MB in the beginning and 59.6MB in the end (delta: -11.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 98.6MB. Free memory is still 59.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 144]: 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 143, overapproximation of someUnaryDOUBLEoperation at line 46. Possible FailurePath: [L14] static const float huge_floor = 1.0e30; [L31-L36] static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L38-L43] static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L45-L49] 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, }; [L51-L53] 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; VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000] [L139] float x = 0.0f; [L140] CALL, EXPR atan_float(x) [L56] float w, s1, s2, z; [L57] __int32_t ix, hx, id; VAL [\old(x)=0, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, x=0] [L60] ieee_float_shape_type gf_u; [L61] gf_u.value = (x) [L62] EXPR gf_u.word [L62] (hx) = gf_u.word [L64] ix = hx & 0x7fffffff VAL [\old(x)=0, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, x=0] [L65] COND FALSE !(ix >= 0x50800000) VAL [\old(x)=0, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, x=0] [L73] COND TRUE ix < 0x3ee00000 VAL [\old(x)=0, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, x=0] [L74] COND TRUE ix < 0x31000000 VAL [\old(x)=0, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, x=0] [L75] COND TRUE huge_atan + x > one_atan [L76] return x; VAL [\old(x)=0, \result=0, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, x=0] [L140] RET, EXPR atan_float(x) [L140] float res = atan_float(x); [L143] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=0, res == 0.0f && __signbit_float(res) == 0=0, x=0] [L143] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L144] reach_error() VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, huge_floor=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=0, x=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 132 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 100 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 21 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:39:39,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0620a.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 0682c5b0aa15583147a7e08f281b31c84f28e6f8db41872cc8e834f12ff21a47 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:39:41,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:39:41,028 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:39:41,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:39:41,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:39:41,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:39:41,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:39:41,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:39:41,067 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:39:41,071 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:39:41,072 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:39:41,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:39:41,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:39:41,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:39:41,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:39:41,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:39:41,081 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:39:41,081 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:39:41,083 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:39:41,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:39:41,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:39:41,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:39:41,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:39:41,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:39:41,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:39:41,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:39:41,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:39:41,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:39:41,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:39:41,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:39:41,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:39:41,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:39:41,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:39:41,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:39:41,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:39:41,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:39:41,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:39:41,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:39:41,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:39:41,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:39:41,106 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:39:41,110 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:39:41,145 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:39:41,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:39:41,146 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:39:41,147 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:39:41,147 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:39:41,147 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:39:41,148 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:39:41,148 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:39:41,149 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:39:41,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:39:41,149 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:39:41,150 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:39:41,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:39:41,150 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:39:41,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:39:41,150 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:39:41,150 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:39:41,150 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:39:41,150 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:39:41,151 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:39:41,151 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:39:41,151 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:39:41,151 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:39:41,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:39:41,151 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:39:41,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:39:41,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:39:41,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:39:41,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:39:41,152 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:39:41,152 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:39:41,152 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:39:41,153 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:39:41,153 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:39:41,153 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:39:41,153 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:39:41,153 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 -> 0682c5b0aa15583147a7e08f281b31c84f28e6f8db41872cc8e834f12ff21a47 [2022-02-20 16:39:41,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:39:41,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:39:41,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:39:41,428 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:39:41,430 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:39:41,431 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0620a.c [2022-02-20 16:39:41,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3de62a64f/798fae2ace22403b8308daa3f9146205/FLAG1c1e9402b [2022-02-20 16:39:41,826 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:39:41,828 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0620a.c [2022-02-20 16:39:41,834 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3de62a64f/798fae2ace22403b8308daa3f9146205/FLAG1c1e9402b [2022-02-20 16:39:42,237 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3de62a64f/798fae2ace22403b8308daa3f9146205 [2022-02-20 16:39:42,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:39:42,242 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:39:42,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:39:42,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:39:42,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:39:42,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:39:42" (1/1) ... [2022-02-20 16:39:42,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf290f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:42, skipping insertion in model container [2022-02-20 16:39:42,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:39:42" (1/1) ... [2022-02-20 16:39:42,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:39:42,279 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:39:42,478 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_0620a.c[3328,3341] [2022-02-20 16:39:42,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:39:42,506 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:39:42,550 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_0620a.c[3328,3341] [2022-02-20 16:39:42,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:39:42,576 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:39:42,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:42 WrapperNode [2022-02-20 16:39:42,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:39:42,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:39:42,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:39:42,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:39:42,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:39:42" (1/1) ... [2022-02-20 16:39:42,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:42" (1/1) ... [2022-02-20 16:39:42,641 INFO L137 Inliner]: procedures = 22, calls = 65, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 198 [2022-02-20 16:39:42,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:39:42,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:39:42,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:39:42,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:39:42,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:42" (1/1) ... [2022-02-20 16:39:42,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:39:42" (1/1) ... [2022-02-20 16:39:42,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:42" (1/1) ... [2022-02-20 16:39:42,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:42" (1/1) ... [2022-02-20 16:39:42,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:42" (1/1) ... [2022-02-20 16:39:42,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:42" (1/1) ... [2022-02-20 16:39:42,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:42" (1/1) ... [2022-02-20 16:39:42,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:39:42,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:39:42,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:39:42,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:39:42,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:42" (1/1) ... [2022-02-20 16:39:42,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:39:42,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:39:42,726 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:39:42,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:39:42,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:39:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:39:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:39:42,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:39:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:39:42,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:39:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:39:42,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:39:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:39:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:39:42,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:39:42,822 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:39:42,823 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:39:52,424 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:39:52,434 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:39:52,434 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 16:39:52,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:39:52 BoogieIcfgContainer [2022-02-20 16:39:52,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:39:52,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:39:52,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:39:52,438 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:39:52,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:39:42" (1/3) ... [2022-02-20 16:39:52,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c51c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:39:52, skipping insertion in model container [2022-02-20 16:39:52,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:39:42" (2/3) ... [2022-02-20 16:39:52,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37c51c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:39:52, skipping insertion in model container [2022-02-20 16:39:52,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:39:52" (3/3) ... [2022-02-20 16:39:52,440 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0620a.c [2022-02-20 16:39:52,444 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:39:52,451 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:39:52,504 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:39:52,510 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:39:52,511 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:39:52,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:52,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:39:52,523 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:39:52,523 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:39:52,523 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:39:52,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:39:52,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1030429181, now seen corresponding path program 1 times [2022-02-20 16:39:52,541 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:39:52,542 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975214623] [2022-02-20 16:39:52,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:39:52,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:39:52,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:39:52,545 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:39:52,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:39:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:53,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:39:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:53,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:39:53,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~huge_floor~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~#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)); {40#true} is VALID [2022-02-20 16:39:53,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret27#1, main_#t~ret28#1, main_#t~short29#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~Pluszero~FLOAT();assume { :begin_inline_atan_float } true;atan_float_#in~x#1 := main_~x~0#1;havoc atan_float_#res#1;havoc atan_float_#t~mem6#1, atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset, atan_float_#t~mem7#1, atan_float_#t~mem8#1, atan_float_#t~mem9#1, atan_float_#t~mem10#1, atan_float_#t~ret11#1, atan_float_#t~mem17#1, atan_float_#t~mem16#1, atan_float_#t~mem15#1, atan_float_#t~mem14#1, atan_float_#t~mem13#1, atan_float_#t~mem12#1, atan_float_#t~mem22#1, atan_float_#t~mem21#1, atan_float_#t~mem20#1, atan_float_#t~mem19#1, atan_float_#t~mem18#1, atan_float_#t~mem24#1, atan_float_#t~mem23#1, atan_float_#t~ite25#1, atan_float_~x#1, atan_float_~w~0#1, atan_float_~s1~0#1, atan_float_~s2~0#1, atan_float_~z~0#1, atan_float_~ix~1#1, atan_float_~hx~0#1, atan_float_~id~0#1;atan_float_~x#1 := atan_float_#in~x#1;havoc atan_float_~w~0#1;havoc atan_float_~s1~0#1;havoc atan_float_~s2~0#1;havoc atan_float_~z~0#1;havoc atan_float_~ix~1#1;havoc atan_float_~hx~0#1;havoc atan_float_~id~0#1; {40#true} is VALID [2022-02-20 16:39:53,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume !true; {41#false} is VALID [2022-02-20 16:39:53,381 INFO L290 TraceCheckUtils]: 3: Hoare triple {41#false} atan_float_~ix~1#1 := ~bvand32(2147483647bv32, atan_float_~hx~0#1); {41#false} is VALID [2022-02-20 16:39:53,381 INFO L290 TraceCheckUtils]: 4: Hoare triple {41#false} assume ~bvsge32(atan_float_~ix~1#1, 1350565888bv32); {41#false} is VALID [2022-02-20 16:39:53,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#false} assume ~bvsgt32(atan_float_~ix~1#1, 2139095040bv32);atan_float_#res#1 := ~fp.add~FLOAT(currentRoundingMode, atan_float_~x#1, atan_float_~x#1); {41#false} is VALID [2022-02-20 16:39:53,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {41#false} main_#t~ret27#1 := atan_float_#res#1;assume { :end_inline_atan_float } true;main_~res~0#1 := main_#t~ret27#1;havoc main_#t~ret27#1;main_#t~short29#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {41#false} is VALID [2022-02-20 16:39:53,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#false} assume !main_#t~short29#1; {41#false} is VALID [2022-02-20 16:39:53,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#false} assume !main_#t~short29#1;havoc main_#t~ret28#1;havoc main_#t~short29#1; {41#false} is VALID [2022-02-20 16:39:53,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-02-20 16:39:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:39:53,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:39:53,383 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:39:53,384 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975214623] [2022-02-20 16:39:53,384 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975214623] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:39:53,384 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:39:53,384 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:39:53,385 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175664117] [2022-02-20 16:39:53,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:39:53,388 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:39:53,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:39:53,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:53,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:39:53,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:39:53,415 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:39:53,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:39:53,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:39:53,429 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:02,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:02,042 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2022-02-20 16:40:02,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:40:02,043 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:40:02,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:40:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2022-02-20 16:40:02,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:02,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2022-02-20 16:40:02,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 112 transitions. [2022-02-20 16:40:04,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:04,589 INFO L225 Difference]: With dead ends: 72 [2022-02-20 16:40:04,589 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 16:40:04,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:40:04,593 INFO L933 BasicCegarLoop]: 48 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, 48 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:04,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 48 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:04,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 16:40:04,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-20 16:40:04,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:40:04,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 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:04,618 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 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:04,618 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 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:04,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:04,623 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-02-20 16:40:04,624 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-02-20 16:40:04,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:04,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:04,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states. [2022-02-20 16:40:04,626 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 34 states. [2022-02-20 16:40:04,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:04,630 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-02-20 16:40:04,630 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-02-20 16:40:04,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:04,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:04,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:40:04,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:40:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 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:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-02-20 16:40:04,639 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 10 [2022-02-20 16:40:04,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:40:04,640 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-02-20 16:40:04,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:04,640 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-02-20 16:40:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:40:04,641 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:40:04,645 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:40:04,671 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:40:04,871 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:40:04,871 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:40:04,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:40:04,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1304878016, now seen corresponding path program 1 times [2022-02-20 16:40:04,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:40:04,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162792940] [2022-02-20 16:40:04,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:40:04,873 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:40:04,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:40:04,874 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:40:04,875 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:40:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:05,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:40:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:05,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:40:05,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {265#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~huge_floor~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~#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)); {265#true} is VALID [2022-02-20 16:40:05,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {265#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret27#1, main_#t~ret28#1, main_#t~short29#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~Pluszero~FLOAT();assume { :begin_inline_atan_float } true;atan_float_#in~x#1 := main_~x~0#1;havoc atan_float_#res#1;havoc atan_float_#t~mem6#1, atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset, atan_float_#t~mem7#1, atan_float_#t~mem8#1, atan_float_#t~mem9#1, atan_float_#t~mem10#1, atan_float_#t~ret11#1, atan_float_#t~mem17#1, atan_float_#t~mem16#1, atan_float_#t~mem15#1, atan_float_#t~mem14#1, atan_float_#t~mem13#1, atan_float_#t~mem12#1, atan_float_#t~mem22#1, atan_float_#t~mem21#1, atan_float_#t~mem20#1, atan_float_#t~mem19#1, atan_float_#t~mem18#1, atan_float_#t~mem24#1, atan_float_#t~mem23#1, atan_float_#t~ite25#1, atan_float_~x#1, atan_float_~w~0#1, atan_float_~s1~0#1, atan_float_~s2~0#1, atan_float_~z~0#1, atan_float_~ix~1#1, atan_float_~hx~0#1, atan_float_~id~0#1;atan_float_~x#1 := atan_float_#in~x#1;havoc atan_float_~w~0#1;havoc atan_float_~s1~0#1;havoc atan_float_~s2~0#1;havoc atan_float_~z~0#1;havoc atan_float_~ix~1#1;havoc atan_float_~hx~0#1;havoc atan_float_~id~0#1; {273#(= |ULTIMATE.start_atan_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:40:05,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#(= |ULTIMATE.start_atan_float_~x#1| (_ +zero 8 24))} call atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(atan_float_~x#1, atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset, 4bv32);call atan_float_#t~mem6#1 := read~intINTTYPE4(atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset, 4bv32);atan_float_~hx~0#1 := atan_float_#t~mem6#1;havoc atan_float_#t~mem6#1;call ULTIMATE.dealloc(atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset);havoc atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset; {277#(= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (_ +zero 8 24))} is VALID [2022-02-20 16:40:05,924 INFO L290 TraceCheckUtils]: 3: Hoare triple {277#(= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (_ +zero 8 24))} goto; {277#(= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (_ +zero 8 24))} is VALID [2022-02-20 16:40:05,925 INFO L290 TraceCheckUtils]: 4: Hoare triple {277#(= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (_ +zero 8 24))} atan_float_~ix~1#1 := ~bvand32(2147483647bv32, atan_float_~hx~0#1); {284#(exists ((|ULTIMATE.start_atan_float_~hx~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (_ +zero 8 24)) (= |ULTIMATE.start_atan_float_~ix~1#1| (bvand (_ bv2147483647 32) |ULTIMATE.start_atan_float_~hx~0#1|))))} is VALID [2022-02-20 16:40:05,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {284#(exists ((|ULTIMATE.start_atan_float_~hx~0#1| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 30 23) |ULTIMATE.start_atan_float_~hx~0#1|) ((_ extract 22 0) |ULTIMATE.start_atan_float_~hx~0#1|)) (_ +zero 8 24)) (= |ULTIMATE.start_atan_float_~ix~1#1| (bvand (_ bv2147483647 32) |ULTIMATE.start_atan_float_~hx~0#1|))))} assume ~bvsge32(atan_float_~ix~1#1, 1350565888bv32); {266#false} is VALID [2022-02-20 16:40:05,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {266#false} assume ~bvsgt32(atan_float_~ix~1#1, 2139095040bv32);atan_float_#res#1 := ~fp.add~FLOAT(currentRoundingMode, atan_float_~x#1, atan_float_~x#1); {266#false} is VALID [2022-02-20 16:40:05,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {266#false} main_#t~ret27#1 := atan_float_#res#1;assume { :end_inline_atan_float } true;main_~res~0#1 := main_#t~ret27#1;havoc main_#t~ret27#1;main_#t~short29#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {266#false} is VALID [2022-02-20 16:40:05,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {266#false} assume !main_#t~short29#1; {266#false} is VALID [2022-02-20 16:40:05,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {266#false} assume !main_#t~short29#1;havoc main_#t~ret28#1;havoc main_#t~short29#1; {266#false} is VALID [2022-02-20 16:40:05,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {266#false} assume !false; {266#false} is VALID [2022-02-20 16:40:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:40:05,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:40:05,927 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:40:05,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162792940] [2022-02-20 16:40:05,927 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162792940] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:40:05,927 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:40:05,927 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:40:05,927 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808098246] [2022-02-20 16:40:05,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:40:05,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:40:05,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:40:05,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:05,965 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:05,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:40:05,965 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:40:05,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:40:05,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:40:05,966 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:16,217 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 16:40:23,662 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 16:40:38,013 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:40:41,218 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:40:43,809 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:40:48,949 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:40:48,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:48,950 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-02-20 16:40:49,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:40:49,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:40:49,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:40:49,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:49,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-02-20 16:40:49,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-02-20 16:40:49,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2022-02-20 16:40:50,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:40:50,366 INFO L225 Difference]: With dead ends: 43 [2022-02-20 16:40:50,366 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:40:50,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:40:50,367 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:40:50,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 120 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 4 Unknown, 13 Unchecked, 12.1s Time] [2022-02-20 16:40:50,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:40:50,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-02-20 16:40:50,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:40:50,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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:50,369 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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:50,370 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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:50,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:50,371 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-02-20 16:40:50,371 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-02-20 16:40:50,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:50,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:50,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-20 16:40:50,372 INFO L87 Difference]: Start difference. First operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 32 states. [2022-02-20 16:40:50,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:40:50,373 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-02-20 16:40:50,373 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-02-20 16:40:50,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:40:50,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:40:50,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:40:50,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:40:50,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-02-20 16:40:50,375 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 11 [2022-02-20 16:40:50,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:40:50,375 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-02-20 16:40:50,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:50,375 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-02-20 16:40:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:40:50,375 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:40:50,376 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:40:50,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 16:40:50,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:40:50,595 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:40:50,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:40:50,596 INFO L85 PathProgramCache]: Analyzing trace with hash -413875709, now seen corresponding path program 1 times [2022-02-20 16:40:50,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:40:50,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241874842] [2022-02-20 16:40:50,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:40:50,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:40:50,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:40:50,598 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:40:50,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:40:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:51,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 16:40:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:40:51,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:40:51,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~huge_floor~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~#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)); {460#true} is VALID [2022-02-20 16:40:51,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret27#1, main_#t~ret28#1, main_#t~short29#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~Pluszero~FLOAT();assume { :begin_inline_atan_float } true;atan_float_#in~x#1 := main_~x~0#1;havoc atan_float_#res#1;havoc atan_float_#t~mem6#1, atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset, atan_float_#t~mem7#1, atan_float_#t~mem8#1, atan_float_#t~mem9#1, atan_float_#t~mem10#1, atan_float_#t~ret11#1, atan_float_#t~mem17#1, atan_float_#t~mem16#1, atan_float_#t~mem15#1, atan_float_#t~mem14#1, atan_float_#t~mem13#1, atan_float_#t~mem12#1, atan_float_#t~mem22#1, atan_float_#t~mem21#1, atan_float_#t~mem20#1, atan_float_#t~mem19#1, atan_float_#t~mem18#1, atan_float_#t~mem24#1, atan_float_#t~mem23#1, atan_float_#t~ite25#1, atan_float_~x#1, atan_float_~w~0#1, atan_float_~s1~0#1, atan_float_~s2~0#1, atan_float_~z~0#1, atan_float_~ix~1#1, atan_float_~hx~0#1, atan_float_~id~0#1;atan_float_~x#1 := atan_float_#in~x#1;havoc atan_float_~w~0#1;havoc atan_float_~s1~0#1;havoc atan_float_~s2~0#1;havoc atan_float_~z~0#1;havoc atan_float_~ix~1#1;havoc atan_float_~hx~0#1;havoc atan_float_~id~0#1; {468#(= |ULTIMATE.start_atan_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:40:51,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {468#(= |ULTIMATE.start_atan_float_~x#1| (_ +zero 8 24))} call atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(atan_float_~x#1, atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset, 4bv32);call atan_float_#t~mem6#1 := read~intINTTYPE4(atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset, 4bv32);atan_float_~hx~0#1 := atan_float_#t~mem6#1;havoc atan_float_#t~mem6#1;call ULTIMATE.dealloc(atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset);havoc atan_float_~#gf_u~1#1.base, atan_float_~#gf_u~1#1.offset; {468#(= |ULTIMATE.start_atan_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:40:51,640 INFO L290 TraceCheckUtils]: 3: Hoare triple {468#(= |ULTIMATE.start_atan_float_~x#1| (_ +zero 8 24))} goto; {468#(= |ULTIMATE.start_atan_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:40:51,640 INFO L290 TraceCheckUtils]: 4: Hoare triple {468#(= |ULTIMATE.start_atan_float_~x#1| (_ +zero 8 24))} atan_float_~ix~1#1 := ~bvand32(2147483647bv32, atan_float_~hx~0#1); {468#(= |ULTIMATE.start_atan_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:40:51,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {468#(= |ULTIMATE.start_atan_float_~x#1| (_ +zero 8 24))} assume !~bvsge32(atan_float_~ix~1#1, 1350565888bv32); {468#(= |ULTIMATE.start_atan_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:40:51,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {468#(= |ULTIMATE.start_atan_float_~x#1| (_ +zero 8 24))} assume ~bvslt32(atan_float_~ix~1#1, 1054867456bv32); {468#(= |ULTIMATE.start_atan_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:40:51,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {468#(= |ULTIMATE.start_atan_float_~x#1| (_ +zero 8 24))} assume ~bvslt32(atan_float_~ix~1#1, 822083584bv32); {468#(= |ULTIMATE.start_atan_float_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:40:51,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {468#(= |ULTIMATE.start_atan_float_~x#1| (_ +zero 8 24))} assume ~fp.gt~FLOAT(~fp.add~FLOAT(currentRoundingMode, ~huge_atan~0, atan_float_~x#1), ~one_atan~0);atan_float_#res#1 := atan_float_~x#1; {490#(= |ULTIMATE.start_atan_float_#res#1| (_ +zero 8 24))} is VALID [2022-02-20 16:40:51,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {490#(= |ULTIMATE.start_atan_float_#res#1| (_ +zero 8 24))} main_#t~ret27#1 := atan_float_#res#1;assume { :end_inline_atan_float } true;main_~res~0#1 := main_#t~ret27#1;havoc main_#t~ret27#1;main_#t~short29#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {494#|ULTIMATE.start_main_#t~short29#1|} is VALID [2022-02-20 16:40:51,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {494#|ULTIMATE.start_main_#t~short29#1|} assume !main_#t~short29#1; {461#false} is VALID [2022-02-20 16:40:51,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {461#false} assume !main_#t~short29#1;havoc main_#t~ret28#1;havoc main_#t~short29#1; {461#false} is VALID [2022-02-20 16:40:51,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {461#false} assume !false; {461#false} is VALID [2022-02-20 16:40:51,643 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:51,643 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:40:51,643 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:40:51,643 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241874842] [2022-02-20 16:40:51,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241874842] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:40:51,643 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:40:51,643 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:40:51,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68942949] [2022-02-20 16:40:51,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:40:51,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:40:51,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:40:51,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:51,674 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:51,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:40:51,675 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:40:51,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:40:51,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:40:51,675 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:40:54,974 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []