./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0270b.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_0270b.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 9cac107c363e3fd6d917de6ef8bceef6babf5688036a19c829686ca43ca0273d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:37:53,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:37:53,066 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:37:53,097 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:37:53,097 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:37:53,100 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:37:53,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:37:53,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:37:53,104 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:37:53,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:37:53,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:37:53,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:37:53,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:37:53,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:37:53,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:37:53,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:37:53,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:37:53,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:37:53,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:37:53,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:37:53,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:37:53,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:37:53,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:37:53,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:37:53,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:37:53,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:37:53,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:37:53,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:37:53,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:37:53,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:37:53,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:37:53,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:37:53,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:37:53,132 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:37:53,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:37:53,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:37:53,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:37:53,134 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:37:53,134 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:37:53,135 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:37:53,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:37:53,136 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:53,159 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:37:53,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:37:53,160 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:37:53,160 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:37:53,160 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:37:53,161 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:37:53,161 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:37:53,161 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:37:53,161 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:37:53,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:37:53,162 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:37:53,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:37:53,162 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:37:53,162 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:37:53,163 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:37:53,163 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:37:53,163 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:37:53,163 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:37:53,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:37:53,163 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:37:53,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:37:53,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:37:53,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:37:53,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:37:53,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:37:53,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:37:53,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:37:53,165 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:37:53,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:37:53,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:37:53,166 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:37:53,166 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:37:53,166 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:37:53,166 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 -> 9cac107c363e3fd6d917de6ef8bceef6babf5688036a19c829686ca43ca0273d [2022-02-20 16:37:53,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:37:53,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:37:53,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:37:53,374 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:37:53,374 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:37:53,375 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0270b.c [2022-02-20 16:37:53,423 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06bdcc097/daec71ac091b44758b208d3a9f5218ae/FLAG2ca4b7849 [2022-02-20 16:37:53,717 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:37:53,717 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0270b.c [2022-02-20 16:37:53,722 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06bdcc097/daec71ac091b44758b208d3a9f5218ae/FLAG2ca4b7849 [2022-02-20 16:37:54,145 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06bdcc097/daec71ac091b44758b208d3a9f5218ae [2022-02-20 16:37:54,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:37:54,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:37:54,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:37:54,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:37:54,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:37:54,166 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:37:54" (1/1) ... [2022-02-20 16:37:54,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca8590c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:54, skipping insertion in model container [2022-02-20 16:37:54,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:37:54" (1/1) ... [2022-02-20 16:37:54,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:37:54,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:37:54,404 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_0270b.c[4700,4713] [2022-02-20 16:37:54,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:37:54,428 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:37:54,491 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_0270b.c[4700,4713] [2022-02-20 16:37:54,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:37:54,514 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:37:54,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:54 WrapperNode [2022-02-20 16:37:54,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:37:54,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:37:54,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:37:54,516 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:37:54,523 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:54" (1/1) ... [2022-02-20 16:37:54,544 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:54" (1/1) ... [2022-02-20 16:37:54,606 INFO L137 Inliner]: procedures = 19, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 292 [2022-02-20 16:37:54,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:37:54,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:37:54,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:37:54,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:37:54,618 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:54" (1/1) ... [2022-02-20 16:37:54,619 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:54" (1/1) ... [2022-02-20 16:37:54,633 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:54" (1/1) ... [2022-02-20 16:37:54,637 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:54" (1/1) ... [2022-02-20 16:37:54,645 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:54" (1/1) ... [2022-02-20 16:37:54,649 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:54" (1/1) ... [2022-02-20 16:37:54,650 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:54" (1/1) ... [2022-02-20 16:37:54,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:37:54,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:37:54,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:37:54,653 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:37:54,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:54" (1/1) ... [2022-02-20 16:37:54,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:37:54,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:37:54,675 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:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:37:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:37:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:37:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:37:54,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:37:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:37:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:37:54,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:37:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:37:54,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:37:54,691 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:54,856 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:37:54,857 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:37:55,205 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:37:55,211 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:37:55,211 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-02-20 16:37:55,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:37:55 BoogieIcfgContainer [2022-02-20 16:37:55,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:37:55,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:37:55,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:37:55,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:37:55,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:37:54" (1/3) ... [2022-02-20 16:37:55,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aef4a61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:37:55, skipping insertion in model container [2022-02-20 16:37:55,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:54" (2/3) ... [2022-02-20 16:37:55,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aef4a61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:37:55, skipping insertion in model container [2022-02-20 16:37:55,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:37:55" (3/3) ... [2022-02-20 16:37:55,219 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0270b.c [2022-02-20 16:37:55,223 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:37:55,224 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:37:55,258 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:37:55,263 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:55,263 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:37:55,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 68 states have (on average 1.75) internal successors, (119), 69 states have internal predecessors, (119), 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:55,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:37:55,288 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:55,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:55,290 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:55,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:55,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1822908428, now seen corresponding path program 1 times [2022-02-20 16:37:55,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:37:55,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58334636] [2022-02-20 16:37:55,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:55,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:37:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:55,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {73#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~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; {73#true} is VALID [2022-02-20 16:37:55,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {73#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1, main_#t~ret19#1, main_#t~short20#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := 0.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~mem12#1, __ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset, __ieee754_asinf_#t~ret14#1, __ieee754_asinf_#t~ret15#1, __ieee754_asinf_#t~mem16#1, __ieee754_asinf_~#gf_u~4#1.base, __ieee754_asinf_~#gf_u~4#1.offset, __ieee754_asinf_#t~mem17#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~1#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~nondet13#1;__ieee754_asinf_~x#1 := __ieee754_asinf_#in~x#1;havoc __ieee754_asinf_~t~1#1;havoc __ieee754_asinf_~w~1#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; {73#true} is VALID [2022-02-20 16:37:55,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {73#true} assume !true; {74#false} is VALID [2022-02-20 16:37:55,454 INFO L290 TraceCheckUtils]: 3: Hoare triple {74#false} assume 0 == __ieee754_asinf_~hx~1#1;__ieee754_asinf_~ix~2#1 := 0; {74#false} is VALID [2022-02-20 16:37:55,454 INFO L290 TraceCheckUtils]: 4: Hoare triple {74#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)); {74#false} is VALID [2022-02-20 16:37:55,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {74#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;main_#t~short20#1 := ~someBinaryFLOATComparisonOperation(main_~res~0#1, 0.0); {74#false} is VALID [2022-02-20 16:37:55,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {74#false} assume !main_#t~short20#1; {74#false} is VALID [2022-02-20 16:37:55,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {74#false} assume !main_#t~short20#1;havoc main_#t~ret19#1;havoc main_#t~short20#1; {74#false} is VALID [2022-02-20 16:37:55,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {74#false} assume !false; {74#false} is VALID [2022-02-20 16:37:55,456 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:55,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:37:55,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58334636] [2022-02-20 16:37:55,457 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58334636] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:55,457 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:55,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:37:55,459 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114834328] [2022-02-20 16:37:55,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:55,463 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 16:37:55,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:55,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:55,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:55,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:37:55,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:37:55,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:37:55,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:37:55,497 INFO L87 Difference]: Start difference. First operand has 70 states, 68 states have (on average 1.75) internal successors, (119), 69 states have internal predecessors, (119), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:55,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:55,564 INFO L93 Difference]: Finished difference Result 138 states and 236 transitions. [2022-02-20 16:37:55,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:37:55,565 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 16:37:55,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:55,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 236 transitions. [2022-02-20 16:37:55,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:55,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 236 transitions. [2022-02-20 16:37:55,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 236 transitions. [2022-02-20 16:37:55,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:55,744 INFO L225 Difference]: With dead ends: 138 [2022-02-20 16:37:55,744 INFO L226 Difference]: Without dead ends: 67 [2022-02-20 16:37:55,747 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:55,749 INFO L933 BasicCegarLoop]: 93 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, 93 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:55,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 93 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:55,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-02-20 16:37:55,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-02-20 16:37:55,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:55,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 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:55,774 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 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:55,774 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 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:55,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:55,778 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2022-02-20 16:37:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2022-02-20 16:37:55,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:55,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:55,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 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 67 states. [2022-02-20 16:37:55,779 INFO L87 Difference]: Start difference. First operand has 67 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 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 67 states. [2022-02-20 16:37:55,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:55,782 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2022-02-20 16:37:55,783 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2022-02-20 16:37:55,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:55,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:55,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:55,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:55,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 66 states have internal predecessors, (90), 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:55,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 90 transitions. [2022-02-20 16:37:55,788 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 90 transitions. Word has length 9 [2022-02-20 16:37:55,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:55,788 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 90 transitions. [2022-02-20 16:37:55,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:55,788 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2022-02-20 16:37:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:37:55,789 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:55,789 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:55,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:37:55,790 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:55,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:55,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1565442385, now seen corresponding path program 1 times [2022-02-20 16:37:55,791 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:37:55,791 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152796590] [2022-02-20 16:37:55,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:55,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:37:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:55,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {454#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~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; {454#true} is VALID [2022-02-20 16:37:55,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {454#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret18#1, main_#t~ret19#1, main_#t~short20#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := 0.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~mem12#1, __ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset, __ieee754_asinf_#t~ret14#1, __ieee754_asinf_#t~ret15#1, __ieee754_asinf_#t~mem16#1, __ieee754_asinf_~#gf_u~4#1.base, __ieee754_asinf_~#gf_u~4#1.offset, __ieee754_asinf_#t~mem17#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~1#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~nondet13#1;__ieee754_asinf_~x#1 := __ieee754_asinf_#in~x#1;havoc __ieee754_asinf_~t~1#1;havoc __ieee754_asinf_~w~1#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; {454#true} is VALID [2022-02-20 16:37:55,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {454#true} call __ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset := #Ultimate.allocOnStack(4);call write~real(__ieee754_asinf_~x#1, __ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset, 4);call __ieee754_asinf_#t~mem12#1 := read~int(__ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset, 4);__ieee754_asinf_~hx~1#1 := (if __ieee754_asinf_#t~mem12#1 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_asinf_#t~mem12#1 % 4294967296 % 4294967296 else __ieee754_asinf_#t~mem12#1 % 4294967296 % 4294967296 - 4294967296);havoc __ieee754_asinf_#t~mem12#1;call ULTIMATE.dealloc(__ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset);havoc __ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset; {454#true} is VALID [2022-02-20 16:37:55,839 INFO L290 TraceCheckUtils]: 3: Hoare triple {454#true} goto; {454#true} is VALID [2022-02-20 16:37:55,839 INFO L290 TraceCheckUtils]: 4: Hoare triple {454#true} assume 0 == __ieee754_asinf_~hx~1#1;__ieee754_asinf_~ix~2#1 := 0; {456#(= |ULTIMATE.start___ieee754_asinf_~ix~2#1| 0)} is VALID [2022-02-20 16:37:55,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {456#(= |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)); {455#false} is VALID [2022-02-20 16:37:55,840 INFO L290 TraceCheckUtils]: 6: Hoare triple {455#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;main_#t~short20#1 := ~someBinaryFLOATComparisonOperation(main_~res~0#1, 0.0); {455#false} is VALID [2022-02-20 16:37:55,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {455#false} assume !main_#t~short20#1; {455#false} is VALID [2022-02-20 16:37:55,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {455#false} assume !main_#t~short20#1;havoc main_#t~ret19#1;havoc main_#t~short20#1; {455#false} is VALID [2022-02-20 16:37:55,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {455#false} assume !false; {455#false} is VALID [2022-02-20 16:37:55,841 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:55,841 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:37:55,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152796590] [2022-02-20 16:37:55,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152796590] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:55,841 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:55,841 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:37:55,842 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089807793] [2022-02-20 16:37:55,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:55,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:55,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:55,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:55,850 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:55,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:37:55,851 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:37:55,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:37:55,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:37:55,852 INFO L87 Difference]: Start difference. First operand 67 states and 90 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:55,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:55,967 INFO L93 Difference]: Finished difference Result 180 states and 240 transitions. [2022-02-20 16:37:55,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:37:55,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:55,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:55,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:55,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2022-02-20 16:37:55,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2022-02-20 16:37:55,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 240 transitions. [2022-02-20 16:37:56,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:56,204 INFO L225 Difference]: With dead ends: 180 [2022-02-20 16:37:56,204 INFO L226 Difference]: Without dead ends: 126 [2022-02-20 16:37:56,204 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:56,205 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 75 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 172 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:56,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 172 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:56,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-02-20 16:37:56,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 111. [2022-02-20 16:37:56,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:56,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 111 states, 110 states have (on average 1.3545454545454545) internal successors, (149), 110 states have internal predecessors, (149), 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,213 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 111 states, 110 states have (on average 1.3545454545454545) internal successors, (149), 110 states have internal predecessors, (149), 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,214 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 111 states, 110 states have (on average 1.3545454545454545) internal successors, (149), 110 states have internal predecessors, (149), 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,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:56,217 INFO L93 Difference]: Finished difference Result 126 states and 165 transitions. [2022-02-20 16:37:56,217 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 165 transitions. [2022-02-20 16:37:56,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:56,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:56,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 110 states have (on average 1.3545454545454545) internal successors, (149), 110 states have internal predecessors, (149), 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 126 states. [2022-02-20 16:37:56,232 INFO L87 Difference]: Start difference. First operand has 111 states, 110 states have (on average 1.3545454545454545) internal successors, (149), 110 states have internal predecessors, (149), 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 126 states. [2022-02-20 16:37:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:56,235 INFO L93 Difference]: Finished difference Result 126 states and 165 transitions. [2022-02-20 16:37:56,235 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 165 transitions. [2022-02-20 16:37:56,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:56,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:56,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:56,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.3545454545454545) internal successors, (149), 110 states have internal predecessors, (149), 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,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 149 transitions. [2022-02-20 16:37:56,239 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 149 transitions. Word has length 10 [2022-02-20 16:37:56,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:56,239 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 149 transitions. [2022-02-20 16:37:56,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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,239 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 149 transitions. [2022-02-20 16:37:56,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:37:56,240 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:56,240 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:56,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:37:56,240 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:56,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:56,241 INFO L85 PathProgramCache]: Analyzing trace with hash -285909876, now seen corresponding path program 1 times [2022-02-20 16:37:56,241 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:37:56,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906040283] [2022-02-20 16:37:56,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:56,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:37:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:37:56,298 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:37:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:37:56,360 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:37:56,360 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:37:56,361 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:37:56,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:37:56,365 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:37:56,367 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:37:56,406 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:37:56,406 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:37:56,406 WARN L170 areAnnotationChecker]: L122-2 has no Hoare annotation [2022-02-20 16:37:56,407 WARN L170 areAnnotationChecker]: L122-2 has no Hoare annotation [2022-02-20 16:37:56,407 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2022-02-20 16:37:56,407 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2022-02-20 16:37:56,407 WARN L170 areAnnotationChecker]: L122-3 has no Hoare annotation [2022-02-20 16:37:56,407 WARN L170 areAnnotationChecker]: L122-3 has no Hoare annotation [2022-02-20 16:37:56,407 WARN L170 areAnnotationChecker]: L127-7 has no Hoare annotation [2022-02-20 16:37:56,407 WARN L170 areAnnotationChecker]: L127-7 has no Hoare annotation [2022-02-20 16:37:56,407 WARN L170 areAnnotationChecker]: L127-1 has no Hoare annotation [2022-02-20 16:37:56,407 WARN L170 areAnnotationChecker]: L127-1 has no Hoare annotation [2022-02-20 16:37:56,408 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 16:37:56,408 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:37:56,408 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:37:56,408 WARN L170 areAnnotationChecker]: L127-3 has no Hoare annotation [2022-02-20 16:37:56,408 WARN L170 areAnnotationChecker]: L127-3 has no Hoare annotation [2022-02-20 16:37:56,408 WARN L170 areAnnotationChecker]: L199 has no Hoare annotation [2022-02-20 16:37:56,408 WARN L170 areAnnotationChecker]: L199 has no Hoare annotation [2022-02-20 16:37:56,408 WARN L170 areAnnotationChecker]: L133 has no Hoare annotation [2022-02-20 16:37:56,408 WARN L170 areAnnotationChecker]: L133 has no Hoare annotation [2022-02-20 16:37:56,408 WARN L170 areAnnotationChecker]: L127-5 has no Hoare annotation [2022-02-20 16:37:56,409 WARN L170 areAnnotationChecker]: L127-5 has no Hoare annotation [2022-02-20 16:37:56,409 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-02-20 16:37:56,409 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-02-20 16:37:56,409 WARN L170 areAnnotationChecker]: L199-2 has no Hoare annotation [2022-02-20 16:37:56,409 WARN L170 areAnnotationChecker]: L199-2 has no Hoare annotation [2022-02-20 16:37:56,409 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2022-02-20 16:37:56,409 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2022-02-20 16:37:56,409 WARN L170 areAnnotationChecker]: L133-1 has no Hoare annotation [2022-02-20 16:37:56,409 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2022-02-20 16:37:56,410 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2022-02-20 16:37:56,410 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2022-02-20 16:37:56,410 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2022-02-20 16:37:56,410 WARN L170 areAnnotationChecker]: L200 has no Hoare annotation [2022-02-20 16:37:56,410 WARN L170 areAnnotationChecker]: L204 has no Hoare annotation [2022-02-20 16:37:56,410 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2022-02-20 16:37:56,410 WARN L170 areAnnotationChecker]: L135 has no Hoare annotation [2022-02-20 16:37:56,410 WARN L170 areAnnotationChecker]: L96-2 has no Hoare annotation [2022-02-20 16:37:56,410 WARN L170 areAnnotationChecker]: L96-2 has no Hoare annotation [2022-02-20 16:37:56,411 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 16:37:56,411 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:37:56,411 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2022-02-20 16:37:56,411 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2022-02-20 16:37:56,411 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2022-02-20 16:37:56,411 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2022-02-20 16:37:56,411 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-02-20 16:37:56,411 WARN L170 areAnnotationChecker]: L101 has no Hoare annotation [2022-02-20 16:37:56,411 WARN L170 areAnnotationChecker]: L101-2 has no Hoare annotation [2022-02-20 16:37:56,412 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-02-20 16:37:56,412 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-02-20 16:37:56,412 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-02-20 16:37:56,412 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-02-20 16:37:56,412 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-02-20 16:37:56,412 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-02-20 16:37:56,412 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-02-20 16:37:56,412 WARN L170 areAnnotationChecker]: L38-7 has no Hoare annotation [2022-02-20 16:37:56,412 WARN L170 areAnnotationChecker]: L38-7 has no Hoare annotation [2022-02-20 16:37:56,412 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-02-20 16:37:56,413 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-02-20 16:37:56,413 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-02-20 16:37:56,413 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:37:56,413 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:37:56,413 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2022-02-20 16:37:56,413 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2022-02-20 16:37:56,413 WARN L170 areAnnotationChecker]: L159 has no Hoare annotation [2022-02-20 16:37:56,413 WARN L170 areAnnotationChecker]: L159 has no Hoare annotation [2022-02-20 16:37:56,413 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:37:56,413 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:37:56,414 WARN L170 areAnnotationChecker]: L38-5 has no Hoare annotation [2022-02-20 16:37:56,414 WARN L170 areAnnotationChecker]: L38-5 has no Hoare annotation [2022-02-20 16:37:56,414 WARN L170 areAnnotationChecker]: L159-2 has no Hoare annotation [2022-02-20 16:37:56,414 WARN L170 areAnnotationChecker]: L159-2 has no Hoare annotation [2022-02-20 16:37:56,414 WARN L170 areAnnotationChecker]: L165-2 has no Hoare annotation [2022-02-20 16:37:56,414 WARN L170 areAnnotationChecker]: L165-2 has no Hoare annotation [2022-02-20 16:37:56,414 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 16:37:56,414 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 16:37:56,414 WARN L170 areAnnotationChecker]: L165-1 has no Hoare annotation [2022-02-20 16:37:56,414 WARN L170 areAnnotationChecker]: L165-1 has no Hoare annotation [2022-02-20 16:37:56,415 WARN L170 areAnnotationChecker]: L170-1 has no Hoare annotation [2022-02-20 16:37:56,415 WARN L170 areAnnotationChecker]: L170-1 has no Hoare annotation [2022-02-20 16:37:56,415 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2022-02-20 16:37:56,415 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2022-02-20 16:37:56,415 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2022-02-20 16:37:56,415 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:37:56,415 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2022-02-20 16:37:56,415 WARN L170 areAnnotationChecker]: L170 has no Hoare annotation [2022-02-20 16:37:56,415 WARN L170 areAnnotationChecker]: L170-2 has no Hoare annotation [2022-02-20 16:37:56,415 WARN L170 areAnnotationChecker]: L50-4 has no Hoare annotation [2022-02-20 16:37:56,416 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2022-02-20 16:37:56,416 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:37:56,416 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:37:56,416 WARN L170 areAnnotationChecker]: L55-8 has no Hoare annotation [2022-02-20 16:37:56,416 WARN L170 areAnnotationChecker]: L55-8 has no Hoare annotation [2022-02-20 16:37:56,416 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:37:56,416 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:37:56,416 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2022-02-20 16:37:56,416 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:37:56,416 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:37:56,417 WARN L170 areAnnotationChecker]: L64-2 has no Hoare annotation [2022-02-20 16:37:56,417 WARN L170 areAnnotationChecker]: L64-2 has no Hoare annotation [2022-02-20 16:37:56,417 WARN L170 areAnnotationChecker]: L64-2 has no Hoare annotation [2022-02-20 16:37:56,417 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2022-02-20 16:37:56,417 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2022-02-20 16:37:56,417 WARN L170 areAnnotationChecker]: L64-3 has no Hoare annotation [2022-02-20 16:37:56,417 WARN L170 areAnnotationChecker]: L64-3 has no Hoare annotation [2022-02-20 16:37:56,417 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:37:56,417 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:37:56,417 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2022-02-20 16:37:56,417 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2022-02-20 16:37:56,418 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2022-02-20 16:37:56,418 WARN L170 areAnnotationChecker]: L66-2 has no Hoare annotation [2022-02-20 16:37:56,418 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:37:56,418 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:37:56,418 WARN L170 areAnnotationChecker]: L87-2 has no Hoare annotation [2022-02-20 16:37:56,418 WARN L170 areAnnotationChecker]: L87-2 has no Hoare annotation [2022-02-20 16:37:56,418 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2022-02-20 16:37:56,418 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2022-02-20 16:37:56,418 WARN L170 areAnnotationChecker]: L87-3 has no Hoare annotation [2022-02-20 16:37:56,419 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:56,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:37:56 BoogieIcfgContainer [2022-02-20 16:37:56,420 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:37:56,420 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:37:56,420 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:37:56,420 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:37:56,421 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:55" (3/4) ... [2022-02-20 16:37:56,423 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:37:56,423 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:37:56,424 INFO L158 Benchmark]: Toolchain (without parser) took 2276.19ms. Allocated memory was 111.1MB in the beginning and 136.3MB in the end (delta: 25.2MB). Free memory was 68.4MB in the beginning and 87.7MB in the end (delta: -19.3MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2022-02-20 16:37:56,425 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 111.1MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:37:56,425 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.36ms. Allocated memory is still 111.1MB. Free memory was 68.1MB in the beginning and 79.2MB in the end (delta: -11.2MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2022-02-20 16:37:56,426 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.67ms. Allocated memory is still 111.1MB. Free memory was 79.2MB in the beginning and 75.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:37:56,426 INFO L158 Benchmark]: Boogie Preprocessor took 40.73ms. Allocated memory is still 111.1MB. Free memory was 75.7MB in the beginning and 73.3MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:37:56,426 INFO L158 Benchmark]: RCFGBuilder took 560.26ms. Allocated memory is still 111.1MB. Free memory was 73.3MB in the beginning and 48.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-02-20 16:37:56,427 INFO L158 Benchmark]: TraceAbstraction took 1205.45ms. Allocated memory was 111.1MB in the beginning and 136.3MB in the end (delta: 25.2MB). Free memory was 47.8MB in the beginning and 87.7MB in the end (delta: -40.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:37:56,427 INFO L158 Benchmark]: Witness Printer took 3.22ms. Allocated memory is still 136.3MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:37:56,428 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 111.1MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.36ms. Allocated memory is still 111.1MB. Free memory was 68.1MB in the beginning and 79.2MB in the end (delta: -11.2MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.67ms. Allocated memory is still 111.1MB. Free memory was 79.2MB in the beginning and 75.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.73ms. Allocated memory is still 111.1MB. Free memory was 75.7MB in the beginning and 73.3MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 560.26ms. Allocated memory is still 111.1MB. Free memory was 73.3MB in the beginning and 48.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1205.45ms. Allocated memory was 111.1MB in the beginning and 136.3MB in the end (delta: 25.2MB). Free memory was 47.8MB in the beginning and 87.7MB in the end (delta: -40.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.22ms. Allocated memory is still 136.3MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 200]: 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 199, overapproximation of someUnaryDOUBLEoperation at line 113, overapproximation of someUnaryFLOAToperation at line 111, overapproximation of someBinaryArithmeticFLOAToperation at line 130. Possible FailurePath: [L26] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; [L109-L117] 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] [L195] float x = 0.0f; [L196] CALL, EXPR __ieee754_asinf(x) [L120] float t, w, p, q, c, r, s; [L121] __int32_t hx, ix; VAL [\old(x)=0, 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=0] [L123] ieee_float_shape_type gf_u; [L124] gf_u.value = (x) [L125] EXPR gf_u.word [L125] (hx) = gf_u.word [L127] ix = hx & 0x7fffffff VAL [\old(x)=0, 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=0] [L128] COND TRUE ix == 0x3f800000 [L130] return x * pio2_hi_asin + x * pio2_lo_asin; VAL [\old(x)=0, 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=0] [L196] RET, EXPR __ieee754_asinf(x) [L196] float res = __ieee754_asinf(x); [L199] EXPR res == 0.0f && __signbit_float(res) == 0 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, res == 0.0f && __signbit_float(res) == 0=0, tiny_sqrt=1/1000000000000000000000000000000, x=0] [L199] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L200] 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=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 265 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 189 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=111occurred 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, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 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:56,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0270b.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 9cac107c363e3fd6d917de6ef8bceef6babf5688036a19c829686ca43ca0273d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:37:58,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:37:58,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:37:58,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:37:58,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:37:58,372 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:37:58,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:37:58,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:37:58,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:37:58,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:37:58,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:37:58,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:37:58,378 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:37:58,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:37:58,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:37:58,380 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:37:58,381 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:37:58,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:37:58,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:37:58,384 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:37:58,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:37:58,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:37:58,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:37:58,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:37:58,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:37:58,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:37:58,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:37:58,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:37:58,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:37:58,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:37:58,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:37:58,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:37:58,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:37:58,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:37:58,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:37:58,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:37:58,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:37:58,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:37:58,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:37:58,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:37:58,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:37:58,406 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:37:58,429 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:37:58,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:37:58,430 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:37:58,430 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:37:58,430 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:37:58,430 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:37:58,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:37:58,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:37:58,432 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:37:58,432 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:37:58,432 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:37:58,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:37:58,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:37:58,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:37:58,433 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:37:58,433 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:37:58,433 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:37:58,433 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:37:58,434 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:37:58,434 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:37:58,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:37:58,434 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:37:58,434 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:37:58,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:37:58,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:37:58,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:37:58,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:37:58,435 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:37:58,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:37:58,435 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:37:58,435 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:37:58,435 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:37:58,436 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:37:58,436 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:37:58,436 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:37:58,436 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:37:58,436 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 -> 9cac107c363e3fd6d917de6ef8bceef6babf5688036a19c829686ca43ca0273d [2022-02-20 16:37:58,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:37:58,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:37:58,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:37:58,696 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:37:58,696 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:37:58,697 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0270b.c [2022-02-20 16:37:58,739 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92bca68bd/5e7b968fb6a940a1bda4719568f7ddba/FLAGce2eeafca [2022-02-20 16:37:59,119 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:37:59,120 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0270b.c [2022-02-20 16:37:59,133 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92bca68bd/5e7b968fb6a940a1bda4719568f7ddba/FLAGce2eeafca [2022-02-20 16:37:59,146 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92bca68bd/5e7b968fb6a940a1bda4719568f7ddba [2022-02-20 16:37:59,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:37:59,149 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:37:59,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:37:59,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:37:59,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:37:59,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:37:59" (1/1) ... [2022-02-20 16:37:59,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd4f2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:59, skipping insertion in model container [2022-02-20 16:37:59,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:37:59" (1/1) ... [2022-02-20 16:37:59,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:37:59,182 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:37:59,357 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_0270b.c[4700,4713] [2022-02-20 16:37:59,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:37:59,383 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:37:59,424 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_0270b.c[4700,4713] [2022-02-20 16:37:59,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:37:59,439 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:37:59,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:59 WrapperNode [2022-02-20 16:37:59,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:37:59,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:37:59,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:37:59,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:37:59,445 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:59" (1/1) ... [2022-02-20 16:37:59,462 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:59" (1/1) ... [2022-02-20 16:37:59,494 INFO L137 Inliner]: procedures = 22, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 257 [2022-02-20 16:37:59,498 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:37:59,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:37:59,499 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:37:59,499 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:37:59,504 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:59" (1/1) ... [2022-02-20 16:37:59,504 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:59" (1/1) ... [2022-02-20 16:37:59,521 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:59" (1/1) ... [2022-02-20 16:37:59,521 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:59" (1/1) ... [2022-02-20 16:37:59,531 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:59" (1/1) ... [2022-02-20 16:37:59,540 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:59" (1/1) ... [2022-02-20 16:37:59,548 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:59" (1/1) ... [2022-02-20 16:37:59,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:37:59,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:37:59,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:37:59,556 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:37:59,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:59" (1/1) ... [2022-02-20 16:37:59,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:37:59,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:37:59,593 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:59,628 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:59,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:37:59,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:37:59,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:37:59,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:37:59,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:37:59,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:37:59,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:37:59,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:37:59,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:37:59,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:37:59,777 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:37:59,778 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:38:12,980 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:38:12,984 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:38:12,985 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-02-20 16:38:12,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:38:12 BoogieIcfgContainer [2022-02-20 16:38:12,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:38:12,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:38:12,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:38:12,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:38:12,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:37:59" (1/3) ... [2022-02-20 16:38:12,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b5896e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:38:12, skipping insertion in model container [2022-02-20 16:38:12,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:59" (2/3) ... [2022-02-20 16:38:12,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b5896e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:38:12, skipping insertion in model container [2022-02-20 16:38:12,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:38:12" (3/3) ... [2022-02-20 16:38:12,993 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0270b.c [2022-02-20 16:38:12,997 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:38:12,997 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:38:13,051 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:38:13,057 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,057 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:38:13,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 58 states have (on average 1.6724137931034482) internal successors, (97), 59 states have internal predecessors, (97), 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,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:38:13,074 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:38:13,074 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:38:13,075 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:38:13,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:38:13,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1900514974, now seen corresponding path program 1 times [2022-02-20 16:38:13,087 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:38:13,088 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867571636] [2022-02-20 16:38:13,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:38:13,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:38:13,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:38:13,104 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,109 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:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:38:13,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:38:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:38:13,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:38:13,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~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)); {63#true} is VALID [2022-02-20 16:38:13,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret15#1, main_#t~ret16#1, main_#t~short17#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~Pluszero~FLOAT();assume { :begin_inline___ieee754_asinf } true;__ieee754_asinf_#in~x#1 := main_~x~0#1;havoc __ieee754_asinf_#res#1;havoc __ieee754_asinf_#t~mem10#1, __ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset, __ieee754_asinf_#t~ret11#1, __ieee754_asinf_#t~ret12#1, __ieee754_asinf_#t~mem13#1, __ieee754_asinf_~#gf_u~4#1.base, __ieee754_asinf_~#gf_u~4#1.offset, __ieee754_asinf_#t~mem14#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~1#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~1#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; {63#true} is VALID [2022-02-20 16:38:13,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {63#true} assume !true; {64#false} is VALID [2022-02-20 16:38:13,711 INFO L290 TraceCheckUtils]: 3: Hoare triple {64#false} __ieee754_asinf_~ix~2#1 := ~bvand32(2147483647bv32, __ieee754_asinf_~hx~1#1); {64#false} is VALID [2022-02-20 16:38:13,711 INFO L290 TraceCheckUtils]: 4: Hoare triple {64#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)); {64#false} is VALID [2022-02-20 16:38:13,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {64#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;main_#t~short17#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {64#false} is VALID [2022-02-20 16:38:13,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {64#false} assume !main_#t~short17#1; {64#false} is VALID [2022-02-20 16:38:13,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {64#false} assume !main_#t~short17#1;havoc main_#t~ret16#1;havoc main_#t~short17#1; {64#false} is VALID [2022-02-20 16:38:13,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {64#false} assume !false; {64#false} is VALID [2022-02-20 16:38:13,713 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:13,713 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:38:13,714 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:38:13,714 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867571636] [2022-02-20 16:38:13,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867571636] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:38:13,715 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:38:13,715 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:38:13,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473305110] [2022-02-20 16:38:13,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:38:13,721 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 16:38:13,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:38:13,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:38:13,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:38:13,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:38:13,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:38:13,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:38:13,823 INFO L87 Difference]: Start difference. First operand has 60 states, 58 states have (on average 1.6724137931034482) internal successors, (97), 59 states have internal predecessors, (97), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:25,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:38:25,931 INFO L93 Difference]: Finished difference Result 118 states and 192 transitions. [2022-02-20 16:38:25,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:38:25,931 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-02-20 16:38:25,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:38:25,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:25,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 192 transitions. [2022-02-20 16:38:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 192 transitions. [2022-02-20 16:38:25,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 192 transitions. [2022-02-20 16:38:30,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:38:30,099 INFO L225 Difference]: With dead ends: 118 [2022-02-20 16:38:30,099 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 16:38:30,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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,103 INFO L933 BasicCegarLoop]: 78 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, 78 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,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 78 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,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 16:38:30,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-02-20 16:38:30,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:38:30,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 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,123 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 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,123 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 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,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:38:30,126 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-02-20 16:38:30,126 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2022-02-20 16:38:30,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:38:30,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:38:30,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 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 57 states. [2022-02-20 16:38:30,127 INFO L87 Difference]: Start difference. First operand has 57 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 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 57 states. [2022-02-20 16:38:30,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:38:30,130 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-02-20 16:38:30,130 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2022-02-20 16:38:30,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:38:30,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:38:30,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:38:30,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:38:30,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 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,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2022-02-20 16:38:30,133 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 9 [2022-02-20 16:38:30,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:38:30,134 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2022-02-20 16:38:30,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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,134 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2022-02-20 16:38:30,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:38:30,134 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:38:30,135 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:38:30,166 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:30,350 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:30,350 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:38:30,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:38:30,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1487835839, now seen corresponding path program 1 times [2022-02-20 16:38:30,351 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:38:30,352 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [295035966] [2022-02-20 16:38:30,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:38:30,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:38:30,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:38:30,353 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:30,371 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:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:38:30,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:38:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:38:30,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:38:31,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {418#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~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)); {418#true} is VALID [2022-02-20 16:38:31,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {418#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret15#1, main_#t~ret16#1, main_#t~short17#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~Pluszero~FLOAT();assume { :begin_inline___ieee754_asinf } true;__ieee754_asinf_#in~x#1 := main_~x~0#1;havoc __ieee754_asinf_#res#1;havoc __ieee754_asinf_#t~mem10#1, __ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset, __ieee754_asinf_#t~ret11#1, __ieee754_asinf_#t~ret12#1, __ieee754_asinf_#t~mem13#1, __ieee754_asinf_~#gf_u~4#1.base, __ieee754_asinf_~#gf_u~4#1.offset, __ieee754_asinf_#t~mem14#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~1#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~1#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; {426#(= |ULTIMATE.start___ieee754_asinf_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:38:31,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {426#(= |ULTIMATE.start___ieee754_asinf_~x#1| (_ +zero 8 24))} call __ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_asinf_~x#1, __ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset, 4bv32);call __ieee754_asinf_#t~mem10#1 := read~intINTTYPE4(__ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset, 4bv32);__ieee754_asinf_~hx~1#1 := __ieee754_asinf_#t~mem10#1;havoc __ieee754_asinf_#t~mem10#1;call ULTIMATE.dealloc(__ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset);havoc __ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset; {430#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:38:31,223 INFO L290 TraceCheckUtils]: 3: Hoare triple {430#(= (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|)) (_ +zero 8 24))} goto; {430#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:38:31,223 INFO L290 TraceCheckUtils]: 4: Hoare triple {430#(= (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|)) (_ +zero 8 24))} __ieee754_asinf_~ix~2#1 := ~bvand32(2147483647bv32, __ieee754_asinf_~hx~1#1); {437#(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|)) (= (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|)) (_ +zero 8 24))))} is VALID [2022-02-20 16:38:31,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {437#(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|)) (= (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|)) (_ +zero 8 24))))} 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)); {419#false} is VALID [2022-02-20 16:38:31,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {419#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;main_#t~short17#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {419#false} is VALID [2022-02-20 16:38:31,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {419#false} assume !main_#t~short17#1; {419#false} is VALID [2022-02-20 16:38:31,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {419#false} assume !main_#t~short17#1;havoc main_#t~ret16#1;havoc main_#t~short17#1; {419#false} is VALID [2022-02-20 16:38:31,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#false} assume !false; {419#false} is VALID [2022-02-20 16:38:31,294 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:31,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:38:31,294 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:38:31,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [295035966] [2022-02-20 16:38:31,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [295035966] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:38:31,294 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:38:31,294 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:38:31,294 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649157879] [2022-02-20 16:38:31,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:38:31,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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:31,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:38:31,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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,382 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:31,382 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:38:31,382 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:38:31,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:38:31,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:38:31,383 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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:39,551 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:39:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:09,040 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-02-20 16:39:09,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:39:09,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:39:09,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:39:09,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-02-20 16:39:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-02-20 16:39:09,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 84 transitions. [2022-02-20 16:39:11,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:39:11,277 INFO L225 Difference]: With dead ends: 66 [2022-02-20 16:39:11,277 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 16:39:11,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:39:11,278 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 4 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-02-20 16:39:11,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 264 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 1 Unknown, 11 Unchecked, 2.7s Time] [2022-02-20 16:39:11,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 16:39:11,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-02-20 16:39:11,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:39:11,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 56 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:11,284 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 56 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:11,284 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 56 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:11,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:11,286 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-02-20 16:39:11,286 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2022-02-20 16:39:11,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:11,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:11,287 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 56 states have internal predecessors, (74), 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 57 states. [2022-02-20 16:39:11,287 INFO L87 Difference]: Start difference. First operand has 57 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 56 states have internal predecessors, (74), 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 57 states. [2022-02-20 16:39:11,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:39:11,288 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-02-20 16:39:11,288 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2022-02-20 16:39:11,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:39:11,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:39:11,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:39:11,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:39:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 56 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:11,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2022-02-20 16:39:11,290 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 10 [2022-02-20 16:39:11,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:39:11,291 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2022-02-20 16:39:11,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:11,291 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2022-02-20 16:39:11,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:39:11,291 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:39:11,291 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:39:11,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 16:39:11,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:39:11,515 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:39:11,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:39:11,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1242386432, now seen corresponding path program 1 times [2022-02-20 16:39:11,517 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:39:11,517 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557619424] [2022-02-20 16:39:11,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:39:11,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:39:11,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:39:11,518 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:39:11,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:39:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:11,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:39:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:39:12,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:39:12,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {720#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~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)); {720#true} is VALID [2022-02-20 16:39:12,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {720#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret15#1, main_#t~ret16#1, main_#t~short17#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~Pluszero~FLOAT();assume { :begin_inline___ieee754_asinf } true;__ieee754_asinf_#in~x#1 := main_~x~0#1;havoc __ieee754_asinf_#res#1;havoc __ieee754_asinf_#t~mem10#1, __ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset, __ieee754_asinf_#t~ret11#1, __ieee754_asinf_#t~ret12#1, __ieee754_asinf_#t~mem13#1, __ieee754_asinf_~#gf_u~4#1.base, __ieee754_asinf_~#gf_u~4#1.offset, __ieee754_asinf_#t~mem14#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~1#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~1#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; {728#(= |ULTIMATE.start___ieee754_asinf_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:39:12,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {728#(= |ULTIMATE.start___ieee754_asinf_~x#1| (_ +zero 8 24))} call __ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_asinf_~x#1, __ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset, 4bv32);call __ieee754_asinf_#t~mem10#1 := read~intINTTYPE4(__ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset, 4bv32);__ieee754_asinf_~hx~1#1 := __ieee754_asinf_#t~mem10#1;havoc __ieee754_asinf_#t~mem10#1;call ULTIMATE.dealloc(__ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset);havoc __ieee754_asinf_~#gf_u~3#1.base, __ieee754_asinf_~#gf_u~3#1.offset; {732#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:39:12,462 INFO L290 TraceCheckUtils]: 3: Hoare triple {732#(= (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|)) (_ +zero 8 24))} goto; {732#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:39:12,463 INFO L290 TraceCheckUtils]: 4: Hoare triple {732#(= (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|)) (_ +zero 8 24))} __ieee754_asinf_~ix~2#1 := ~bvand32(2147483647bv32, __ieee754_asinf_~hx~1#1); {739#(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|)) (= (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|)) (_ +zero 8 24))))} is VALID [2022-02-20 16:39:12,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {739#(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|)) (= (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|)) (_ +zero 8 24))))} assume !(1065353216bv32 == __ieee754_asinf_~ix~2#1); {739#(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|)) (= (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|)) (_ +zero 8 24))))} is VALID [2022-02-20 16:39:12,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {739#(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|)) (= (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|)) (_ +zero 8 24))))} assume ~bvsgt32(__ieee754_asinf_~ix~2#1, 1065353216bv32);__ieee754_asinf_#res#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.sub~FLOAT(currentRoundingMode, __ieee754_asinf_~x#1, __ieee754_asinf_~x#1), ~fp.sub~FLOAT(currentRoundingMode, __ieee754_asinf_~x#1, __ieee754_asinf_~x#1)); {721#false} is VALID [2022-02-20 16:39:12,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {721#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;main_#t~short17#1 := ~fp.eq~FLOAT(main_~res~0#1, ~Pluszero~FLOAT()); {721#false} is VALID [2022-02-20 16:39:12,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {721#false} assume !main_#t~short17#1; {721#false} is VALID [2022-02-20 16:39:12,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {721#false} assume !main_#t~short17#1;havoc main_#t~ret16#1;havoc main_#t~short17#1; {721#false} is VALID [2022-02-20 16:39:12,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {721#false} assume !false; {721#false} is VALID [2022-02-20 16:39:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:39:12,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:39:12,586 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:39:12,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557619424] [2022-02-20 16:39:12,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557619424] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:39:12,587 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:39:12,587 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:39:12,587 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449098564] [2022-02-20 16:39:12,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:39:12,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:39:12,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:39:12,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:39:12,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:39:12,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:39:12,722 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:39:12,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:39:12,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:39:12,723 INFO L87 Difference]: Start difference. First operand 57 states and 74 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)