./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0740.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_0740.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 572c7cb96a3cac2508d636eadb6e6d621d12dc30df0412537cec32d2105ec801 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:42:40,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:42:40,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:42:40,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:42:40,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:42:40,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:42:40,653 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:42:40,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:42:40,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:42:40,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:42:40,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:42:40,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:42:40,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:42:40,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:42:40,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:42:40,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:42:40,662 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:42:40,663 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:42:40,664 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:42:40,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:42:40,667 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:42:40,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:42:40,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:42:40,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:42:40,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:42:40,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:42:40,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:42:40,672 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:42:40,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:42:40,673 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:42:40,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:42:40,674 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:42:40,674 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:42:40,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:42:40,675 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:42:40,676 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:42:40,676 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:42:40,676 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:42:40,676 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:42:40,677 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:42:40,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:42:40,685 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:42:40,704 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:42:40,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:42:40,705 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:42:40,705 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:42:40,706 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:42:40,706 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:42:40,706 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:42:40,707 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:42:40,707 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:42:40,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:42:40,708 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:42:40,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:42:40,708 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:42:40,708 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:42:40,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:42:40,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:42:40,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:42:40,709 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:42:40,709 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:42:40,709 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:42:40,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:42:40,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:42:40,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:42:40,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:42:40,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:40,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:42:40,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:42:40,711 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:42:40,711 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:42:40,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:42:40,711 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:42:40,712 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:42:40,712 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:42:40,712 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 -> 572c7cb96a3cac2508d636eadb6e6d621d12dc30df0412537cec32d2105ec801 [2022-02-20 16:42:40,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:42:40,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:42:40,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:42:40,969 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:42:40,969 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:42:40,970 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0740.c [2022-02-20 16:42:41,014 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52fb5b1f1/86a8b1aa731b47daad33be935e94401f/FLAGebc0bd62f [2022-02-20 16:42:41,346 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:42:41,347 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0740.c [2022-02-20 16:42:41,361 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52fb5b1f1/86a8b1aa731b47daad33be935e94401f/FLAGebc0bd62f [2022-02-20 16:42:41,765 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52fb5b1f1/86a8b1aa731b47daad33be935e94401f [2022-02-20 16:42:41,767 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:42:41,768 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:42:41,769 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:41,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:42:41,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:42:41,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:41" (1/1) ... [2022-02-20 16:42:41,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5ddaa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:41, skipping insertion in model container [2022-02-20 16:42:41,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:41" (1/1) ... [2022-02-20 16:42:41,778 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:42:41,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:42:41,964 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_0740.c[1930,1943] [2022-02-20 16:42:41,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:41,973 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:42:42,015 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_0740.c[1930,1943] [2022-02-20 16:42:42,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:42,025 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:42:42,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:42 WrapperNode [2022-02-20 16:42:42,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:42,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:42,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:42:42,027 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:42:42,033 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:42:42" (1/1) ... [2022-02-20 16:42:42,050 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:42:42" (1/1) ... [2022-02-20 16:42:42,083 INFO L137 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-02-20 16:42:42,083 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:42,084 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:42:42,084 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:42:42,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:42:42,090 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:42" (1/1) ... [2022-02-20 16:42:42,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:42" (1/1) ... [2022-02-20 16:42:42,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:42" (1/1) ... [2022-02-20 16:42:42,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:42" (1/1) ... [2022-02-20 16:42:42,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:42" (1/1) ... [2022-02-20 16:42:42,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:42" (1/1) ... [2022-02-20 16:42:42,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:42" (1/1) ... [2022-02-20 16:42:42,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:42:42,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:42:42,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:42:42,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:42:42,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:42" (1/1) ... [2022-02-20 16:42:42,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:42,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:42:42,147 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:42:42,169 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:42:42,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:42:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:42:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:42:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:42:42,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:42:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:42:42,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:42:42,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:42:42,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:42:42,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:42:42,275 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:42:42,276 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:42:42,550 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:42:42,556 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:42:42,557 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:42:42,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:42 BoogieIcfgContainer [2022-02-20 16:42:42,559 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:42:42,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:42:42,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:42:42,563 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:42:42,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:42:41" (1/3) ... [2022-02-20 16:42:42,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aaf0aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:42, skipping insertion in model container [2022-02-20 16:42:42,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:42" (2/3) ... [2022-02-20 16:42:42,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aaf0aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:42, skipping insertion in model container [2022-02-20 16:42:42,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:42" (3/3) ... [2022-02-20 16:42:42,567 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0740.c [2022-02-20 16:42:42,571 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:42:42,571 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:42:42,616 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:42:42,623 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:42:42,624 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:42:42,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 39 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:42,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:42:42,638 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:42,639 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:42,639 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:42,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:42,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1826743550, now seen corresponding path program 1 times [2022-02-20 16:42:42,650 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:42,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207279429] [2022-02-20 16:42:42,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:42,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:42,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~one_sqrt~0 := 1.0;~tiny_sqrt~0 := 1.0E-30; {43#true} is VALID [2022-02-20 16:42:42,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);assume { :begin_inline___ieee754_sqrtf } true;__ieee754_sqrtf_#in~x#1 := main_~x~0#1;havoc __ieee754_sqrtf_#res#1;havoc __ieee754_sqrtf_#t~mem4#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, __ieee754_sqrtf_#t~post6#1, __ieee754_sqrtf_#t~mem8#1, __ieee754_sqrtf_~#sf_u~0#1.base, __ieee754_sqrtf_~#sf_u~0#1.offset, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~z~0#1, __ieee754_sqrtf_~r~0#1, __ieee754_sqrtf_~hx~0#1, __ieee754_sqrtf_~ix~0#1, __ieee754_sqrtf_~s~0#1, __ieee754_sqrtf_~q~0#1, __ieee754_sqrtf_~m~0#1, __ieee754_sqrtf_~t~0#1, __ieee754_sqrtf_~i~0#1, __ieee754_sqrtf_#t~nondet5#1, __ieee754_sqrtf_#t~nondet7#1;__ieee754_sqrtf_~x#1 := __ieee754_sqrtf_#in~x#1;havoc __ieee754_sqrtf_~z~0#1;havoc __ieee754_sqrtf_~r~0#1;havoc __ieee754_sqrtf_~hx~0#1;havoc __ieee754_sqrtf_~ix~0#1;havoc __ieee754_sqrtf_~s~0#1;havoc __ieee754_sqrtf_~q~0#1;havoc __ieee754_sqrtf_~m~0#1;havoc __ieee754_sqrtf_~t~0#1;havoc __ieee754_sqrtf_~i~0#1; {43#true} is VALID [2022-02-20 16:42:42,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume !true; {44#false} is VALID [2022-02-20 16:42:42,774 INFO L290 TraceCheckUtils]: 3: Hoare triple {44#false} assume 0 == __ieee754_sqrtf_~ix~0#1;__ieee754_sqrtf_~hx~0#1 := 0; {44#false} is VALID [2022-02-20 16:42:42,774 INFO L290 TraceCheckUtils]: 4: Hoare triple {44#false} assume !(__ieee754_sqrtf_~hx~0#1 % 4294967296 < 2139095040);__ieee754_sqrtf_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(__ieee754_sqrtf_~x#1, __ieee754_sqrtf_~x#1), __ieee754_sqrtf_~x#1); {44#false} is VALID [2022-02-20 16:42:42,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {44#false} main_#t~ret9#1 := __ieee754_sqrtf_#res#1;assume { :end_inline___ieee754_sqrtf } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x#1, isnan_float_~x#1) then 1 else 0); {44#false} is VALID [2022-02-20 16:42:42,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {44#false} main_#t~ret10#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret10#1 && main_#t~ret10#1 <= 2147483647; {44#false} is VALID [2022-02-20 16:42:42,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {44#false} assume 0 == main_#t~ret10#1;havoc main_#t~ret10#1; {44#false} is VALID [2022-02-20 16:42:42,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-02-20 16:42:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:42:42,778 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:42:42,778 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207279429] [2022-02-20 16:42:42,779 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207279429] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:42,779 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:42,780 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:42:42,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883704346] [2022-02-20 16:42:42,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:42,786 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:42:42,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:42,790 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:42:42,805 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:42:42,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:42:42,806 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:42:42,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:42:42,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:42:42,827 INFO L87 Difference]: Start difference. First operand has 40 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 39 states have internal predecessors, (65), 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:42:42,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:42,907 INFO L93 Difference]: Finished difference Result 78 states and 128 transitions. [2022-02-20 16:42:42,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:42:42,908 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:42:42,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:42,910 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:42:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 128 transitions. [2022-02-20 16:42:42,918 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:42:42,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 128 transitions. [2022-02-20 16:42:42,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 128 transitions. [2022-02-20 16:42:43,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:43,092 INFO L225 Difference]: With dead ends: 78 [2022-02-20 16:42:43,092 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 16:42:43,094 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:42:43,097 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:43,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:42:43,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 16:42:43,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-02-20 16:42:43,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:43,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:43,122 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:43,122 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:43,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:43,125 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-02-20 16:42:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2022-02-20 16:42:43,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:43,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:43,127 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-20 16:42:43,129 INFO L87 Difference]: Start difference. First operand has 37 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-20 16:42:43,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:43,131 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-02-20 16:42:43,132 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2022-02-20 16:42:43,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:43,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:43,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:43,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:43,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2022-02-20 16:42:43,137 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 9 [2022-02-20 16:42:43,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:43,138 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-02-20 16:42:43,138 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:42:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2022-02-20 16:42:43,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:42:43,139 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:43,139 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:43,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:42:43,141 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:43,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:43,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1561607263, now seen corresponding path program 1 times [2022-02-20 16:42:43,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:43,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193158760] [2022-02-20 16:42:43,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:43,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:43,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~one_sqrt~0 := 1.0;~tiny_sqrt~0 := 1.0E-30; {256#true} is VALID [2022-02-20 16:42:43,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(~someUnaryFLOAToperation(1.0), 0.0);assume { :begin_inline___ieee754_sqrtf } true;__ieee754_sqrtf_#in~x#1 := main_~x~0#1;havoc __ieee754_sqrtf_#res#1;havoc __ieee754_sqrtf_#t~mem4#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, __ieee754_sqrtf_#t~post6#1, __ieee754_sqrtf_#t~mem8#1, __ieee754_sqrtf_~#sf_u~0#1.base, __ieee754_sqrtf_~#sf_u~0#1.offset, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~z~0#1, __ieee754_sqrtf_~r~0#1, __ieee754_sqrtf_~hx~0#1, __ieee754_sqrtf_~ix~0#1, __ieee754_sqrtf_~s~0#1, __ieee754_sqrtf_~q~0#1, __ieee754_sqrtf_~m~0#1, __ieee754_sqrtf_~t~0#1, __ieee754_sqrtf_~i~0#1, __ieee754_sqrtf_#t~nondet5#1, __ieee754_sqrtf_#t~nondet7#1;__ieee754_sqrtf_~x#1 := __ieee754_sqrtf_#in~x#1;havoc __ieee754_sqrtf_~z~0#1;havoc __ieee754_sqrtf_~r~0#1;havoc __ieee754_sqrtf_~hx~0#1;havoc __ieee754_sqrtf_~ix~0#1;havoc __ieee754_sqrtf_~s~0#1;havoc __ieee754_sqrtf_~q~0#1;havoc __ieee754_sqrtf_~m~0#1;havoc __ieee754_sqrtf_~t~0#1;havoc __ieee754_sqrtf_~i~0#1; {256#true} is VALID [2022-02-20 16:42:43,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} call __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4);call write~real(__ieee754_sqrtf_~x#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, 4);call __ieee754_sqrtf_#t~mem4#1 := read~int(__ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, 4);__ieee754_sqrtf_~ix~0#1 := (if __ieee754_sqrtf_#t~mem4#1 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_sqrtf_#t~mem4#1 % 4294967296 % 4294967296 else __ieee754_sqrtf_#t~mem4#1 % 4294967296 % 4294967296 - 4294967296);havoc __ieee754_sqrtf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset);havoc __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset; {256#true} is VALID [2022-02-20 16:42:43,254 INFO L290 TraceCheckUtils]: 3: Hoare triple {256#true} goto; {256#true} is VALID [2022-02-20 16:42:43,254 INFO L290 TraceCheckUtils]: 4: Hoare triple {256#true} assume 0 == __ieee754_sqrtf_~ix~0#1;__ieee754_sqrtf_~hx~0#1 := 0; {258#(= |ULTIMATE.start___ieee754_sqrtf_~hx~0#1| 0)} is VALID [2022-02-20 16:42:43,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {258#(= |ULTIMATE.start___ieee754_sqrtf_~hx~0#1| 0)} assume !(__ieee754_sqrtf_~hx~0#1 % 4294967296 < 2139095040);__ieee754_sqrtf_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(__ieee754_sqrtf_~x#1, __ieee754_sqrtf_~x#1), __ieee754_sqrtf_~x#1); {257#false} is VALID [2022-02-20 16:42:43,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {257#false} main_#t~ret9#1 := __ieee754_sqrtf_#res#1;assume { :end_inline___ieee754_sqrtf } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x#1, isnan_float_~x#1) then 1 else 0); {257#false} is VALID [2022-02-20 16:42:43,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {257#false} main_#t~ret10#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret10#1 && main_#t~ret10#1 <= 2147483647; {257#false} is VALID [2022-02-20 16:42:43,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {257#false} assume 0 == main_#t~ret10#1;havoc main_#t~ret10#1; {257#false} is VALID [2022-02-20 16:42:43,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-02-20 16:42:43,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:42:43,256 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:42:43,257 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193158760] [2022-02-20 16:42:43,257 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193158760] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:43,257 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:43,257 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:42:43,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468272128] [2022-02-20 16:42:43,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:43,260 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:42:43,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:43,261 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:42:43,269 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:42:43,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:42:43,270 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:42:43,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:42:43,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:42:43,271 INFO L87 Difference]: Start difference. First operand 37 states and 50 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:42:43,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:43,347 INFO L93 Difference]: Finished difference Result 71 states and 94 transitions. [2022-02-20 16:42:43,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:42:43,348 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:42:43,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:43,348 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:42:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2022-02-20 16:42:43,349 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:42:43,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2022-02-20 16:42:43,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2022-02-20 16:42:43,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:43,419 INFO L225 Difference]: With dead ends: 71 [2022-02-20 16:42:43,419 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 16:42:43,422 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:42:43,424 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:43,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:42:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 16:42:43,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2022-02-20 16:42:43,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:43,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:43,428 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:43,429 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:43,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:43,430 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-02-20 16:42:43,430 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-02-20 16:42:43,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:43,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:43,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 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 44 states. [2022-02-20 16:42:43,431 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 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 44 states. [2022-02-20 16:42:43,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:43,433 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-02-20 16:42:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-02-20 16:42:43,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:43,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:43,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:43,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:43,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-02-20 16:42:43,435 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 10 [2022-02-20 16:42:43,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:43,436 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-02-20 16:42:43,436 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:42:43,436 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-02-20 16:42:43,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:42:43,436 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:43,437 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:43,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:42:43,437 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:43,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:43,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1121717072, now seen corresponding path program 1 times [2022-02-20 16:42:43,438 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:43,438 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542636986] [2022-02-20 16:42:43,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:43,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:42:43,458 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:42:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:42:43,484 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:42:43,484 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:42:43,485 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:42:43,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:42:43,488 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:42:43,490 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:42:43,504 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:42:43,505 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:42:43,505 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-02-20 16:42:43,505 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-02-20 16:42:43,505 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 16:42:43,505 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 16:42:43,505 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 16:42:43,505 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 16:42:43,505 WARN L170 areAnnotationChecker]: L29-7 has no Hoare annotation [2022-02-20 16:42:43,506 WARN L170 areAnnotationChecker]: L29-7 has no Hoare annotation [2022-02-20 16:42:43,506 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-20 16:42:43,506 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-20 16:42:43,506 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-02-20 16:42:43,506 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:42:43,506 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:42:43,506 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-02-20 16:42:43,506 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-02-20 16:42:43,507 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 16:42:43,507 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:42:43,507 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:42:43,507 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2022-02-20 16:42:43,507 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2022-02-20 16:42:43,507 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-02-20 16:42:43,507 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-02-20 16:42:43,507 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:42:43,508 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:42:43,508 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-02-20 16:42:43,508 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-02-20 16:42:43,508 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2022-02-20 16:42:43,508 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-02-20 16:42:43,508 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-02-20 16:42:43,508 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-02-20 16:42:43,508 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-20 16:42:43,508 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:42:43,509 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2022-02-20 16:42:43,509 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 16:42:43,509 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:42:43,509 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:42:43,509 WARN L170 areAnnotationChecker]: L46-8 has no Hoare annotation [2022-02-20 16:42:43,509 WARN L170 areAnnotationChecker]: L46-8 has no Hoare annotation [2022-02-20 16:42:43,509 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2022-02-20 16:42:43,509 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2022-02-20 16:42:43,509 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-02-20 16:42:43,510 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-02-20 16:42:43,510 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-02-20 16:42:43,510 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:42:43,510 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:42:43,510 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:42:43,510 WARN L170 areAnnotationChecker]: L46-6 has no Hoare annotation [2022-02-20 16:42:43,510 WARN L170 areAnnotationChecker]: L46-6 has no Hoare annotation [2022-02-20 16:42:43,510 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2022-02-20 16:42:43,511 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2022-02-20 16:42:43,511 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:42:43,511 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:42:43,511 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:42:43,511 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:42:43,511 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:42:43,511 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-02-20 16:42:43,511 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:42:43,511 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:42:43,512 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:42:43,512 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:42:43,512 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:42:43,512 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:42:43,512 WARN L170 areAnnotationChecker]: L78-3 has no Hoare annotation [2022-02-20 16:42:43,512 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:42:43,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:42:43 BoogieIcfgContainer [2022-02-20 16:42:43,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:42:43,513 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:42:43,514 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:42:43,514 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:42:43,514 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:42" (3/4) ... [2022-02-20 16:42:43,516 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:42:43,516 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:42:43,517 INFO L158 Benchmark]: Toolchain (without parser) took 1749.30ms. Allocated memory was 125.8MB in the beginning and 167.8MB in the end (delta: 41.9MB). Free memory was 87.3MB in the beginning and 104.2MB in the end (delta: -17.0MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2022-02-20 16:42:43,518 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:43,518 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.30ms. Allocated memory is still 125.8MB. Free memory was 87.1MB in the beginning and 97.4MB in the end (delta: -10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:42:43,518 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.60ms. Allocated memory is still 125.8MB. Free memory was 97.4MB in the beginning and 95.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:43,518 INFO L158 Benchmark]: Boogie Preprocessor took 29.73ms. Allocated memory is still 125.8MB. Free memory was 95.3MB in the beginning and 93.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:43,519 INFO L158 Benchmark]: RCFGBuilder took 444.66ms. Allocated memory is still 125.8MB. Free memory was 93.7MB in the beginning and 76.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 16:42:43,519 INFO L158 Benchmark]: TraceAbstraction took 952.71ms. Allocated memory was 125.8MB in the beginning and 167.8MB in the end (delta: 41.9MB). Free memory was 76.4MB in the beginning and 105.3MB in the end (delta: -28.9MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2022-02-20 16:42:43,519 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 104.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:43,521 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.30ms. Allocated memory is still 125.8MB. Free memory was 87.1MB in the beginning and 97.4MB in the end (delta: -10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.60ms. Allocated memory is still 125.8MB. Free memory was 97.4MB in the beginning and 95.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.73ms. Allocated memory is still 125.8MB. Free memory was 95.3MB in the beginning and 93.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 444.66ms. Allocated memory is still 125.8MB. Free memory was 93.7MB in the beginning and 76.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 952.71ms. Allocated memory was 125.8MB in the beginning and 167.8MB in the end (delta: 41.9MB). Free memory was 76.4MB in the beginning and 105.3MB in the end (delta: -28.9MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 104.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 99]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 15, overapproximation of someBinaryArithmeticFLOAToperation at line 93. Possible FailurePath: [L17] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L93] float x = -1.0f / 0.0f; [L95] CALL, EXPR __ieee754_sqrtf(x) [L20] float z; [L21] __uint32_t r, hx; [L22] __int32_t ix, s, q, m, t, i; VAL [\old(x)=4294967297, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967297] [L25] ieee_float_shape_type gf_u; [L26] gf_u.value = (x) [L27] EXPR gf_u.word [L27] (ix) = gf_u.word [L29] hx = ix & 0x7fffffff VAL [\old(x)=4294967297, hx=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967297] [L31] COND FALSE !(!((hx) < 0x7f800000L)) VAL [\old(x)=4294967297, hx=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967297] [L34] COND TRUE ((hx) == 0) [L35] return x; VAL [\old(x)=4294967297, \result=4294967297, hx=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967297] [L95] RET, EXPR __ieee754_sqrtf(x) [L95] float res = __ieee754_sqrtf(x); [L98] CALL, EXPR isnan_float(res) [L15] return x != x; VAL [\old(x)=4294967297, \result=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967297] [L98] RET, EXPR isnan_float(res) [L98] COND TRUE !isnan_float(res) [L99] reach_error() VAL [one_sqrt=1, res=4294967297, tiny_sqrt=1/1000000000000000000000000000000, x=4294967297] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 141 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 101 mSDtfsCounter, 11 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=40occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 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:42:43,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0740.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 572c7cb96a3cac2508d636eadb6e6d621d12dc30df0412537cec32d2105ec801 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:42:45,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:42:45,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:42:45,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:42:45,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:42:45,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:42:45,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:42:45,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:42:45,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:42:45,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:42:45,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:42:45,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:42:45,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:42:45,588 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:42:45,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:42:45,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:42:45,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:42:45,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:42:45,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:42:45,599 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:42:45,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:42:45,601 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:42:45,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:42:45,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:42:45,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:42:45,607 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:42:45,608 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:42:45,609 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:42:45,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:42:45,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:42:45,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:42:45,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:42:45,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:42:45,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:42:45,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:42:45,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:42:45,614 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:42:45,614 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:42:45,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:42:45,615 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:42:45,616 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:42:45,617 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:42:45,656 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:42:45,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:42:45,658 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:42:45,658 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:42:45,659 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:42:45,659 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:42:45,660 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:42:45,660 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:42:45,660 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:42:45,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:42:45,661 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:42:45,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:42:45,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:42:45,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:42:45,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:42:45,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:42:45,662 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:42:45,662 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:42:45,662 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:42:45,662 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:42:45,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:42:45,662 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:42:45,663 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:42:45,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:42:45,663 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:42:45,663 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:42:45,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:45,663 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:42:45,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:42:45,664 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:42:45,664 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:42:45,664 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:42:45,664 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:42:45,664 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:42:45,665 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:42:45,665 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:42:45,665 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 -> 572c7cb96a3cac2508d636eadb6e6d621d12dc30df0412537cec32d2105ec801 [2022-02-20 16:42:45,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:42:46,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:42:46,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:42:46,008 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:42:46,009 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:42:46,011 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0740.c [2022-02-20 16:42:46,060 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6cfd2f57/0a252f7d8f3e48519fe8adb56281917b/FLAGfcb089967 [2022-02-20 16:42:46,450 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:42:46,450 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0740.c [2022-02-20 16:42:46,456 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6cfd2f57/0a252f7d8f3e48519fe8adb56281917b/FLAGfcb089967 [2022-02-20 16:42:46,848 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6cfd2f57/0a252f7d8f3e48519fe8adb56281917b [2022-02-20 16:42:46,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:42:46,852 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:42:46,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:46,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:42:46,857 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:42:46,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:46" (1/1) ... [2022-02-20 16:42:46,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ea52d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:46, skipping insertion in model container [2022-02-20 16:42:46,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:46" (1/1) ... [2022-02-20 16:42:46,866 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:42:46,880 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:42:47,007 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_0740.c[1930,1943] [2022-02-20 16:42:47,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:47,047 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:42:47,093 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_0740.c[1930,1943] [2022-02-20 16:42:47,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:47,110 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:42:47,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:47 WrapperNode [2022-02-20 16:42:47,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:47,112 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:47,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:42:47,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:42:47,117 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:42:47" (1/1) ... [2022-02-20 16:42:47,124 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:42:47" (1/1) ... [2022-02-20 16:42:47,149 INFO L137 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2022-02-20 16:42:47,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:47,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:42:47,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:42:47,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:42:47,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:47" (1/1) ... [2022-02-20 16:42:47,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:47" (1/1) ... [2022-02-20 16:42:47,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:47" (1/1) ... [2022-02-20 16:42:47,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:47" (1/1) ... [2022-02-20 16:42:47,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:47" (1/1) ... [2022-02-20 16:42:47,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:47" (1/1) ... [2022-02-20 16:42:47,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:47" (1/1) ... [2022-02-20 16:42:47,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:42:47,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:42:47,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:42:47,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:42:47,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:47" (1/1) ... [2022-02-20 16:42:47,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:47,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:42:47,234 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:42:47,256 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:42:47,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:42:47,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:42:47,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:42:47,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:42:47,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:42:47,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:42:47,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:42:47,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:42:47,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:42:47,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:42:47,357 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:42:47,360 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:42:48,027 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:42:48,031 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:42:48,032 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:42:48,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:48 BoogieIcfgContainer [2022-02-20 16:42:48,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:42:48,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:42:48,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:42:48,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:42:48,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:42:46" (1/3) ... [2022-02-20 16:42:48,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@742adca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:48, skipping insertion in model container [2022-02-20 16:42:48,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:47" (2/3) ... [2022-02-20 16:42:48,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@742adca6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:48, skipping insertion in model container [2022-02-20 16:42:48,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:48" (3/3) ... [2022-02-20 16:42:48,038 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0740.c [2022-02-20 16:42:48,041 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:42:48,042 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:42:48,069 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:42:48,074 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:42:48,074 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:42:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:42:48,090 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:48,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:48,091 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:48,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:48,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1903734416, now seen corresponding path program 1 times [2022-02-20 16:42:48,102 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:48,103 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518562751] [2022-02-20 16:42:48,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:48,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:48,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:48,105 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:42:48,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:42:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:48,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:42:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:48,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:48,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30)); {36#true} is VALID [2022-02-20 16:42:48,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_sqrtf } true;__ieee754_sqrtf_#in~x#1 := main_~x~0#1;havoc __ieee754_sqrtf_#res#1;havoc __ieee754_sqrtf_#t~mem4#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, __ieee754_sqrtf_#t~post5#1, __ieee754_sqrtf_#t~mem6#1, __ieee754_sqrtf_~#sf_u~0#1.base, __ieee754_sqrtf_~#sf_u~0#1.offset, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~z~0#1, __ieee754_sqrtf_~r~0#1, __ieee754_sqrtf_~hx~0#1, __ieee754_sqrtf_~ix~0#1, __ieee754_sqrtf_~s~0#1, __ieee754_sqrtf_~q~0#1, __ieee754_sqrtf_~m~0#1, __ieee754_sqrtf_~t~0#1, __ieee754_sqrtf_~i~0#1;__ieee754_sqrtf_~x#1 := __ieee754_sqrtf_#in~x#1;havoc __ieee754_sqrtf_~z~0#1;havoc __ieee754_sqrtf_~r~0#1;havoc __ieee754_sqrtf_~hx~0#1;havoc __ieee754_sqrtf_~ix~0#1;havoc __ieee754_sqrtf_~s~0#1;havoc __ieee754_sqrtf_~q~0#1;havoc __ieee754_sqrtf_~m~0#1;havoc __ieee754_sqrtf_~t~0#1;havoc __ieee754_sqrtf_~i~0#1; {36#true} is VALID [2022-02-20 16:42:48,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume !true; {37#false} is VALID [2022-02-20 16:42:48,340 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#false} __ieee754_sqrtf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_sqrtf_~ix~0#1); {37#false} is VALID [2022-02-20 16:42:48,340 INFO L290 TraceCheckUtils]: 4: Hoare triple {37#false} assume !~bvult32(__ieee754_sqrtf_~hx~0#1, 2139095040bv32);__ieee754_sqrtf_#res#1 := ~fp.add~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~x#1), __ieee754_sqrtf_~x#1); {37#false} is VALID [2022-02-20 16:42:48,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#false} main_#t~ret7#1 := __ieee754_sqrtf_#res#1;assume { :end_inline___ieee754_sqrtf } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {37#false} is VALID [2022-02-20 16:42:48,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#false} main_#t~ret8#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {37#false} is VALID [2022-02-20 16:42:48,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#false} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {37#false} is VALID [2022-02-20 16:42:48,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-02-20 16:42:48,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:42:48,342 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:48,342 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:48,342 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518562751] [2022-02-20 16:42:48,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518562751] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:48,343 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:48,343 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:42:48,344 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467779118] [2022-02-20 16:42:48,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:48,348 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:42:48,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:48,350 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:42:48,430 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:42:48,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:42:48,430 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:48,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:42:48,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:42:48,455 INFO L87 Difference]: Start difference. First operand has 33 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 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:42:48,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:48,818 INFO L93 Difference]: Finished difference Result 64 states and 98 transitions. [2022-02-20 16:42:48,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:42:48,818 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:42:48,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:48,819 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:42:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2022-02-20 16:42:48,824 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:42:48,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2022-02-20 16:42:48,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 98 transitions. [2022-02-20 16:42:49,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:49,264 INFO L225 Difference]: With dead ends: 64 [2022-02-20 16:42:49,264 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 16:42:49,266 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:42:49,268 INFO L933 BasicCegarLoop]: 43 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, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:49,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:42:49,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 16:42:49,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 16:42:49,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:49,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:49,300 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:49,311 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:49,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:49,317 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-20 16:42:49,323 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-20 16:42:49,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:49,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:49,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-20 16:42:49,325 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 30 states. [2022-02-20 16:42:49,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:49,328 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-20 16:42:49,328 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-20 16:42:49,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:49,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:49,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:49,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:49,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:49,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2022-02-20 16:42:49,339 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 9 [2022-02-20 16:42:49,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:49,350 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-02-20 16:42:49,351 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:42:49,351 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-20 16:42:49,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:42:49,352 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:49,352 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:49,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 16:42:49,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:42:49,553 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:49,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:49,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1484616397, now seen corresponding path program 1 times [2022-02-20 16:42:49,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:49,554 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786763883] [2022-02-20 16:42:49,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:49,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:49,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:49,556 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:42:49,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:42:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:49,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:42:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:49,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:49,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {238#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30)); {243#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:42:49,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_sqrtf } true;__ieee754_sqrtf_#in~x#1 := main_~x~0#1;havoc __ieee754_sqrtf_#res#1;havoc __ieee754_sqrtf_#t~mem4#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, __ieee754_sqrtf_#t~post5#1, __ieee754_sqrtf_#t~mem6#1, __ieee754_sqrtf_~#sf_u~0#1.base, __ieee754_sqrtf_~#sf_u~0#1.offset, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~z~0#1, __ieee754_sqrtf_~r~0#1, __ieee754_sqrtf_~hx~0#1, __ieee754_sqrtf_~ix~0#1, __ieee754_sqrtf_~s~0#1, __ieee754_sqrtf_~q~0#1, __ieee754_sqrtf_~m~0#1, __ieee754_sqrtf_~t~0#1, __ieee754_sqrtf_~i~0#1;__ieee754_sqrtf_~x#1 := __ieee754_sqrtf_#in~x#1;havoc __ieee754_sqrtf_~z~0#1;havoc __ieee754_sqrtf_~r~0#1;havoc __ieee754_sqrtf_~hx~0#1;havoc __ieee754_sqrtf_~ix~0#1;havoc __ieee754_sqrtf_~s~0#1;havoc __ieee754_sqrtf_~q~0#1;havoc __ieee754_sqrtf_~m~0#1;havoc __ieee754_sqrtf_~t~0#1;havoc __ieee754_sqrtf_~i~0#1; {247#(and (= currentRoundingMode roundNearestTiesToEven) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_sqrtf_~x#1|))} is VALID [2022-02-20 16:42:49,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {247#(and (= currentRoundingMode roundNearestTiesToEven) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_sqrtf_~x#1|))} call __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_sqrtf_~x#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, 4bv32);call __ieee754_sqrtf_#t~mem4#1 := read~intINTTYPE4(__ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, 4bv32);__ieee754_sqrtf_~ix~0#1 := __ieee754_sqrtf_#t~mem4#1;havoc __ieee754_sqrtf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset);havoc __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset; {247#(and (= currentRoundingMode roundNearestTiesToEven) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_sqrtf_~x#1|))} is VALID [2022-02-20 16:42:49,884 INFO L290 TraceCheckUtils]: 3: Hoare triple {247#(and (= currentRoundingMode roundNearestTiesToEven) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_sqrtf_~x#1|))} goto; {247#(and (= currentRoundingMode roundNearestTiesToEven) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_sqrtf_~x#1|))} is VALID [2022-02-20 16:42:49,884 INFO L290 TraceCheckUtils]: 4: Hoare triple {247#(and (= currentRoundingMode roundNearestTiesToEven) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_sqrtf_~x#1|))} __ieee754_sqrtf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_sqrtf_~ix~0#1); {247#(and (= currentRoundingMode roundNearestTiesToEven) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_sqrtf_~x#1|))} is VALID [2022-02-20 16:42:49,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {247#(and (= currentRoundingMode roundNearestTiesToEven) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_sqrtf_~x#1|))} assume !~bvult32(__ieee754_sqrtf_~hx~0#1, 2139095040bv32);__ieee754_sqrtf_#res#1 := ~fp.add~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~x#1), __ieee754_sqrtf_~x#1); {260#(= |ULTIMATE.start___ieee754_sqrtf_#res#1| (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))} is VALID [2022-02-20 16:42:49,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {260#(= |ULTIMATE.start___ieee754_sqrtf_#res#1| (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))} main_#t~ret7#1 := __ieee754_sqrtf_#res#1;assume { :end_inline___ieee754_sqrtf } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {264#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} is VALID [2022-02-20 16:42:49,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {264#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} main_#t~ret8#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {268#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret8#1|)} is VALID [2022-02-20 16:42:49,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {268#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret8#1|)} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {239#false} is VALID [2022-02-20 16:42:49,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {239#false} assume !false; {239#false} is VALID [2022-02-20 16:42:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:42:49,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:49,889 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:49,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786763883] [2022-02-20 16:42:49,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786763883] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:49,890 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:49,890 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:42:49,890 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089176044] [2022-02-20 16:42:49,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:49,896 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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:42:49,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:49,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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:42:49,952 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:42:49,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:42:49,956 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:49,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:42:49,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:42:49,956 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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:42:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:51,860 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-02-20 16:42:51,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:42:51,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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:42:51,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:51,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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:42:51,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-02-20 16:42:51,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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:42:51,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-02-20 16:42:51,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-02-20 16:42:52,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:52,115 INFO L225 Difference]: With dead ends: 35 [2022-02-20 16:42:52,115 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 16:42:52,116 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:42:52,116 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 44 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:52,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 123 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 16:42:52,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 16:42:52,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 16:42:52,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:52,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:52,120 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:52,120 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:52,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:52,121 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-02-20 16:42:52,121 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-02-20 16:42:52,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:52,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:52,122 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 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 30 states. [2022-02-20 16:42:52,122 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 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 30 states. [2022-02-20 16:42:52,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:52,123 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-02-20 16:42:52,123 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-02-20 16:42:52,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:52,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:52,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:52,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:52,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-02-20 16:42:52,125 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 10 [2022-02-20 16:42:52,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:52,125 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-02-20 16:42:52,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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:42:52,125 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-02-20 16:42:52,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:42:52,126 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:52,126 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:52,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:42:52,337 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:42:52,338 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:52,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:52,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1245605874, now seen corresponding path program 1 times [2022-02-20 16:42:52,341 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:52,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792747684] [2022-02-20 16:42:52,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:52,343 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:52,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:52,344 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:42:52,346 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:42:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:52,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:42:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:52,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:52,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {419#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30)); {419#true} is VALID [2022-02-20 16:42:52,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {419#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0)), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_sqrtf } true;__ieee754_sqrtf_#in~x#1 := main_~x~0#1;havoc __ieee754_sqrtf_#res#1;havoc __ieee754_sqrtf_#t~mem4#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, __ieee754_sqrtf_#t~post5#1, __ieee754_sqrtf_#t~mem6#1, __ieee754_sqrtf_~#sf_u~0#1.base, __ieee754_sqrtf_~#sf_u~0#1.offset, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~z~0#1, __ieee754_sqrtf_~r~0#1, __ieee754_sqrtf_~hx~0#1, __ieee754_sqrtf_~ix~0#1, __ieee754_sqrtf_~s~0#1, __ieee754_sqrtf_~q~0#1, __ieee754_sqrtf_~m~0#1, __ieee754_sqrtf_~t~0#1, __ieee754_sqrtf_~i~0#1;__ieee754_sqrtf_~x#1 := __ieee754_sqrtf_#in~x#1;havoc __ieee754_sqrtf_~z~0#1;havoc __ieee754_sqrtf_~r~0#1;havoc __ieee754_sqrtf_~hx~0#1;havoc __ieee754_sqrtf_~ix~0#1;havoc __ieee754_sqrtf_~s~0#1;havoc __ieee754_sqrtf_~q~0#1;havoc __ieee754_sqrtf_~m~0#1;havoc __ieee754_sqrtf_~t~0#1;havoc __ieee754_sqrtf_~i~0#1; {427#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_sqrtf_~x#1|))} is VALID [2022-02-20 16:42:52,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {427#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_sqrtf_~x#1|))} call __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_sqrtf_~x#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, 4bv32);call __ieee754_sqrtf_#t~mem4#1 := read~intINTTYPE4(__ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, 4bv32);__ieee754_sqrtf_~ix~0#1 := __ieee754_sqrtf_#t~mem4#1;havoc __ieee754_sqrtf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset);havoc __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset; {431#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|))))} is VALID [2022-02-20 16:42:52,630 INFO L290 TraceCheckUtils]: 3: Hoare triple {431#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|))))} goto; {431#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|))))} is VALID [2022-02-20 16:42:52,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {431#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|))))} __ieee754_sqrtf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_sqrtf_~ix~0#1); {438#(exists ((|ULTIMATE.start___ieee754_sqrtf_~ix~0#1| (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) |ULTIMATE.start___ieee754_sqrtf_~hx~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|))))))} is VALID [2022-02-20 16:42:52,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {438#(exists ((|ULTIMATE.start___ieee754_sqrtf_~ix~0#1| (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) |ULTIMATE.start___ieee754_sqrtf_~hx~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|))))))} assume !!~bvult32(__ieee754_sqrtf_~hx~0#1, 2139095040bv32); {420#false} is VALID [2022-02-20 16:42:52,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {420#false} assume 0bv32 == __ieee754_sqrtf_~hx~0#1;__ieee754_sqrtf_#res#1 := __ieee754_sqrtf_~x#1; {420#false} is VALID [2022-02-20 16:42:52,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {420#false} main_#t~ret7#1 := __ieee754_sqrtf_#res#1;assume { :end_inline___ieee754_sqrtf } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {420#false} is VALID [2022-02-20 16:42:52,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {420#false} main_#t~ret8#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {420#false} is VALID [2022-02-20 16:42:52,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {420#false} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {420#false} is VALID [2022-02-20 16:42:52,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {420#false} assume !false; {420#false} is VALID [2022-02-20 16:42:52,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:42:52,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:52,634 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:52,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792747684] [2022-02-20 16:42:52,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792747684] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:52,635 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:52,635 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:42:52,635 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210657617] [2022-02-20 16:42:52,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:52,635 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:42:52,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:52,635 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:42:52,654 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:42:52,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:42:52,655 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:52,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:42:52,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:42:52,656 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:52,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:52,687 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-02-20 16:42:52,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:42:52,688 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:42:52,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:52,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-02-20 16:42:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-02-20 16:42:52,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-02-20 16:42:52,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:52,749 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:42:52,749 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:42:52,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:42:52,750 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:52,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-02-20 16:42:52,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:42:52,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:42:52,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:52,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:52,752 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:52,752 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:52,752 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:42:52,752 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:42:52,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:52,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:52,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-20 16:42:52,752 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-20 16:42:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:52,753 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:42:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:42:52,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:52,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:52,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:52,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:52,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:52,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:42:52,753 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2022-02-20 16:42:52,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:52,753 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:42:52,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:42:52,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:52,755 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:42:52,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:42:52,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:42:52,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:42:53,029 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2022-02-20 16:42:53,030 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:42:53,030 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:42:53,030 INFO L858 garLoopResultBuilder]: For program point L78-1(lines 78 82) no Hoare annotation was computed. [2022-02-20 16:42:53,030 INFO L854 garLoopResultBuilder]: At program point L78-2(lines 78 82) the Hoare annotation is: false [2022-02-20 16:42:53,030 INFO L858 garLoopResultBuilder]: For program point L78-3(lines 78 82) no Hoare annotation was computed. [2022-02-20 16:42:53,030 INFO L861 garLoopResultBuilder]: At program point L103(lines 86 104) the Hoare annotation is: true [2022-02-20 16:42:53,030 INFO L858 garLoopResultBuilder]: For program point L70(lines 70 73) no Hoare annotation was computed. [2022-02-20 16:42:53,030 INFO L854 garLoopResultBuilder]: At program point L55-2(lines 55 64) the Hoare annotation is: false [2022-02-20 16:42:53,030 INFO L858 garLoopResultBuilder]: For program point L55-3(lines 19 84) no Hoare annotation was computed. [2022-02-20 16:42:53,030 INFO L858 garLoopResultBuilder]: For program point L47(lines 47 48) no Hoare annotation was computed. [2022-02-20 16:42:53,030 INFO L858 garLoopResultBuilder]: For program point L47-2(lines 47 48) no Hoare annotation was computed. [2022-02-20 16:42:53,030 INFO L858 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2022-02-20 16:42:53,030 INFO L854 garLoopResultBuilder]: At program point L15(line 15) the Hoare annotation is: (and (= |ULTIMATE.start___ieee754_sqrtf_#res#1| (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))) (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse0) .cse0))) (= currentRoundingMode roundNearestTiesToEven) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_sqrtf_~x#1|)) [2022-02-20 16:42:53,031 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 44) no Hoare annotation was computed. [2022-02-20 16:42:53,031 INFO L858 garLoopResultBuilder]: For program point L40-2(lines 40 44) no Hoare annotation was computed. [2022-02-20 16:42:53,031 INFO L858 garLoopResultBuilder]: For program point L98(lines 98 101) no Hoare annotation was computed. [2022-02-20 16:42:53,031 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:42:53,031 INFO L858 garLoopResultBuilder]: For program point L57(lines 57 61) no Hoare annotation was computed. [2022-02-20 16:42:53,031 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 99) no Hoare annotation was computed. [2022-02-20 16:42:53,031 INFO L858 garLoopResultBuilder]: For program point L24-1(lines 24 28) no Hoare annotation was computed. [2022-02-20 16:42:53,031 INFO L858 garLoopResultBuilder]: For program point L57-2(lines 57 61) no Hoare annotation was computed. [2022-02-20 16:42:53,031 INFO L854 garLoopResultBuilder]: At program point L24-2(lines 24 28) the Hoare annotation is: (and (= currentRoundingMode roundNearestTiesToEven) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_sqrtf_~x#1|)) [2022-02-20 16:42:53,032 INFO L858 garLoopResultBuilder]: For program point L24-3(lines 24 28) no Hoare annotation was computed. [2022-02-20 16:42:53,032 INFO L858 garLoopResultBuilder]: For program point L41-2(lines 41 42) no Hoare annotation was computed. [2022-02-20 16:42:53,032 INFO L854 garLoopResultBuilder]: At program point L41-3(lines 41 42) the Hoare annotation is: false [2022-02-20 16:42:53,032 INFO L858 garLoopResultBuilder]: For program point L41-4(lines 41 42) no Hoare annotation was computed. [2022-02-20 16:42:53,032 INFO L858 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2022-02-20 16:42:53,032 INFO L858 garLoopResultBuilder]: For program point L66(lines 66 75) no Hoare annotation was computed. [2022-02-20 16:42:53,032 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:42:53,032 INFO L854 garLoopResultBuilder]: At program point L83(lines 19 84) the Hoare annotation is: (and (= |ULTIMATE.start___ieee754_sqrtf_#res#1| (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))) (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse0) .cse0))) (= currentRoundingMode roundNearestTiesToEven) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_sqrtf_~x#1|)) [2022-02-20 16:42:53,032 INFO L858 garLoopResultBuilder]: For program point L34(lines 34 35) no Hoare annotation was computed. [2022-02-20 16:42:53,032 INFO L858 garLoopResultBuilder]: For program point L68(lines 68 74) no Hoare annotation was computed. [2022-02-20 16:42:53,034 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:42:53,035 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:42:53,038 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:42:53,038 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:42:53,038 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 16:42:53,038 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 16:42:53,038 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 16:42:53,038 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 16:42:53,038 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 16:42:53,038 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:42:53,038 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:42:53,039 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:42:53,040 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:42:53,040 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-02-20 16:42:53,040 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:42:53,040 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:42:53,040 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-02-20 16:42:53,040 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-02-20 16:42:53,040 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:42:53,040 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:42:53,040 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-02-20 16:42:53,040 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-02-20 16:42:53,041 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:42:53,041 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2022-02-20 16:42:53,041 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2022-02-20 16:42:53,041 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 16:42:53,041 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-20 16:42:53,041 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:42:53,041 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2022-02-20 16:42:53,041 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 16:42:53,041 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-02-20 16:42:53,041 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-02-20 16:42:53,042 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-02-20 16:42:53,042 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2022-02-20 16:42:53,042 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2022-02-20 16:42:53,042 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:42:53,042 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2022-02-20 16:42:53,042 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2022-02-20 16:42:53,042 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:42:53,042 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:42:53,042 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:42:53,042 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:42:53,043 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:42:53,043 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-02-20 16:42:53,043 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:42:53,043 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:42:53,043 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:42:53,043 WARN L170 areAnnotationChecker]: L78-3 has no Hoare annotation [2022-02-20 16:42:53,043 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:42:53,043 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:42:53,043 WARN L170 areAnnotationChecker]: L78-3 has no Hoare annotation [2022-02-20 16:42:53,043 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:42:53,047 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,049 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,050 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,051 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,051 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,051 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,051 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,051 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,052 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,052 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,052 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,052 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,052 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,052 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,053 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,053 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,053 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,053 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,053 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,053 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,053 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,054 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,054 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,054 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,054 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,054 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,054 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,055 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,055 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,055 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,055 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,055 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:42:53 BoogieIcfgContainer [2022-02-20 16:42:53,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:42:53,056 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:42:53,056 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:42:53,057 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:42:53,057 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:48" (3/4) ... [2022-02-20 16:42:53,059 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:42:53,065 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-02-20 16:42:53,065 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-02-20 16:42:53,065 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:42:53,065 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:42:53,081 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x [2022-02-20 16:42:53,082 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && 1bv32 == \result) && ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x [2022-02-20 16:42:53,093 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:42:53,093 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:42:53,094 INFO L158 Benchmark]: Toolchain (without parser) took 6241.84ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 43.2MB in the beginning and 30.5MB in the end (delta: 12.6MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2022-02-20 16:42:53,094 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 62.9MB. Free memory was 44.8MB in the beginning and 44.8MB in the end (delta: 44.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:53,094 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.06ms. Allocated memory is still 62.9MB. Free memory was 43.0MB in the beginning and 44.9MB in the end (delta: -1.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 16:42:53,095 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.53ms. Allocated memory is still 62.9MB. Free memory was 44.7MB in the beginning and 42.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:53,095 INFO L158 Benchmark]: Boogie Preprocessor took 51.01ms. Allocated memory is still 62.9MB. Free memory was 42.7MB in the beginning and 40.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:53,095 INFO L158 Benchmark]: RCFGBuilder took 830.51ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 40.8MB in the beginning and 56.6MB in the end (delta: -15.8MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2022-02-20 16:42:53,096 INFO L158 Benchmark]: TraceAbstraction took 5022.08ms. Allocated memory is still 75.5MB. Free memory was 56.2MB in the beginning and 33.6MB in the end (delta: 22.6MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2022-02-20 16:42:53,096 INFO L158 Benchmark]: Witness Printer took 36.91ms. Allocated memory is still 75.5MB. Free memory was 33.6MB in the beginning and 30.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:53,097 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 62.9MB. Free memory was 44.8MB in the beginning and 44.8MB in the end (delta: 44.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.06ms. Allocated memory is still 62.9MB. Free memory was 43.0MB in the beginning and 44.9MB in the end (delta: -1.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.53ms. Allocated memory is still 62.9MB. Free memory was 44.7MB in the beginning and 42.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.01ms. Allocated memory is still 62.9MB. Free memory was 42.7MB in the beginning and 40.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 830.51ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 40.8MB in the beginning and 56.6MB in the end (delta: -15.8MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5022.08ms. Allocated memory is still 75.5MB. Free memory was 56.2MB in the beginning and 33.6MB in the end (delta: 22.6MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Witness Printer took 36.91ms. Allocated memory is still 75.5MB. Free memory was 33.6MB in the beginning and 30.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * 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 - PositiveResult [Line: 99]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 174 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 77 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 11 NumberOfFragments, 100 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 10 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 27 ConstructedInterpolants, 4 QuantifiedInterpolants, 168 SizeOfPredicates, 16 NumberOfNonLiveVariables, 118 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 24]: Loop Invariant [2022-02-20 16:42:53,107 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,107 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 15]: Loop Invariant [2022-02-20 16:42:53,108 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,108 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,108 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,108 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,108 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,109 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,109 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,109 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,109 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,109 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,109 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,110 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((\result == ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && 1bv32 == \result) && ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x - InvariantResult [Line: 19]: Loop Invariant [2022-02-20 16:42:53,111 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,111 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,111 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,116 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,116 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,116 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,116 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,117 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:53,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (\result == ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())), ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE()) == x - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-02-20 16:42:53,158 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 Writing output log to file Ultimate.log Result: TRUE