./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0281.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_0281.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 232f7a655f6f2994683ec37dc98df7be72a1a46c6fd6dbf6a1ff9fd35a64400c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:37:54,100 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:37:54,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:37:54,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:37:54,133 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:37:54,136 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:37:54,138 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:37:54,140 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:37:54,142 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:37:54,146 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:37:54,147 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:37:54,148 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:37:54,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:37:54,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:37:54,152 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:37:54,153 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:37:54,154 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:37:54,155 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:37:54,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:37:54,162 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:37:54,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:37:54,166 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:37:54,167 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:37:54,168 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:37:54,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:37:54,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:37:54,176 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:37:54,177 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:37:54,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:37:54,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:37:54,179 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:37:54,179 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:37:54,180 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:37:54,181 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:37:54,182 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:37:54,182 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:37:54,183 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:37:54,183 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:37:54,183 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:37:54,184 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:37:54,185 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:37:54,186 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:37:54,216 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:37:54,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:37:54,217 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:37:54,217 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:37:54,218 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:37:54,218 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:37:54,219 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:37:54,219 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:37:54,219 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:37:54,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:37:54,219 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:37:54,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:37:54,219 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:37:54,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:37:54,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:37:54,220 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:37:54,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:37:54,220 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:37:54,220 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:37:54,220 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:37:54,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:37:54,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:37:54,221 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:37:54,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:37:54,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:37:54,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:37:54,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:37:54,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:37:54,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:37:54,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:37:54,221 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:37:54,222 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:37:54,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:37:54,222 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 -> 232f7a655f6f2994683ec37dc98df7be72a1a46c6fd6dbf6a1ff9fd35a64400c [2022-02-20 16:37:54,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:37:54,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:37:54,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:37:54,486 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:37:54,487 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:37:54,488 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0281.c [2022-02-20 16:37:54,540 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b8fb7daa/5190054494014068bcd48c522d1689a2/FLAG72ebf4473 [2022-02-20 16:37:54,972 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:37:54,975 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0281.c [2022-02-20 16:37:54,985 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b8fb7daa/5190054494014068bcd48c522d1689a2/FLAG72ebf4473 [2022-02-20 16:37:55,359 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b8fb7daa/5190054494014068bcd48c522d1689a2 [2022-02-20 16:37:55,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:37:55,364 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:37:55,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:37:55,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:37:55,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:37:55,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:37:55" (1/1) ... [2022-02-20 16:37:55,372 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e6d741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:55, skipping insertion in model container [2022-02-20 16:37:55,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:37:55" (1/1) ... [2022-02-20 16:37:55,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:37:55,407 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:37:55,644 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_0281.c[4632,4645] [2022-02-20 16:37:55,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:37:55,664 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:37:55,728 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_0281.c[4632,4645] [2022-02-20 16:37:55,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:37:55,741 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:37:55,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:55 WrapperNode [2022-02-20 16:37:55,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:37:55,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:37:55,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:37:55,744 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:37:55,749 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:37:55" (1/1) ... [2022-02-20 16:37:55,776 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:37:55" (1/1) ... [2022-02-20 16:37:55,823 INFO L137 Inliner]: procedures = 19, calls = 39, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 277 [2022-02-20 16:37:55,826 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:37:55,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:37:55,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:37:55,828 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:37:55,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:55" (1/1) ... [2022-02-20 16:37:55,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:55" (1/1) ... [2022-02-20 16:37:55,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:55" (1/1) ... [2022-02-20 16:37:55,845 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:55" (1/1) ... [2022-02-20 16:37:55,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:55" (1/1) ... [2022-02-20 16:37:55,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:55" (1/1) ... [2022-02-20 16:37:55,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:55" (1/1) ... [2022-02-20 16:37:55,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:37:55,894 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:37:55,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:37:55,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:37:55,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:55" (1/1) ... [2022-02-20 16:37:55,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:37:55,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:37:55,928 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:37:55,952 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:37:55,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:37:55,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:37:55,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:37:55,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:37:55,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:37:55,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:37:55,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:37:55,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:37:55,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:37:55,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:37:56,106 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:37:56,112 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:37:56,498 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:37:56,504 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:37:56,504 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-02-20 16:37:56,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:37:56 BoogieIcfgContainer [2022-02-20 16:37:56,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:37:56,507 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:37:56,508 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:37:56,510 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:37:56,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:37:55" (1/3) ... [2022-02-20 16:37:56,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f31486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:37:56, skipping insertion in model container [2022-02-20 16:37:56,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:55" (2/3) ... [2022-02-20 16:37:56,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f31486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:37:56, skipping insertion in model container [2022-02-20 16:37:56,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:37:56" (3/3) ... [2022-02-20 16:37:56,513 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0281.c [2022-02-20 16:37:56,517 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:37:56,517 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:37:56,556 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:37:56,561 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:37:56,562 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:37:56,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 66 states have (on average 1.7424242424242424) internal successors, (115), 67 states have internal predecessors, (115), 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:37:56,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:37:56,583 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:56,584 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:56,585 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:56,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:56,593 INFO L85 PathProgramCache]: Analyzing trace with hash 941419302, now seen corresponding path program 1 times [2022-02-20 16:37:56,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:37:56,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415950321] [2022-02-20 16:37:56,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:56,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:37:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:56,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {71#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~one_sqrt~0 := 1.0;~tiny_sqrt~0 := 1.0E-30;~one_asin~0 := 1.0;~huge_asin~0 := 1.0E30;~pio2_hi_asin~0 := 1.5707963705062866;~pio2_lo_asin~0 := ~someUnaryFLOAToperation(4.3711390001862426E-8);~pio4_hi_asin~0 := 0.7853981852531433;~pS0_asin~0 := 0.16666667163;~pS1_asin~0 := ~someUnaryDOUBLEoperation(0.32556581497);~pS2_asin~0 := 0.20121252537;~pS3_asin~0 := ~someUnaryDOUBLEoperation(0.040055535734);~pS4_asin~0 := 7.9153501429E-4;~pS5_asin~0 := 3.4793309169E-5;~qS1_asin~0 := ~someUnaryDOUBLEoperation(2.4033949375);~qS2_asin~0 := 2.0209457874;~qS3_asin~0 := ~someUnaryDOUBLEoperation(0.68828397989);~qS4_asin~0 := 0.077038154006; {71#true} is VALID [2022-02-20 16:37:56,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {71#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~ret18#1, main_#t~ret19#1, main_~res~0#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {71#true} is VALID [2022-02-20 16:37:56,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {71#true} assume ~someBinaryFLOATComparisonOperation(main_~x~0#1, ~someUnaryFLOAToperation(1.0)) || ~someBinaryFLOATComparisonOperation(main_~x~0#1, 1.0);assume { :begin_inline___ieee754_asinf } true;__ieee754_asinf_#in~x#1 := main_~x~0#1;havoc __ieee754_asinf_#res#1;havoc __ieee754_asinf_#t~mem11#1, __ieee754_asinf_~#gf_u~2#1.base, __ieee754_asinf_~#gf_u~2#1.offset, __ieee754_asinf_#t~ret13#1, __ieee754_asinf_#t~ret14#1, __ieee754_asinf_#t~mem15#1, __ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset, __ieee754_asinf_#t~mem16#1, __ieee754_asinf_~#sf_u~2#1.base, __ieee754_asinf_~#sf_u~2#1.offset, __ieee754_asinf_~iw~0#1, __ieee754_asinf_~x#1, __ieee754_asinf_~t~1#1, __ieee754_asinf_~w~0#1, __ieee754_asinf_~p~0#1, __ieee754_asinf_~q~1#1, __ieee754_asinf_~c~0#1, __ieee754_asinf_~r~1#1, __ieee754_asinf_~s~1#1, __ieee754_asinf_~hx~1#1, __ieee754_asinf_~ix~2#1, __ieee754_asinf_#t~nondet12#1;__ieee754_asinf_~x#1 := __ieee754_asinf_#in~x#1;havoc __ieee754_asinf_~t~1#1;havoc __ieee754_asinf_~w~0#1;havoc __ieee754_asinf_~p~0#1;havoc __ieee754_asinf_~q~1#1;havoc __ieee754_asinf_~c~0#1;havoc __ieee754_asinf_~r~1#1;havoc __ieee754_asinf_~s~1#1;havoc __ieee754_asinf_~hx~1#1;havoc __ieee754_asinf_~ix~2#1; {71#true} is VALID [2022-02-20 16:37:56,782 INFO L290 TraceCheckUtils]: 3: Hoare triple {71#true} assume !true; {72#false} is VALID [2022-02-20 16:37:56,782 INFO L290 TraceCheckUtils]: 4: Hoare triple {72#false} assume 0 == __ieee754_asinf_~hx~1#1;__ieee754_asinf_~ix~2#1 := 0; {72#false} is VALID [2022-02-20 16:37:56,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {72#false} assume 1065353216 == __ieee754_asinf_~ix~2#1;__ieee754_asinf_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(__ieee754_asinf_~x#1, ~pio2_hi_asin~0), ~someBinaryArithmeticFLOAToperation(__ieee754_asinf_~x#1, ~pio2_lo_asin~0)); {72#false} is VALID [2022-02-20 16:37:56,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {72#false} main_#t~ret18#1 := __ieee754_asinf_#res#1;assume { :end_inline___ieee754_asinf } true;main_~res~0#1 := main_#t~ret18#1;havoc main_#t~ret18#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x#1, isnan_float_~x#1) then 1 else 0); {72#false} is VALID [2022-02-20 16:37:56,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {72#false} main_#t~ret19#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret19#1 && main_#t~ret19#1 <= 2147483647; {72#false} is VALID [2022-02-20 16:37:56,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {72#false} assume 0 == main_#t~ret19#1;havoc main_#t~ret19#1; {72#false} is VALID [2022-02-20 16:37:56,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {72#false} assume !false; {72#false} is VALID [2022-02-20 16:37:56,785 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:37:56,785 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:37:56,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415950321] [2022-02-20 16:37:56,787 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415950321] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:56,787 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:56,788 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:37:56,789 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658330565] [2022-02-20 16:37:56,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:56,795 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:37:56,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:56,799 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:37:56,817 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:37:56,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:37:56,818 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:37:56,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:37:56,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:37:56,845 INFO L87 Difference]: Start difference. First operand has 68 states, 66 states have (on average 1.7424242424242424) internal successors, (115), 67 states have internal predecessors, (115), 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:37:56,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:56,954 INFO L93 Difference]: Finished difference Result 133 states and 226 transitions. [2022-02-20 16:37:56,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:37:56,955 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:37:56,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:56,956 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:37:56,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 226 transitions. [2022-02-20 16:37:56,965 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:37:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 226 transitions. [2022-02-20 16:37:56,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 226 transitions. [2022-02-20 16:37:57,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:57,180 INFO L225 Difference]: With dead ends: 133 [2022-02-20 16:37:57,180 INFO L226 Difference]: Without dead ends: 64 [2022-02-20 16:37:57,183 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:37:57,186 INFO L933 BasicCegarLoop]: 91 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, 91 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:37:57,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:37:57,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-20 16:37:57,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-02-20 16:37:57,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:57,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 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:37:57,217 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 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:37:57,217 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 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:37:57,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:57,221 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2022-02-20 16:37:57,221 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2022-02-20 16:37:57,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:57,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:57,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 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 64 states. [2022-02-20 16:37:57,223 INFO L87 Difference]: Start difference. First operand has 64 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 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 64 states. [2022-02-20 16:37:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:57,226 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2022-02-20 16:37:57,226 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2022-02-20 16:37:57,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:57,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:57,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:57,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:57,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 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:37:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2022-02-20 16:37:57,247 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 86 transitions. Word has length 10 [2022-02-20 16:37:57,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:57,248 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 86 transitions. [2022-02-20 16:37:57,248 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:37:57,248 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2022-02-20 16:37:57,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:37:57,249 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:57,250 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:57,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:37:57,253 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:57,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:57,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1360793278, now seen corresponding path program 1 times [2022-02-20 16:37:57,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:37:57,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930098566] [2022-02-20 16:37:57,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:57,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:37:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:57,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {435#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~one_sqrt~0 := 1.0;~tiny_sqrt~0 := 1.0E-30;~one_asin~0 := 1.0;~huge_asin~0 := 1.0E30;~pio2_hi_asin~0 := 1.5707963705062866;~pio2_lo_asin~0 := ~someUnaryFLOAToperation(4.3711390001862426E-8);~pio4_hi_asin~0 := 0.7853981852531433;~pS0_asin~0 := 0.16666667163;~pS1_asin~0 := ~someUnaryDOUBLEoperation(0.32556581497);~pS2_asin~0 := 0.20121252537;~pS3_asin~0 := ~someUnaryDOUBLEoperation(0.040055535734);~pS4_asin~0 := 7.9153501429E-4;~pS5_asin~0 := 3.4793309169E-5;~qS1_asin~0 := ~someUnaryDOUBLEoperation(2.4033949375);~qS2_asin~0 := 2.0209457874;~qS3_asin~0 := ~someUnaryDOUBLEoperation(0.68828397989);~qS4_asin~0 := 0.077038154006; {435#true} is VALID [2022-02-20 16:37:57,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet17#1, main_#t~ret18#1, main_#t~ret19#1, main_~res~0#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1; {435#true} is VALID [2022-02-20 16:37:57,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {435#true} assume ~someBinaryFLOATComparisonOperation(main_~x~0#1, ~someUnaryFLOAToperation(1.0)) || ~someBinaryFLOATComparisonOperation(main_~x~0#1, 1.0);assume { :begin_inline___ieee754_asinf } true;__ieee754_asinf_#in~x#1 := main_~x~0#1;havoc __ieee754_asinf_#res#1;havoc __ieee754_asinf_#t~mem11#1, __ieee754_asinf_~#gf_u~2#1.base, __ieee754_asinf_~#gf_u~2#1.offset, __ieee754_asinf_#t~ret13#1, __ieee754_asinf_#t~ret14#1, __ieee754_asinf_#t~mem15#1, __ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset, __ieee754_asinf_#t~mem16#1, __ieee754_asinf_~#sf_u~2#1.base, __ieee754_asinf_~#sf_u~2#1.offset, __ieee754_asinf_~iw~0#1, __ieee754_asinf_~x#1, __ieee754_asinf_~t~1#1, __ieee754_asinf_~w~0#1, __ieee754_asinf_~p~0#1, __ieee754_asinf_~q~1#1, __ieee754_asinf_~c~0#1, __ieee754_asinf_~r~1#1, __ieee754_asinf_~s~1#1, __ieee754_asinf_~hx~1#1, __ieee754_asinf_~ix~2#1, __ieee754_asinf_#t~nondet12#1;__ieee754_asinf_~x#1 := __ieee754_asinf_#in~x#1;havoc __ieee754_asinf_~t~1#1;havoc __ieee754_asinf_~w~0#1;havoc __ieee754_asinf_~p~0#1;havoc __ieee754_asinf_~q~1#1;havoc __ieee754_asinf_~c~0#1;havoc __ieee754_asinf_~r~1#1;havoc __ieee754_asinf_~s~1#1;havoc __ieee754_asinf_~hx~1#1;havoc __ieee754_asinf_~ix~2#1; {435#true} is VALID [2022-02-20 16:37:57,358 INFO L290 TraceCheckUtils]: 3: Hoare triple {435#true} call __ieee754_asinf_~#gf_u~2#1.base, __ieee754_asinf_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4);call write~real(__ieee754_asinf_~x#1, __ieee754_asinf_~#gf_u~2#1.base, __ieee754_asinf_~#gf_u~2#1.offset, 4);call __ieee754_asinf_#t~mem11#1 := read~int(__ieee754_asinf_~#gf_u~2#1.base, __ieee754_asinf_~#gf_u~2#1.offset, 4);__ieee754_asinf_~hx~1#1 := (if __ieee754_asinf_#t~mem11#1 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_asinf_#t~mem11#1 % 4294967296 % 4294967296 else __ieee754_asinf_#t~mem11#1 % 4294967296 % 4294967296 - 4294967296);havoc __ieee754_asinf_#t~mem11#1;call ULTIMATE.dealloc(__ieee754_asinf_~#gf_u~2#1.base, __ieee754_asinf_~#gf_u~2#1.offset);havoc __ieee754_asinf_~#gf_u~2#1.base, __ieee754_asinf_~#gf_u~2#1.offset; {435#true} is VALID [2022-02-20 16:37:57,359 INFO L290 TraceCheckUtils]: 4: Hoare triple {435#true} goto; {435#true} is VALID [2022-02-20 16:37:57,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {435#true} assume 0 == __ieee754_asinf_~hx~1#1;__ieee754_asinf_~ix~2#1 := 0; {437#(= |ULTIMATE.start___ieee754_asinf_~ix~2#1| 0)} is VALID [2022-02-20 16:37:57,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {437#(= |ULTIMATE.start___ieee754_asinf_~ix~2#1| 0)} assume 1065353216 == __ieee754_asinf_~ix~2#1;__ieee754_asinf_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(__ieee754_asinf_~x#1, ~pio2_hi_asin~0), ~someBinaryArithmeticFLOAToperation(__ieee754_asinf_~x#1, ~pio2_lo_asin~0)); {436#false} is VALID [2022-02-20 16:37:57,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {436#false} main_#t~ret18#1 := __ieee754_asinf_#res#1;assume { :end_inline___ieee754_asinf } true;main_~res~0#1 := main_#t~ret18#1;havoc main_#t~ret18#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x#1, isnan_float_~x#1) then 1 else 0); {436#false} is VALID [2022-02-20 16:37:57,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {436#false} main_#t~ret19#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret19#1 && main_#t~ret19#1 <= 2147483647; {436#false} is VALID [2022-02-20 16:37:57,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {436#false} assume 0 == main_#t~ret19#1;havoc main_#t~ret19#1; {436#false} is VALID [2022-02-20 16:37:57,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {436#false} assume !false; {436#false} is VALID [2022-02-20 16:37:57,362 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:37:57,362 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:37:57,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930098566] [2022-02-20 16:37:57,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930098566] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:57,363 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:57,363 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:37:57,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925664438] [2022-02-20 16:37:57,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:57,365 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:37:57,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:57,365 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:37:57,375 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:37:57,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:37:57,376 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:37:57,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:37:57,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:37:57,378 INFO L87 Difference]: Start difference. First operand 64 states and 86 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:37:57,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:57,589 INFO L93 Difference]: Finished difference Result 169 states and 226 transitions. [2022-02-20 16:37:57,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:37:57,589 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:37:57,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:57,590 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:37:57,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2022-02-20 16:37:57,593 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:37:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2022-02-20 16:37:57,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 226 transitions. [2022-02-20 16:37:57,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:57,803 INFO L225 Difference]: With dead ends: 169 [2022-02-20 16:37:57,803 INFO L226 Difference]: Without dead ends: 119 [2022-02-20 16:37:57,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:37:57,810 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 70 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:57,810 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 159 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:37:57,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-02-20 16:37:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108. [2022-02-20 16:37:57,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:57,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 108 states, 107 states have (on average 1.355140186915888) internal successors, (145), 107 states have internal predecessors, (145), 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:37:57,831 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 108 states, 107 states have (on average 1.355140186915888) internal successors, (145), 107 states have internal predecessors, (145), 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:37:57,832 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 108 states, 107 states have (on average 1.355140186915888) internal successors, (145), 107 states have internal predecessors, (145), 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:37:57,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:57,837 INFO L93 Difference]: Finished difference Result 119 states and 156 transitions. [2022-02-20 16:37:57,837 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 156 transitions. [2022-02-20 16:37:57,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:57,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:57,840 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 107 states have (on average 1.355140186915888) internal successors, (145), 107 states have internal predecessors, (145), 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 119 states. [2022-02-20 16:37:57,840 INFO L87 Difference]: Start difference. First operand has 108 states, 107 states have (on average 1.355140186915888) internal successors, (145), 107 states have internal predecessors, (145), 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 119 states. [2022-02-20 16:37:57,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:57,844 INFO L93 Difference]: Finished difference Result 119 states and 156 transitions. [2022-02-20 16:37:57,845 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 156 transitions. [2022-02-20 16:37:57,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:57,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:57,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:57,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:57,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.355140186915888) internal successors, (145), 107 states have internal predecessors, (145), 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:37:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 145 transitions. [2022-02-20 16:37:57,850 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 145 transitions. Word has length 11 [2022-02-20 16:37:57,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:57,850 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 145 transitions. [2022-02-20 16:37:57,850 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:37:57,851 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 145 transitions. [2022-02-20 16:37:57,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:37:57,851 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:57,851 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:57,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:37:57,852 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:57,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:57,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1895440770, now seen corresponding path program 1 times [2022-02-20 16:37:57,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:37:57,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436783881] [2022-02-20 16:37:57,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:57,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:37:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:37:57,914 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:37:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:37:57,989 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:37:57,989 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:37:57,990 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:37:57,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:37:57,994 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:37:57,996 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:37:58,026 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:37:58,026 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:37:58,026 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2022-02-20 16:37:58,026 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2022-02-20 16:37:58,026 WARN L170 areAnnotationChecker]: L113-2 has no Hoare annotation [2022-02-20 16:37:58,026 WARN L170 areAnnotationChecker]: L113-2 has no Hoare annotation [2022-02-20 16:37:58,026 WARN L170 areAnnotationChecker]: L188-2 has no Hoare annotation [2022-02-20 16:37:58,027 WARN L170 areAnnotationChecker]: L113-1 has no Hoare annotation [2022-02-20 16:37:58,027 WARN L170 areAnnotationChecker]: L113-1 has no Hoare annotation [2022-02-20 16:37:58,027 WARN L170 areAnnotationChecker]: L113-3 has no Hoare annotation [2022-02-20 16:37:58,027 WARN L170 areAnnotationChecker]: L113-3 has no Hoare annotation [2022-02-20 16:37:58,027 WARN L170 areAnnotationChecker]: L199 has no Hoare annotation [2022-02-20 16:37:58,027 WARN L170 areAnnotationChecker]: L118-7 has no Hoare annotation [2022-02-20 16:37:58,027 WARN L170 areAnnotationChecker]: L118-7 has no Hoare annotation [2022-02-20 16:37:58,027 WARN L170 areAnnotationChecker]: L118-1 has no Hoare annotation [2022-02-20 16:37:58,027 WARN L170 areAnnotationChecker]: L118-1 has no Hoare annotation [2022-02-20 16:37:58,027 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:37:58,027 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2022-02-20 16:37:58,028 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2022-02-20 16:37:58,028 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2022-02-20 16:37:58,028 WARN L170 areAnnotationChecker]: L118-3 has no Hoare annotation [2022-02-20 16:37:58,028 WARN L170 areAnnotationChecker]: L118-3 has no Hoare annotation [2022-02-20 16:37:58,028 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 16:37:58,028 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:37:58,028 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:37:58,028 WARN L170 areAnnotationChecker]: L118-5 has no Hoare annotation [2022-02-20 16:37:58,028 WARN L170 areAnnotationChecker]: L118-5 has no Hoare annotation [2022-02-20 16:37:58,028 WARN L170 areAnnotationChecker]: L193 has no Hoare annotation [2022-02-20 16:37:58,028 WARN L170 areAnnotationChecker]: L193 has no Hoare annotation [2022-02-20 16:37:58,029 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-02-20 16:37:58,029 WARN L170 areAnnotationChecker]: L125 has no Hoare annotation [2022-02-20 16:37:58,029 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-02-20 16:37:58,029 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-02-20 16:37:58,029 WARN L170 areAnnotationChecker]: L194 has no Hoare annotation [2022-02-20 16:37:58,029 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-02-20 16:37:58,029 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-02-20 16:37:58,029 WARN L170 areAnnotationChecker]: L87-2 has no Hoare annotation [2022-02-20 16:37:58,029 WARN L170 areAnnotationChecker]: L87-2 has no Hoare annotation [2022-02-20 16:37:58,029 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2022-02-20 16:37:58,029 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2022-02-20 16:37:58,030 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-02-20 16:37:58,030 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-02-20 16:37:58,030 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-02-20 16:37:58,030 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-02-20 16:37:58,030 WARN L170 areAnnotationChecker]: L92-2 has no Hoare annotation [2022-02-20 16:37:58,030 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-02-20 16:37:58,030 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-02-20 16:37:58,030 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-02-20 16:37:58,030 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 16:37:58,030 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 16:37:58,030 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 16:37:58,030 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 16:37:58,031 WARN L170 areAnnotationChecker]: L29-7 has no Hoare annotation [2022-02-20 16:37:58,031 WARN L170 areAnnotationChecker]: L29-7 has no Hoare annotation [2022-02-20 16:37:58,031 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-20 16:37:58,031 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-20 16:37:58,031 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-02-20 16:37:58,031 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:37:58,031 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:37:58,031 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-02-20 16:37:58,031 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-02-20 16:37:58,031 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2022-02-20 16:37:58,031 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2022-02-20 16:37:58,032 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:37:58,032 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:37:58,032 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2022-02-20 16:37:58,032 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2022-02-20 16:37:58,032 WARN L170 areAnnotationChecker]: L150-2 has no Hoare annotation [2022-02-20 16:37:58,032 WARN L170 areAnnotationChecker]: L150-2 has no Hoare annotation [2022-02-20 16:37:58,032 WARN L170 areAnnotationChecker]: L156-2 has no Hoare annotation [2022-02-20 16:37:58,032 WARN L170 areAnnotationChecker]: L156-2 has no Hoare annotation [2022-02-20 16:37:58,032 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:37:58,032 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:37:58,032 WARN L170 areAnnotationChecker]: L156-1 has no Hoare annotation [2022-02-20 16:37:58,033 WARN L170 areAnnotationChecker]: L156-1 has no Hoare annotation [2022-02-20 16:37:58,033 WARN L170 areAnnotationChecker]: L161-1 has no Hoare annotation [2022-02-20 16:37:58,033 WARN L170 areAnnotationChecker]: L161-1 has no Hoare annotation [2022-02-20 16:37:58,033 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-02-20 16:37:58,033 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-02-20 16:37:58,033 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-02-20 16:37:58,033 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-20 16:37:58,033 WARN L170 areAnnotationChecker]: L161 has no Hoare annotation [2022-02-20 16:37:58,033 WARN L170 areAnnotationChecker]: L161 has no Hoare annotation [2022-02-20 16:37:58,033 WARN L170 areAnnotationChecker]: L161-2 has no Hoare annotation [2022-02-20 16:37:58,033 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2022-02-20 16:37:58,033 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 16:37:58,034 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:37:58,034 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:37:58,034 WARN L170 areAnnotationChecker]: L46-8 has no Hoare annotation [2022-02-20 16:37:58,034 WARN L170 areAnnotationChecker]: L46-8 has no Hoare annotation [2022-02-20 16:37:58,034 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2022-02-20 16:37:58,034 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2022-02-20 16:37:58,034 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-02-20 16:37:58,034 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-02-20 16:37:58,034 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-02-20 16:37:58,034 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:37:58,034 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:37:58,034 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:37:58,035 WARN L170 areAnnotationChecker]: L46-6 has no Hoare annotation [2022-02-20 16:37:58,035 WARN L170 areAnnotationChecker]: L46-6 has no Hoare annotation [2022-02-20 16:37:58,035 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2022-02-20 16:37:58,035 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2022-02-20 16:37:58,035 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:37:58,035 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:37:58,035 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:37:58,035 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:37:58,035 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:37:58,035 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-02-20 16:37:58,035 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:37:58,036 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:37:58,036 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:37:58,036 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:37:58,036 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:37:58,036 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:37:58,036 WARN L170 areAnnotationChecker]: L78-3 has no Hoare annotation [2022-02-20 16:37:58,036 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:37:58,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:37:58 BoogieIcfgContainer [2022-02-20 16:37:58,037 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:37:58,043 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:37:58,044 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:37:58,044 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:37:58,044 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:37:56" (3/4) ... [2022-02-20 16:37:58,047 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:37:58,047 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:37:58,048 INFO L158 Benchmark]: Toolchain (without parser) took 2683.59ms. Allocated memory was 81.8MB in the beginning and 132.1MB in the end (delta: 50.3MB). Free memory was 47.5MB in the beginning and 94.7MB in the end (delta: -47.2MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2022-02-20 16:37:58,049 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 81.8MB. Free memory was 60.4MB in the beginning and 60.4MB in the end (delta: 18.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:37:58,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.23ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 47.3MB in the beginning and 69.8MB in the end (delta: -22.5MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2022-02-20 16:37:58,052 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.35ms. Allocated memory is still 98.6MB. Free memory was 69.8MB in the beginning and 66.2MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:37:58,053 INFO L158 Benchmark]: Boogie Preprocessor took 66.37ms. Allocated memory is still 98.6MB. Free memory was 66.2MB in the beginning and 63.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:37:58,053 INFO L158 Benchmark]: RCFGBuilder took 611.74ms. Allocated memory is still 98.6MB. Free memory was 63.9MB in the beginning and 62.0MB in the end (delta: 1.9MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2022-02-20 16:37:58,056 INFO L158 Benchmark]: TraceAbstraction took 1529.73ms. Allocated memory was 98.6MB in the beginning and 132.1MB in the end (delta: 33.6MB). Free memory was 61.2MB in the beginning and 95.6MB in the end (delta: -34.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:37:58,056 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 132.1MB. Free memory was 95.6MB in the beginning and 94.7MB in the end (delta: 839.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:37:58,059 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.18ms. Allocated memory is still 81.8MB. Free memory was 60.4MB in the beginning and 60.4MB in the end (delta: 18.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.23ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 47.3MB in the beginning and 69.8MB in the end (delta: -22.5MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.35ms. Allocated memory is still 98.6MB. Free memory was 69.8MB in the beginning and 66.2MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.37ms. Allocated memory is still 98.6MB. Free memory was 66.2MB in the beginning and 63.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 611.74ms. Allocated memory is still 98.6MB. Free memory was 63.9MB in the beginning and 62.0MB in the end (delta: 1.9MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1529.73ms. Allocated memory was 98.6MB in the beginning and 132.1MB in the end (delta: 33.6MB). Free memory was 61.2MB in the beginning and 95.6MB in the end (delta: -34.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 132.1MB. Free memory was 95.6MB in the beginning and 94.7MB in the end (delta: 839.9kB). Peak memory consumption was 2.1MB. 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: 194]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 15, overapproximation of someUnaryDOUBLEoperation at line 104, overapproximation of someUnaryFLOAToperation at line 102, overapproximation of someBinaryArithmeticFLOAToperation at line 121. Possible FailurePath: [L17] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; [L100-L108] static const float one_asin = 1.0000000000e+00, huge_asin = 1.000e+30, pio2_hi_asin = 1.57079637050628662109375f, pio2_lo_asin = -4.37113900018624283e-8f, pio4_hi_asin = 0.785398185253143310546875f, pS0_asin = 1.6666667163e-01, pS1_asin = -3.2556581497e-01, pS2_asin = 2.0121252537e-01, pS3_asin = -4.0055535734e-02, pS4_asin = 7.9153501429e-04, pS5_asin = 3.4793309169e-05, qS1_asin = -2.4033949375e+00, qS2_asin = 2.0209457874e+00, qS3_asin = -6.8828397989e-01, qS4_asin = 7.7038154006e-02; VAL [huge_asin=1000000000000000000000000000000, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000] [L186] float x = __VERIFIER_nondet_float(); [L188] COND TRUE x < -1.0f || x > 1.0f [L190] CALL, EXPR __ieee754_asinf(x) [L111] float t, w, p, q, c, r, s; [L112] __int32_t hx, ix; VAL [\old(x)=1000000000000000000000000000002, huge_asin=1000000000000000000000000000000, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000002] [L114] ieee_float_shape_type gf_u; [L115] gf_u.value = (x) [L116] EXPR gf_u.word [L116] (hx) = gf_u.word [L118] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000002, huge_asin=1000000000000000000000000000000, hx=2147483647, ix=1065353216, ix = hx & 0x7fffffff=2147483647, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000002] [L119] COND TRUE ix == 0x3f800000 [L121] return x * pio2_hi_asin + x * pio2_lo_asin; VAL [\old(x)=1000000000000000000000000000002, huge_asin=1000000000000000000000000000000, hx=2147483647, ix=1065353216, ix = hx & 0x7fffffff=2147483647, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000002] [L190] RET, EXPR __ieee754_asinf(x) [L190] float res = __ieee754_asinf(x); [L193] CALL, EXPR isnan_float(res) [L15] return x != x; VAL [\old(x)=1000000000000000000000000000001, \result=0, huge_asin=1000000000000000000000000000000, ix = hx & 0x7fffffff=2147483647, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000001] [L193] RET, EXPR isnan_float(res) [L193] COND TRUE !isnan_float(res) [L194] reach_error() VAL [huge_asin=1000000000000000000000000000000, ix = hx & 0x7fffffff=2147483647, one_asin=1, one_sqrt=1, pio2_hi_asin=13176795/8388608, pio4_hi_asin=13176795/16777216, pS0_asin=16666667163/100000000000, pS2_asin=20121252537/100000000000, pS4_asin=79153501429/100000000000000, pS5_asin=34793309169/1000000000000000, qS2_asin=10104728937/5000000000, qS4_asin=38519077003/500000000000, res=1000000000000000000000000000001, tiny_sqrt=1/1000000000000000000000000000000, x=1000000000000000000000000000002] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 250 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 178 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 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:37:58,093 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_0281.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 232f7a655f6f2994683ec37dc98df7be72a1a46c6fd6dbf6a1ff9fd35a64400c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:37:59,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:37:59,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:38:00,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:38:00,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:38:00,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:38:00,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:38:00,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:38:00,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:38:00,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:38:00,031 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:38:00,033 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:38:00,033 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:38:00,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:38:00,035 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:38:00,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:38:00,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:38:00,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:38:00,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:38:00,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:38:00,041 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:38:00,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:38:00,043 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:38:00,043 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:38:00,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:38:00,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:38:00,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:38:00,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:38:00,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:38:00,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:38:00,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:38:00,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:38:00,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:38:00,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:38:00,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:38:00,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:38:00,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:38:00,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:38:00,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:38:00,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:38:00,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:38:00,054 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:38:00,075 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:38:00,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:38:00,082 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:38:00,082 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:38:00,083 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:38:00,083 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:38:00,084 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:38:00,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:38:00,085 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:38:00,085 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:38:00,086 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:38:00,086 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:38:00,086 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:38:00,086 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:38:00,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:38:00,087 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:38:00,087 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:38:00,087 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:38:00,087 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:38:00,087 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:38:00,088 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:38:00,088 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:38:00,088 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:38:00,088 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:38:00,088 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:38:00,088 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:38:00,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:38:00,089 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:38:00,089 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:38:00,089 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:38:00,089 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:38:00,090 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:38:00,090 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:38:00,090 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:38:00,090 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:38:00,091 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:38:00,091 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 -> 232f7a655f6f2994683ec37dc98df7be72a1a46c6fd6dbf6a1ff9fd35a64400c [2022-02-20 16:38:00,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:38:00,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:38:00,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:38:00,450 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:38:00,451 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:38:00,452 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0281.c [2022-02-20 16:38:00,505 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ec756aaa/4e465b62ab8e493287f84104142ffd13/FLAG1f49b9416 [2022-02-20 16:38:00,994 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:38:00,995 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0281.c [2022-02-20 16:38:01,000 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ec756aaa/4e465b62ab8e493287f84104142ffd13/FLAG1f49b9416 [2022-02-20 16:38:01,014 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ec756aaa/4e465b62ab8e493287f84104142ffd13 [2022-02-20 16:38:01,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:38:01,018 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:38:01,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:38:01,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:38:01,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:38:01,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:38:01" (1/1) ... [2022-02-20 16:38:01,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15ecb23f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:38:01, skipping insertion in model container [2022-02-20 16:38:01,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:38:01" (1/1) ... [2022-02-20 16:38:01,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:38:01,046 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:38:01,198 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_0281.c[4632,4645] [2022-02-20 16:38:01,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:38:01,213 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:38:01,267 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_0281.c[4632,4645] [2022-02-20 16:38:01,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:38:01,290 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:38:01,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:38:01 WrapperNode [2022-02-20 16:38:01,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:38:01,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:38:01,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:38:01,292 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:38:01,298 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:38:01" (1/1) ... [2022-02-20 16:38:01,309 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:38:01" (1/1) ... [2022-02-20 16:38:01,347 INFO L137 Inliner]: procedures = 22, calls = 39, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 242 [2022-02-20 16:38:01,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:38:01,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:38:01,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:38:01,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:38:01,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:38:01" (1/1) ... [2022-02-20 16:38:01,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:38:01" (1/1) ... [2022-02-20 16:38:01,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:38:01" (1/1) ... [2022-02-20 16:38:01,362 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:38:01" (1/1) ... [2022-02-20 16:38:01,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:38:01" (1/1) ... [2022-02-20 16:38:01,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:38:01" (1/1) ... [2022-02-20 16:38:01,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:38:01" (1/1) ... [2022-02-20 16:38:01,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:38:01,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:38:01,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:38:01,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:38:01,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:38:01" (1/1) ... [2022-02-20 16:38:01,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:38:01,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:38:01,420 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:38:01,439 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:38:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:38:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:38:01,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:38:01,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:38:01,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:38:01,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:38:01,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:38:01,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:38:01,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:38:01,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:38:01,583 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:38:01,584 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:38:13,795 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:38:13,801 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:38:13,801 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-02-20 16:38:13,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:38:13 BoogieIcfgContainer [2022-02-20 16:38:13,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:38:13,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:38:13,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:38:13,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:38:13,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:38:01" (1/3) ... [2022-02-20 16:38:13,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14670e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:38:13, skipping insertion in model container [2022-02-20 16:38:13,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:38:01" (2/3) ... [2022-02-20 16:38:13,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14670e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:38:13, skipping insertion in model container [2022-02-20 16:38:13,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:38:13" (3/3) ... [2022-02-20 16:38:13,810 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0281.c [2022-02-20 16:38:13,814 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:38:13,814 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:38:13,846 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:38:13,852 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:38:13,852 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:38:13,870 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 56 states have (on average 1.6607142857142858) internal successors, (93), 57 states have internal predecessors, (93), 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:38:13,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:38:13,873 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:38:13,874 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:38:13,875 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:38:13,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:38:13,883 INFO L85 PathProgramCache]: Analyzing trace with hash 863812756, now seen corresponding path program 1 times [2022-02-20 16:38:13,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:38:13,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110851486] [2022-02-20 16:38:13,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:38:13,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:38:13,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:38:13,894 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:38:13,896 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:38:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:38:14,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:38:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:38:14,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:38:14,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {61#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30));~one_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~huge_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~pio2_hi_asin~0 := ~to_fp~FLOAT(currentRoundingMode, 1.5707963705062866);~pio2_lo_asin~0 := ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 4.3711390001862426E-8));~pio4_hi_asin~0 := ~to_fp~FLOAT(currentRoundingMode, 0.7853981852531433);~pS0_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.16666667163));~pS1_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.32556581497)));~pS2_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.20121252537));~pS3_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.040055535734)));~pS4_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.9153501429E-4));~pS5_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.4793309169E-5));~qS1_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.4033949375)));~qS2_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 2.0209457874));~qS3_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.68828397989)));~qS4_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.077038154006)); {61#true} is VALID [2022-02-20 16:38:14,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {61#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~ret15#1, main_#t~ret16#1, main_~res~0#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {61#true} is VALID [2022-02-20 16:38:14,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {61#true} assume ~fp.lt~FLOAT(main_~x~0#1, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0))) || ~fp.gt~FLOAT(main_~x~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0));assume { :begin_inline___ieee754_asinf } true;__ieee754_asinf_#in~x#1 := main_~x~0#1;havoc __ieee754_asinf_#res#1;havoc __ieee754_asinf_#t~mem9#1, __ieee754_asinf_~#gf_u~2#1.base, __ieee754_asinf_~#gf_u~2#1.offset, __ieee754_asinf_#t~ret10#1, __ieee754_asinf_#t~ret11#1, __ieee754_asinf_#t~mem12#1, __ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset, __ieee754_asinf_#t~mem13#1, __ieee754_asinf_~#sf_u~2#1.base, __ieee754_asinf_~#sf_u~2#1.offset, __ieee754_asinf_~iw~0#1, __ieee754_asinf_~x#1, __ieee754_asinf_~t~1#1, __ieee754_asinf_~w~0#1, __ieee754_asinf_~p~0#1, __ieee754_asinf_~q~1#1, __ieee754_asinf_~c~0#1, __ieee754_asinf_~r~1#1, __ieee754_asinf_~s~1#1, __ieee754_asinf_~hx~1#1, __ieee754_asinf_~ix~2#1;__ieee754_asinf_~x#1 := __ieee754_asinf_#in~x#1;havoc __ieee754_asinf_~t~1#1;havoc __ieee754_asinf_~w~0#1;havoc __ieee754_asinf_~p~0#1;havoc __ieee754_asinf_~q~1#1;havoc __ieee754_asinf_~c~0#1;havoc __ieee754_asinf_~r~1#1;havoc __ieee754_asinf_~s~1#1;havoc __ieee754_asinf_~hx~1#1;havoc __ieee754_asinf_~ix~2#1; {61#true} is VALID [2022-02-20 16:38:14,480 INFO L290 TraceCheckUtils]: 3: Hoare triple {61#true} assume !true; {62#false} is VALID [2022-02-20 16:38:14,480 INFO L290 TraceCheckUtils]: 4: Hoare triple {62#false} __ieee754_asinf_~ix~2#1 := ~bvand32(2147483647bv32, __ieee754_asinf_~hx~1#1); {62#false} is VALID [2022-02-20 16:38:14,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {62#false} assume 1065353216bv32 == __ieee754_asinf_~ix~2#1;__ieee754_asinf_#res#1 := ~fp.add~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, __ieee754_asinf_~x#1, ~pio2_hi_asin~0), ~fp.mul~FLOAT(currentRoundingMode, __ieee754_asinf_~x#1, ~pio2_lo_asin~0)); {62#false} is VALID [2022-02-20 16:38:14,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {62#false} main_#t~ret15#1 := __ieee754_asinf_#res#1;assume { :end_inline___ieee754_asinf } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {62#false} is VALID [2022-02-20 16:38:14,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {62#false} main_#t~ret16#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {62#false} is VALID [2022-02-20 16:38:14,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {62#false} assume 0bv32 == main_#t~ret16#1;havoc main_#t~ret16#1; {62#false} is VALID [2022-02-20 16:38:14,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {62#false} assume !false; {62#false} is VALID [2022-02-20 16:38:14,483 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:38:14,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:38:14,483 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:38:14,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110851486] [2022-02-20 16:38:14,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110851486] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:38:14,484 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:38:14,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:38:14,486 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426135279] [2022-02-20 16:38:14,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:38:14,490 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:38:14,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:38:14,494 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:38:14,592 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:38:14,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:38:14,593 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:38:14,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:38:14,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:38:14,610 INFO L87 Difference]: Start difference. First operand has 58 states, 56 states have (on average 1.6607142857142858) internal successors, (93), 57 states have internal predecessors, (93), 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:38:26,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:38:26,701 INFO L93 Difference]: Finished difference Result 113 states and 182 transitions. [2022-02-20 16:38:26,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:38:26,702 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:38:26,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:38:26,712 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:38:26,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 182 transitions. [2022-02-20 16:38:26,721 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:38:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 182 transitions. [2022-02-20 16:38:26,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 182 transitions. [2022-02-20 16:38:30,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:38:30,957 INFO L225 Difference]: With dead ends: 113 [2022-02-20 16:38:30,957 INFO L226 Difference]: Without dead ends: 54 [2022-02-20 16:38:30,960 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:38:30,962 INFO L933 BasicCegarLoop]: 76 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, 76 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:38:30,963 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:38:30,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-20 16:38:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-02-20 16:38:30,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:38:30,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 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:38:30,984 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 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:38:30,985 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 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:38:30,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:38:30,989 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2022-02-20 16:38:30,989 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2022-02-20 16:38:30,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:38:30,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:38:30,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 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 54 states. [2022-02-20 16:38:30,991 INFO L87 Difference]: Start difference. First operand has 54 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 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 54 states. [2022-02-20 16:38:30,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:38:30,994 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2022-02-20 16:38:30,994 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2022-02-20 16:38:30,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:38:30,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:38:30,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:38:30,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:38:30,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 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:38:30,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 71 transitions. [2022-02-20 16:38:30,999 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 71 transitions. Word has length 10 [2022-02-20 16:38:30,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:38:31,000 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 71 transitions. [2022-02-20 16:38:31,000 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:38:31,000 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 71 transitions. [2022-02-20 16:38:31,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:38:31,001 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:38:31,001 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:38:31,020 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:38:31,205 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:38:31,206 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:38:31,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:38:31,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1283186732, now seen corresponding path program 1 times [2022-02-20 16:38:31,207 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:38:31,207 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776914288] [2022-02-20 16:38:31,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:38:31,207 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:38:31,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:38:31,209 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:38:31,211 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:38:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:38:31,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:38:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:38:31,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:38:32,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {402#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30));~one_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~huge_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~pio2_hi_asin~0 := ~to_fp~FLOAT(currentRoundingMode, 1.5707963705062866);~pio2_lo_asin~0 := ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 4.3711390001862426E-8));~pio4_hi_asin~0 := ~to_fp~FLOAT(currentRoundingMode, 0.7853981852531433);~pS0_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.16666667163));~pS1_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.32556581497)));~pS2_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.20121252537));~pS3_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.040055535734)));~pS4_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.9153501429E-4));~pS5_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 3.4793309169E-5));~qS1_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.4033949375)));~qS2_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 2.0209457874));~qS3_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.68828397989)));~qS4_asin~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.077038154006)); {402#true} is VALID [2022-02-20 16:38:32,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {402#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~ret15#1, main_#t~ret16#1, main_~res~0#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; {402#true} is VALID [2022-02-20 16:38:32,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {402#true} assume ~fp.lt~FLOAT(main_~x~0#1, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0))) || ~fp.gt~FLOAT(main_~x~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0));assume { :begin_inline___ieee754_asinf } true;__ieee754_asinf_#in~x#1 := main_~x~0#1;havoc __ieee754_asinf_#res#1;havoc __ieee754_asinf_#t~mem9#1, __ieee754_asinf_~#gf_u~2#1.base, __ieee754_asinf_~#gf_u~2#1.offset, __ieee754_asinf_#t~ret10#1, __ieee754_asinf_#t~ret11#1, __ieee754_asinf_#t~mem12#1, __ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset, __ieee754_asinf_#t~mem13#1, __ieee754_asinf_~#sf_u~2#1.base, __ieee754_asinf_~#sf_u~2#1.offset, __ieee754_asinf_~iw~0#1, __ieee754_asinf_~x#1, __ieee754_asinf_~t~1#1, __ieee754_asinf_~w~0#1, __ieee754_asinf_~p~0#1, __ieee754_asinf_~q~1#1, __ieee754_asinf_~c~0#1, __ieee754_asinf_~r~1#1, __ieee754_asinf_~s~1#1, __ieee754_asinf_~hx~1#1, __ieee754_asinf_~ix~2#1;__ieee754_asinf_~x#1 := __ieee754_asinf_#in~x#1;havoc __ieee754_asinf_~t~1#1;havoc __ieee754_asinf_~w~0#1;havoc __ieee754_asinf_~p~0#1;havoc __ieee754_asinf_~q~1#1;havoc __ieee754_asinf_~c~0#1;havoc __ieee754_asinf_~r~1#1;havoc __ieee754_asinf_~s~1#1;havoc __ieee754_asinf_~hx~1#1;havoc __ieee754_asinf_~ix~2#1; {413#(or (exists ((currentRoundingMode RoundingMode)) (fp.gt |ULTIMATE.start___ieee754_asinf_~x#1| ((_ to_fp 8 24) currentRoundingMode 1.0))) (exists ((currentRoundingMode RoundingMode)) (fp.lt |ULTIMATE.start___ieee754_asinf_~x#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)))))} is VALID [2022-02-20 16:38:32,539 INFO L290 TraceCheckUtils]: 3: Hoare triple {413#(or (exists ((currentRoundingMode RoundingMode)) (fp.gt |ULTIMATE.start___ieee754_asinf_~x#1| ((_ to_fp 8 24) currentRoundingMode 1.0))) (exists ((currentRoundingMode RoundingMode)) (fp.lt |ULTIMATE.start___ieee754_asinf_~x#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)))))} call __ieee754_asinf_~#gf_u~2#1.base, __ieee754_asinf_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_asinf_~x#1, __ieee754_asinf_~#gf_u~2#1.base, __ieee754_asinf_~#gf_u~2#1.offset, 4bv32);call __ieee754_asinf_#t~mem9#1 := read~intINTTYPE4(__ieee754_asinf_~#gf_u~2#1.base, __ieee754_asinf_~#gf_u~2#1.offset, 4bv32);__ieee754_asinf_~hx~1#1 := __ieee754_asinf_#t~mem9#1;havoc __ieee754_asinf_#t~mem9#1;call ULTIMATE.dealloc(__ieee754_asinf_~#gf_u~2#1.base, __ieee754_asinf_~#gf_u~2#1.offset);havoc __ieee754_asinf_~#gf_u~2#1.base, __ieee754_asinf_~#gf_u~2#1.offset; {417#(or (exists ((currentRoundingMode RoundingMode)) (fp.lt (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_asinf_~hx~1#1|)) (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)))) (exists ((currentRoundingMode RoundingMode)) (fp.gt (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_asinf_~hx~1#1|)) ((_ to_fp 8 24) currentRoundingMode 1.0))))} is VALID [2022-02-20 16:38:32,540 INFO L290 TraceCheckUtils]: 4: Hoare triple {417#(or (exists ((currentRoundingMode RoundingMode)) (fp.lt (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_asinf_~hx~1#1|)) (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)))) (exists ((currentRoundingMode RoundingMode)) (fp.gt (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_asinf_~hx~1#1|)) ((_ to_fp 8 24) currentRoundingMode 1.0))))} goto; {417#(or (exists ((currentRoundingMode RoundingMode)) (fp.lt (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_asinf_~hx~1#1|)) (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)))) (exists ((currentRoundingMode RoundingMode)) (fp.gt (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_asinf_~hx~1#1|)) ((_ to_fp 8 24) currentRoundingMode 1.0))))} is VALID [2022-02-20 16:38:32,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#(or (exists ((currentRoundingMode RoundingMode)) (fp.lt (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_asinf_~hx~1#1|)) (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)))) (exists ((currentRoundingMode RoundingMode)) (fp.gt (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_asinf_~hx~1#1|)) ((_ to_fp 8 24) currentRoundingMode 1.0))))} __ieee754_asinf_~ix~2#1 := ~bvand32(2147483647bv32, __ieee754_asinf_~hx~1#1); {424#(exists ((|ULTIMATE.start___ieee754_asinf_~hx~1#1| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_asinf_~ix~2#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_asinf_~hx~1#1|)) (or (exists ((currentRoundingMode RoundingMode)) (fp.lt (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_asinf_~hx~1#1|)) (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)))) (exists ((currentRoundingMode RoundingMode)) (fp.gt (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_asinf_~hx~1#1|)) ((_ to_fp 8 24) currentRoundingMode 1.0))))))} is VALID [2022-02-20 16:38:32,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {424#(exists ((|ULTIMATE.start___ieee754_asinf_~hx~1#1| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_asinf_~ix~2#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_asinf_~hx~1#1|)) (or (exists ((currentRoundingMode RoundingMode)) (fp.lt (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_asinf_~hx~1#1|)) (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)))) (exists ((currentRoundingMode RoundingMode)) (fp.gt (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_asinf_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_asinf_~hx~1#1|)) ((_ to_fp 8 24) currentRoundingMode 1.0))))))} assume 1065353216bv32 == __ieee754_asinf_~ix~2#1;__ieee754_asinf_#res#1 := ~fp.add~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, __ieee754_asinf_~x#1, ~pio2_hi_asin~0), ~fp.mul~FLOAT(currentRoundingMode, __ieee754_asinf_~x#1, ~pio2_lo_asin~0)); {403#false} is VALID [2022-02-20 16:38:32,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {403#false} main_#t~ret15#1 := __ieee754_asinf_#res#1;assume { :end_inline___ieee754_asinf } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {403#false} is VALID [2022-02-20 16:38:32,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {403#false} main_#t~ret16#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {403#false} is VALID [2022-02-20 16:38:32,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {403#false} assume 0bv32 == main_#t~ret16#1;havoc main_#t~ret16#1; {403#false} is VALID [2022-02-20 16:38:32,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {403#false} assume !false; {403#false} is VALID [2022-02-20 16:38:32,624 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:38:32,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:38:32,624 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:38:32,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776914288] [2022-02-20 16:38:32,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776914288] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:38:32,625 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:38:32,625 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:38:32,625 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280012972] [2022-02-20 16:38:32,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:38:32,626 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:38:32,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:38:32,626 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:38:32,716 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:38:32,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:38:32,716 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:38:32,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:38:32,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:38:32,717 INFO L87 Difference]: Start difference. First operand 54 states and 71 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)