./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-benchs/sqrt_Newton_pseudoconstant.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 a9874b894e580352626d8ebc271850c0b42d4635 .................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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-benchs/sqrt_Newton_pseudoconstant.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 a9874b894e580352626d8ebc271850c0b42d4635 .................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-10-24 22:43:26,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 22:43:26,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 22:43:26,661 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 22:43:26,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 22:43:26,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 22:43:26,671 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 22:43:26,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 22:43:26,681 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 22:43:26,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 22:43:26,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 22:43:26,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 22:43:26,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 22:43:26,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 22:43:26,700 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 22:43:26,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 22:43:26,703 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 22:43:26,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 22:43:26,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 22:43:26,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 22:43:26,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 22:43:26,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 22:43:26,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 22:43:26,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 22:43:26,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 22:43:26,733 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 22:43:26,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 22:43:26,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 22:43:26,736 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 22:43:26,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 22:43:26,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 22:43:26,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 22:43:26,740 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 22:43:26,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 22:43:26,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 22:43:26,743 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 22:43:26,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 22:43:26,744 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 22:43:26,744 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 22:43:26,746 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 22:43:26,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 22:43:26,748 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-24 22:43:26,811 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 22:43:26,812 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 22:43:26,815 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 22:43:26,815 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 22:43:26,815 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 22:43:26,816 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 22:43:26,816 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 22:43:26,816 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 22:43:26,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 22:43:26,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 22:43:26,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 22:43:26,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 22:43:26,819 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 22:43:26,819 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 22:43:26,819 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 22:43:26,820 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 22:43:26,820 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 22:43:26,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 22:43:26,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 22:43:26,821 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 22:43:26,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 22:43:26,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 22:43:26,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 22:43:26,823 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 22:43:26,823 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 22:43:26,823 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-24 22:43:26,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-24 22:43:26,824 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 22:43:26,824 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 22:43:26,824 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 -> a9874b894e580352626d8ebc271850c0b42d4635 [2020-10-24 22:43:27,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 22:43:27,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 22:43:27,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 22:43:27,313 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 22:43:27,315 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 22:43:27,316 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c [2020-10-24 22:43:27,400 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6606e8ae5/0b1cd271cf81487d90e8f27138a93863/FLAGdeff7f20a [2020-10-24 22:43:27,991 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 22:43:27,992 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c [2020-10-24 22:43:28,001 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6606e8ae5/0b1cd271cf81487d90e8f27138a93863/FLAGdeff7f20a [2020-10-24 22:43:28,327 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6606e8ae5/0b1cd271cf81487d90e8f27138a93863 [2020-10-24 22:43:28,331 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 22:43:28,345 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 22:43:28,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 22:43:28,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 22:43:28,353 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 22:43:28,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:43:28" (1/1) ... [2020-10-24 22:43:28,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d4deda7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:28, skipping insertion in model container [2020-10-24 22:43:28,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:43:28" (1/1) ... [2020-10-24 22:43:28,393 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 22:43:28,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 22:43:28,636 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:43:28,654 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 22:43:28,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:43:28,695 INFO L208 MainTranslator]: Completed translation [2020-10-24 22:43:28,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:28 WrapperNode [2020-10-24 22:43:28,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 22:43:28,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 22:43:28,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 22:43:28,698 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 22:43:28,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:28" (1/1) ... [2020-10-24 22:43:28,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:28" (1/1) ... [2020-10-24 22:43:28,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 22:43:28,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 22:43:28,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 22:43:28,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 22:43:28,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:28" (1/1) ... [2020-10-24 22:43:28,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:28" (1/1) ... [2020-10-24 22:43:28,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:28" (1/1) ... [2020-10-24 22:43:28,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:28" (1/1) ... [2020-10-24 22:43:28,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:28" (1/1) ... [2020-10-24 22:43:28,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:28" (1/1) ... [2020-10-24 22:43:28,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:28" (1/1) ... [2020-10-24 22:43:28,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 22:43:28,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 22:43:28,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 22:43:28,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 22:43:28,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 22:43:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 22:43:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 22:43:28,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 22:43:28,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 22:43:29,293 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 22:43:29,294 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-24 22:43:29,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:43:29 BoogieIcfgContainer [2020-10-24 22:43:29,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 22:43:29,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 22:43:29,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 22:43:29,305 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 22:43:29,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:43:28" (1/3) ... [2020-10-24 22:43:29,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133723e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:43:29, skipping insertion in model container [2020-10-24 22:43:29,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:28" (2/3) ... [2020-10-24 22:43:29,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133723e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:43:29, skipping insertion in model container [2020-10-24 22:43:29,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:43:29" (3/3) ... [2020-10-24 22:43:29,310 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Newton_pseudoconstant.c [2020-10-24 22:43:29,325 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 22:43:29,332 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 22:43:29,348 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 22:43:29,399 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 22:43:29,400 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 22:43:29,400 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 22:43:29,400 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 22:43:29,400 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 22:43:29,401 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 22:43:29,401 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 22:43:29,401 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 22:43:29,420 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-10-24 22:43:29,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-24 22:43:29,427 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:43:29,428 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 22:43:29,429 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:43:29,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:43:29,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1569195288, now seen corresponding path program 1 times [2020-10-24 22:43:29,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 22:43:29,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939482582] [2020-10-24 22:43:29,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 22:43:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 22:43:29,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 22:43:29,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939482582] [2020-10-24 22:43:29,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 22:43:29,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-24 22:43:29,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36033635] [2020-10-24 22:43:29,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-24 22:43:29,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 22:43:29,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-24 22:43:29,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 22:43:29,628 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-10-24 22:43:29,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 22:43:29,648 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2020-10-24 22:43:29,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-24 22:43:29,649 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-10-24 22:43:29,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 22:43:29,659 INFO L225 Difference]: With dead ends: 35 [2020-10-24 22:43:29,659 INFO L226 Difference]: Without dead ends: 14 [2020-10-24 22:43:29,663 INFO L677 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 [2020-10-24 22:43:29,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-10-24 22:43:29,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-10-24 22:43:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-24 22:43:29,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2020-10-24 22:43:29,705 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2020-10-24 22:43:29,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 22:43:29,706 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-10-24 22:43:29,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-24 22:43:29,706 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2020-10-24 22:43:29,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-24 22:43:29,707 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:43:29,707 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 22:43:29,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 22:43:29,708 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:43:29,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:43:29,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2049407722, now seen corresponding path program 1 times [2020-10-24 22:43:29,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 22:43:29,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19262589] [2020-10-24 22:43:29,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 22:43:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 22:43:29,749 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 22:43:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 22:43:29,775 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 22:43:29,802 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-24 22:43:29,802 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 22:43:29,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 22:43:29,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:43:29 BoogieIcfgContainer [2020-10-24 22:43:29,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 22:43:29,839 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 22:43:29,840 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 22:43:29,840 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 22:43:29,841 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:43:29" (3/4) ... [2020-10-24 22:43:29,844 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-24 22:43:29,845 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 22:43:29,848 INFO L168 Benchmark]: Toolchain (without parser) took 1511.84 ms. Allocated memory was 39.8 MB in the beginning and 52.4 MB in the end (delta: 12.6 MB). Free memory was 17.1 MB in the beginning and 29.8 MB in the end (delta: -12.7 MB). Peak memory consumption was 1.3 MB. Max. memory is 16.1 GB. [2020-10-24 22:43:29,849 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 39.8 MB. Free memory was 24.4 MB in the beginning and 24.4 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:43:29,850 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.70 ms. Allocated memory is still 39.8 MB. Free memory was 16.4 MB in the beginning and 15.5 MB in the end (delta: 919.6 kB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2020-10-24 22:43:29,851 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.47 ms. Allocated memory was 39.8 MB in the beginning and 52.4 MB in the end (delta: 12.6 MB). Free memory was 15.5 MB in the beginning and 36.3 MB in the end (delta: -20.8 MB). Peak memory consumption was 4.7 MB. Max. memory is 16.1 GB. [2020-10-24 22:43:29,852 INFO L168 Benchmark]: Boogie Preprocessor took 31.23 ms. Allocated memory is still 52.4 MB. Free memory was 36.3 MB in the beginning and 35.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 22:43:29,853 INFO L168 Benchmark]: RCFGBuilder took 514.63 ms. Allocated memory is still 52.4 MB. Free memory was 35.2 MB in the beginning and 35.7 MB in the end (delta: -481.8 kB). Peak memory consumption was 13.6 MB. Max. memory is 16.1 GB. [2020-10-24 22:43:29,854 INFO L168 Benchmark]: TraceAbstraction took 539.18 ms. Allocated memory is still 52.4 MB. Free memory was 35.1 MB in the beginning and 30.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. [2020-10-24 22:43:29,855 INFO L168 Benchmark]: Witness Printer took 5.44 ms. Allocated memory is still 52.4 MB. Free memory was 30.1 MB in the beginning and 29.8 MB in the end (delta: 260.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:43:29,860 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 39.8 MB. Free memory was 24.4 MB in the beginning and 24.4 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 347.70 ms. Allocated memory is still 39.8 MB. Free memory was 16.4 MB in the beginning and 15.5 MB in the end (delta: 919.6 kB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 51.47 ms. Allocated memory was 39.8 MB in the beginning and 52.4 MB in the end (delta: 12.6 MB). Free memory was 15.5 MB in the beginning and 36.3 MB in the end (delta: -20.8 MB). Peak memory consumption was 4.7 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.23 ms. Allocated memory is still 52.4 MB. Free memory was 36.3 MB in the beginning and 35.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 514.63 ms. Allocated memory is still 52.4 MB. Free memory was 35.2 MB in the beginning and 35.7 MB in the end (delta: -481.8 kB). Peak memory consumption was 13.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 539.18 ms. Allocated memory is still 52.4 MB. Free memory was 35.1 MB in the beginning and 30.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. * Witness Printer took 5.44 ms. Allocated memory is still 52.4 MB. Free memory was 30.1 MB in the beginning and 29.8 MB in the end (delta: 260.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 52, overapproximation of someUnaryDOUBLEoperation at line 25, overapproximation of someBinaryArithmeticDOUBLEoperation at line 37. Possible FailurePath: [L15] double _EPS = 1e-6; VAL [_EPS=1/1000000] [L42] double d, dd, r; [L43] double epsilon = 1e-8; [L45] d = 1. VAL [_EPS=1/1000000] [L45] COND TRUE d <= 20. [L47] dd = __VERIFIER_nondet_double() [L11] COND FALSE !(!cond) VAL [_EPS=1/1000000] [L19] double xn, xnp1, residu, lsup, linf; [L20] int i, cond; VAL [_EPS=1/1000000] [L21] COND TRUE Input <= 1.0 [L21] xn = 1.0 VAL [_EPS=1/1000000] [L22] xnp1 = xn [L23] residu = 2.0*_EPS*(xn+xnp1) [L24] lsup = _EPS * (xn+xnp1) [L25] linf = -lsup [L26] cond = ((residu > lsup) || (residu < linf)) [L27] i = 0 VAL [_EPS=1/1000000] [L28] COND FALSE !(\read(cond)) VAL [_EPS=1/1000000] [L37] return 1.0 / xnp1; VAL [_EPS=1/1000000] [L50] r = SqrtR(dd) [L13] COND TRUE !(cond) VAL [_EPS=1/1000000] [L3] __assert_fail("0", "sqrt_Newton_pseudoconstant.c", 3, "reach_error") VAL [_EPS=1/1000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 20 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-10-24 22:43:32,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 22:43:32,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 22:43:32,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 22:43:32,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 22:43:32,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 22:43:32,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 22:43:32,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 22:43:32,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 22:43:32,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 22:43:32,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 22:43:32,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 22:43:32,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 22:43:32,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 22:43:32,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 22:43:32,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 22:43:32,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 22:43:32,506 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 22:43:32,508 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 22:43:32,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 22:43:32,512 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 22:43:32,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 22:43:32,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 22:43:32,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 22:43:32,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 22:43:32,520 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 22:43:32,520 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 22:43:32,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 22:43:32,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 22:43:32,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 22:43:32,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 22:43:32,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 22:43:32,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 22:43:32,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 22:43:32,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 22:43:32,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 22:43:32,529 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 22:43:32,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 22:43:32,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 22:43:32,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 22:43:32,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 22:43:32,533 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-24 22:43:32,561 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 22:43:32,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 22:43:32,565 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 22:43:32,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 22:43:32,566 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 22:43:32,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 22:43:32,567 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 22:43:32,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 22:43:32,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 22:43:32,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 22:43:32,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 22:43:32,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 22:43:32,570 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-24 22:43:32,570 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-24 22:43:32,570 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 22:43:32,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 22:43:32,571 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 22:43:32,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 22:43:32,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 22:43:32,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 22:43:32,572 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 22:43:32,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 22:43:32,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 22:43:32,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 22:43:32,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 22:43:32,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 22:43:32,573 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-24 22:43:32,574 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-24 22:43:32,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 22:43:32,574 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 22:43:32,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-24 22:43:32,574 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 -> a9874b894e580352626d8ebc271850c0b42d4635 [2020-10-24 22:43:33,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 22:43:33,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 22:43:33,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 22:43:33,171 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 22:43:33,172 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 22:43:33,173 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c [2020-10-24 22:43:33,275 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3301b92/19fdd897112b4d25af4dfd42c387cd83/FLAG12ed656e8 [2020-10-24 22:43:34,012 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 22:43:34,013 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c [2020-10-24 22:43:34,025 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3301b92/19fdd897112b4d25af4dfd42c387cd83/FLAG12ed656e8 [2020-10-24 22:43:34,370 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3301b92/19fdd897112b4d25af4dfd42c387cd83 [2020-10-24 22:43:34,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 22:43:34,385 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 22:43:34,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 22:43:34,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 22:43:34,392 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 22:43:34,393 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:43:34" (1/1) ... [2020-10-24 22:43:34,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@496797a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:34, skipping insertion in model container [2020-10-24 22:43:34,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:43:34" (1/1) ... [2020-10-24 22:43:34,407 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 22:43:34,425 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 22:43:34,636 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:43:34,654 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 22:43:34,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 22:43:34,701 INFO L208 MainTranslator]: Completed translation [2020-10-24 22:43:34,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:34 WrapperNode [2020-10-24 22:43:34,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 22:43:34,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 22:43:34,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 22:43:34,705 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 22:43:34,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:34" (1/1) ... [2020-10-24 22:43:34,730 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:34" (1/1) ... [2020-10-24 22:43:34,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 22:43:34,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 22:43:34,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 22:43:34,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 22:43:34,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:34" (1/1) ... [2020-10-24 22:43:34,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:34" (1/1) ... [2020-10-24 22:43:34,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:34" (1/1) ... [2020-10-24 22:43:34,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:34" (1/1) ... [2020-10-24 22:43:34,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:34" (1/1) ... [2020-10-24 22:43:34,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:34" (1/1) ... [2020-10-24 22:43:34,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:34" (1/1) ... [2020-10-24 22:43:34,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 22:43:34,796 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 22:43:34,796 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 22:43:34,796 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 22:43:34,797 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 22:43:34,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-24 22:43:34,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 22:43:34,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 22:43:34,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 22:43:44,277 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 22:43:44,278 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-24 22:43:44,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:43:44 BoogieIcfgContainer [2020-10-24 22:43:44,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 22:43:44,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 22:43:44,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 22:43:44,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 22:43:44,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:43:34" (1/3) ... [2020-10-24 22:43:44,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0114ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:43:44, skipping insertion in model container [2020-10-24 22:43:44,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:43:34" (2/3) ... [2020-10-24 22:43:44,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0114ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:43:44, skipping insertion in model container [2020-10-24 22:43:44,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:43:44" (3/3) ... [2020-10-24 22:43:44,291 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Newton_pseudoconstant.c [2020-10-24 22:43:44,303 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 22:43:44,307 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 22:43:44,319 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 22:43:44,350 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 22:43:44,350 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 22:43:44,350 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 22:43:44,351 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 22:43:44,351 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 22:43:44,351 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 22:43:44,351 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 22:43:44,351 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 22:43:44,366 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-10-24 22:43:44,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-24 22:43:44,372 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:43:44,373 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 22:43:44,373 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:43:44,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:43:44,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1569195288, now seen corresponding path program 1 times [2020-10-24 22:43:44,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:43:44,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297024580] [2020-10-24 22:43:44,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-24 22:43:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 22:43:46,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-24 22:43:46,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:43:46,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 22:43:46,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:43:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 22:43:46,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297024580] [2020-10-24 22:43:46,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 22:43:46,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-24 22:43:46,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320489427] [2020-10-24 22:43:46,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-24 22:43:46,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 22:43:46,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-24 22:43:46,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 22:43:46,161 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-10-24 22:43:46,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 22:43:46,179 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2020-10-24 22:43:46,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-24 22:43:46,181 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-10-24 22:43:46,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 22:43:46,191 INFO L225 Difference]: With dead ends: 35 [2020-10-24 22:43:46,192 INFO L226 Difference]: Without dead ends: 14 [2020-10-24 22:43:46,195 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 22:43:46,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-10-24 22:43:46,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-10-24 22:43:46,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-24 22:43:46,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2020-10-24 22:43:46,232 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2020-10-24 22:43:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 22:43:46,232 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-10-24 22:43:46,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-24 22:43:46,233 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2020-10-24 22:43:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-24 22:43:46,234 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:43:46,234 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 22:43:46,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-24 22:43:46,436 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:43:46,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:43:46,438 INFO L82 PathProgramCache]: Analyzing trace with hash -2049407722, now seen corresponding path program 1 times [2020-10-24 22:43:46,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:43:46,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156778888] [2020-10-24 22:43:46,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-24 22:43:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 22:43:48,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-24 22:43:48,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:43:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 22:43:48,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:43:50,410 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_SqrtR_~linf~0_5 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_5)) (let ((.cse0 (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0)))) is different from false [2020-10-24 22:43:52,541 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_SqrtR_~linf~0_5 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_5)) (let ((.cse0 (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0)))) is different from true [2020-10-24 22:44:00,085 WARN L193 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2020-10-24 22:44:00,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 22:44:00,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156778888] [2020-10-24 22:44:00,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 22:44:00,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-10-24 22:44:00,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674943972] [2020-10-24 22:44:00,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 22:44:00,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 22:44:00,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 22:44:00,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=27, Unknown=2, NotChecked=10, Total=56 [2020-10-24 22:44:00,093 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2020-10-24 22:44:02,632 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_SqrtR_~xn~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (or (forall ((v_ULTIMATE.start_SqrtR_~linf~0_5 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_5)) (let ((.cse0 (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_~_EPS~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)))) is different from true [2020-10-24 22:44:27,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 22:44:27,574 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-10-24 22:44:27,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 22:44:27,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-10-24 22:44:27,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 22:44:27,577 INFO L225 Difference]: With dead ends: 32 [2020-10-24 22:44:27,577 INFO L226 Difference]: Without dead ends: 20 [2020-10-24 22:44:27,579 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=19, Invalid=28, Unknown=3, NotChecked=22, Total=72 [2020-10-24 22:44:27,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-10-24 22:44:27,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-24 22:44:27,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-24 22:44:27,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-10-24 22:44:27,589 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2020-10-24 22:44:27,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 22:44:27,590 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-10-24 22:44:27,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 22:44:27,591 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-10-24 22:44:27,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-24 22:44:27,592 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 22:44:27,593 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 22:44:27,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-24 22:44:27,810 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 22:44:27,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 22:44:27,812 INFO L82 PathProgramCache]: Analyzing trace with hash -274400360, now seen corresponding path program 1 times [2020-10-24 22:44:27,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 22:44:27,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909546443] [2020-10-24 22:44:27,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-24 22:44:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 22:44:31,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 21 conjunts are in the unsatisfiable core [2020-10-24 22:44:31,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:44:32,575 WARN L193 SmtUtils]: Spent 549.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-10-24 22:44:32,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 22:44:33,491 WARN L193 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-10-24 22:44:33,996 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-10-24 22:44:36,480 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_ULTIMATE.start_SqrtR_~xn~0 (fp.div c_currentRoundingMode .cse0 ULTIMATE.start_SqrtR_~Input)) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add c_currentRoundingMode .cse0 .cse1)) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub c_currentRoundingMode .cse0 .cse1)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_~_EPS~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)))) is different from false [2020-10-24 22:44:36,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-24 22:44:36,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-24 22:44:39,776 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_currentRoundingMode roundNearestTiesToEven)) (.cse6 (= (_ bv1 32) c_ULTIMATE.start_SqrtR_~cond~0))) (or (and .cse0 (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0))) (.cse5 (fp.div c_currentRoundingMode .cse1 ULTIMATE.start_SqrtR_~Input))) (and (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add c_currentRoundingMode .cse1 .cse2)) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse4 (fp.add c_currentRoundingMode .cse5 c_ULTIMATE.start_SqrtR_~xnp1~0))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse3) .cse4) (fp.mul c_currentRoundingMode .cse3 .cse4))) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub c_currentRoundingMode .cse1 .cse2)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse1)) (= c_ULTIMATE.start_SqrtR_~xnp1~0 .cse5))))) .cse6) (and .cse0 (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse12 (fp.div c_currentRoundingMode .cse10 ULTIMATE.start_SqrtR_~Input))) (let ((.cse8 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse9 (fp.add c_currentRoundingMode .cse12 c_ULTIMATE.start_SqrtR_~xnp1~0))) (let ((.cse7 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse8) .cse9)) (.cse11 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (and (not (fp.gt .cse7 (fp.mul c_currentRoundingMode .cse8 .cse9))) (not (fp.lt .cse7 ULTIMATE.start_SqrtR_~linf~0)) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add c_currentRoundingMode .cse10 .cse11)) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub c_currentRoundingMode .cse10 .cse11)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse10)) (= c_ULTIMATE.start_SqrtR_~xnp1~0 .cse12))))))) (= (_ bv0 32) c_ULTIMATE.start_SqrtR_~cond~0)) (and .cse0 (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse14 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse15 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0))) (.cse13 (fp.div c_currentRoundingMode .cse14 ULTIMATE.start_SqrtR_~Input))) (and (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (fp.add c_currentRoundingMode .cse13 c_ULTIMATE.start_SqrtR_~xnp1~0)) ULTIMATE.start_SqrtR_~linf~0) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add c_currentRoundingMode .cse14 .cse15)) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub c_currentRoundingMode .cse14 .cse15)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse14)) (= c_ULTIMATE.start_SqrtR_~xnp1~0 .cse13))))) .cse6))) is different from false [2020-10-24 22:44:42,317 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.div c_currentRoundingMode .cse3 ULTIMATE.start_SqrtR_~Input))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse2 (fp.add c_currentRoundingMode .cse5 c_ULTIMATE.start_SqrtR_~xnp1~0))) (let ((.cse0 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse1) .cse2)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (and (not (fp.gt .cse0 (fp.mul c_currentRoundingMode .cse1 .cse2))) (not (fp.lt .cse0 ULTIMATE.start_SqrtR_~linf~0)) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add c_currentRoundingMode .cse3 .cse4)) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse3)) (= c_ULTIMATE.start_SqrtR_~xnp1~0 .cse5)))))))) is different from false [2020-10-24 22:44:45,282 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse0 ULTIMATE.start_SqrtR_~Input))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse5 (fp.add c_currentRoundingMode .cse1 .cse1))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0))) (.cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse4) .cse5))) (and (= |c_ULTIMATE.start_SqrtR_#res| (fp.div c_currentRoundingMode .cse0 .cse1)) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add c_currentRoundingMode .cse0 .cse2)) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub c_currentRoundingMode .cse0 .cse2)) (not (fp.lt .cse3 ULTIMATE.start_SqrtR_~linf~0)) (not (fp.gt .cse3 (fp.mul c_currentRoundingMode .cse4 .cse5))) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse0))))))))) is different from false [2020-10-24 22:44:45,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-24 22:44:51,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-24 22:45:11,936 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (or (and (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse5 (fp.div roundNearestTiesToEven .cse0 ULTIMATE.start_SqrtR_~Input))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse4 (fp.add roundNearestTiesToEven .cse5 .cse5))) (let ((.cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse3) .cse4)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (and (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse0 .cse1)) (not (fp.lt .cse2 ULTIMATE.start_SqrtR_~linf~0)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse0)) (not (fp.gt .cse2 (fp.mul roundNearestTiesToEven .cse3 .cse4))) (not (fp.leq (fp.div roundNearestTiesToEven .cse0 .cse5) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse0 .cse1)))))))) .cse6) (and (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse10 (fp.div roundNearestTiesToEven .cse7 ULTIMATE.start_SqrtR_~Input))) (let ((.cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse12 (fp.add roundNearestTiesToEven .cse10 .cse10))) (let ((.cse9 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse11) .cse12)) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (and (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse7 .cse8)) (not (fp.lt .cse9 ULTIMATE.start_SqrtR_~linf~0)) (not (fp.geq (fp.div roundNearestTiesToEven .cse7 .cse10) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse7)) (not (fp.gt .cse9 (fp.mul roundNearestTiesToEven .cse11 .cse12))) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse7 .cse8)))))))) .cse6) (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse13 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse19 (fp.div roundNearestTiesToEven .cse13 ULTIMATE.start_SqrtR_~Input))) (let ((.cse17 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse18 (fp.add roundNearestTiesToEven .cse19 .cse19))) (let ((.cse16 (fp.div roundNearestTiesToEven .cse13 .cse19)) (.cse15 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse17) .cse18)) (.cse14 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (and (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse13 .cse14)) (not (fp.lt .cse15 ULTIMATE.start_SqrtR_~linf~0)) (fp.geq .cse16 ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0))) (fp.leq .cse16 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse13)) (not (fp.gt .cse15 (fp.mul roundNearestTiesToEven .cse17 .cse18))) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse13 .cse14))))))))))) is different from false [2020-10-24 22:45:28,167 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse5 (fp.div roundNearestTiesToEven .cse0 ULTIMATE.start_SqrtR_~Input))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse4 (fp.add roundNearestTiesToEven .cse5 .cse5))) (let ((.cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse3) .cse4)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (and (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse0 .cse1)) (not (fp.lt .cse2 ULTIMATE.start_SqrtR_~linf~0)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse0)) (not (fp.gt .cse2 (fp.mul roundNearestTiesToEven .cse3 .cse4))) (not (fp.leq (fp.div roundNearestTiesToEven .cse0 .cse5) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse0 .cse1)))))))) (exists ((v_prenex_1 (_ FloatingPoint 11 53)) (v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse10 (fp.div roundNearestTiesToEven .cse9 v_prenex_1))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse8 (fp.add roundNearestTiesToEven .cse10 .cse10))) (let ((.cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (.cse6 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse7) .cse8))) (and (not (fp.gt .cse6 (fp.mul roundNearestTiesToEven .cse7 .cse8))) (not (fp.leq v_prenex_1 .cse9)) (not (fp.geq (fp.div roundNearestTiesToEven .cse9 .cse10) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (fp.geq v_prenex_1 (fp.sub roundNearestTiesToEven .cse9 .cse11)) (fp.leq v_prenex_1 (fp.add roundNearestTiesToEven .cse9 .cse11)) (not (fp.lt .cse6 v_prenex_2))))))))) is different from false [2020-10-24 22:45:30,935 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse5 (fp.div roundNearestTiesToEven .cse0 ULTIMATE.start_SqrtR_~Input))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse4 (fp.add roundNearestTiesToEven .cse5 .cse5))) (let ((.cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse3) .cse4)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (and (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse0 .cse1)) (not (fp.lt .cse2 ULTIMATE.start_SqrtR_~linf~0)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse0)) (not (fp.gt .cse2 (fp.mul roundNearestTiesToEven .cse3 .cse4))) (not (fp.leq (fp.div roundNearestTiesToEven .cse0 .cse5) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse0 .cse1)))))))) (exists ((v_prenex_1 (_ FloatingPoint 11 53)) (v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse10 (fp.div roundNearestTiesToEven .cse9 v_prenex_1))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse8 (fp.add roundNearestTiesToEven .cse10 .cse10))) (let ((.cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (.cse6 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse7) .cse8))) (and (not (fp.gt .cse6 (fp.mul roundNearestTiesToEven .cse7 .cse8))) (not (fp.leq v_prenex_1 .cse9)) (not (fp.geq (fp.div roundNearestTiesToEven .cse9 .cse10) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (fp.geq v_prenex_1 (fp.sub roundNearestTiesToEven .cse9 .cse11)) (fp.leq v_prenex_1 (fp.add roundNearestTiesToEven .cse9 .cse11)) (not (fp.lt .cse6 v_prenex_2))))))))) is different from true [2020-10-24 22:45:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 22:45:30,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 22:45:33,723 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))))) is different from false [2020-10-24 22:45:37,936 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))))) (not (= (_ bv0 32) c_ULTIMATE.start_SqrtR_~cond~0))) is different from false [2020-10-24 22:45:40,391 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))))) (not (= (_ bv0 32) c_ULTIMATE.start_SqrtR_~cond~0))) is different from true [2020-10-24 22:45:42,981 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_7))) (.cse1 (let ((.cse3 (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse3) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse3)))) (.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_SqrtR_~xn~0))) (and (or .cse0 .cse1 (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 5.0))) (or .cse0 .cse1 (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0)))))) is different from false [2020-10-24 22:45:45,627 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_7))) (.cse1 (let ((.cse3 (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse3) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse3)))) (.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_SqrtR_~xn~0))) (and (or .cse0 .cse1 (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 5.0))) (or .cse0 .cse1 (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0)))))) is different from true [2020-10-24 22:45:48,665 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse7 (fp.div c_currentRoundingMode .cse5 c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse3 (fp.div c_currentRoundingMode .cse5 .cse7)) (.cse0 (let ((.cse6 (fp.add c_currentRoundingMode .cse7 .cse7))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse6) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse6)))) (.cse2 (fp.leq c_ULTIMATE.start_SqrtR_~Input .cse5))) (and (or .cse0 (forall ((v_prenex_3 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse1 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_SqrtR_~Input))) (fp.add c_currentRoundingMode .cse1 .cse1))) v_prenex_3)) .cse2 (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 5.0))) (or (fp.geq .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse4 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_SqrtR_~Input))) (fp.add c_currentRoundingMode .cse4 .cse4))) v_ULTIMATE.start_SqrtR_~linf~0_7)) .cse0 .cse2))))) is different from false [2020-10-24 22:45:51,860 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse7 (fp.div c_currentRoundingMode .cse5 c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse3 (fp.div c_currentRoundingMode .cse5 .cse7)) (.cse0 (let ((.cse6 (fp.add c_currentRoundingMode .cse7 .cse7))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse6) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse6)))) (.cse2 (fp.leq c_ULTIMATE.start_SqrtR_~Input .cse5))) (and (or .cse0 (forall ((v_prenex_3 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse1 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_SqrtR_~Input))) (fp.add c_currentRoundingMode .cse1 .cse1))) v_prenex_3)) .cse2 (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 5.0))) (or (fp.geq .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse4 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_SqrtR_~Input))) (fp.add c_currentRoundingMode .cse4 .cse4))) v_ULTIMATE.start_SqrtR_~linf~0_7)) .cse0 .cse2))))) is different from true [2020-10-24 22:45:55,167 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse6 (fp.div c_currentRoundingMode .cse7 c_ULTIMATE.start_main_~dd~0))) (let ((.cse0 (fp.leq c_ULTIMATE.start_main_~dd~0 .cse7)) (.cse2 (fp.div c_currentRoundingMode .cse7 .cse6)) (.cse3 (let ((.cse5 (fp.add c_currentRoundingMode .cse6 .cse6))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse5) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse5))))) (and (or .cse0 (forall ((v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse1 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_main_~dd~0))) (fp.add c_currentRoundingMode .cse1 .cse1))) v_ULTIMATE.start_SqrtR_~linf~0_7)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) .cse3) (or .cse0 (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (forall ((v_prenex_3 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse4 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_main_~dd~0))) (fp.add c_currentRoundingMode .cse4 .cse4))) v_prenex_3)) .cse3))))) is different from false [2020-10-24 22:45:58,588 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse6 (fp.div c_currentRoundingMode .cse7 c_ULTIMATE.start_main_~dd~0))) (let ((.cse0 (fp.leq c_ULTIMATE.start_main_~dd~0 .cse7)) (.cse2 (fp.div c_currentRoundingMode .cse7 .cse6)) (.cse3 (let ((.cse5 (fp.add c_currentRoundingMode .cse6 .cse6))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse5) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse5))))) (and (or .cse0 (forall ((v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse1 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_main_~dd~0))) (fp.add c_currentRoundingMode .cse1 .cse1))) v_ULTIMATE.start_SqrtR_~linf~0_7)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) .cse3) (or .cse0 (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (forall ((v_prenex_3 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse4 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_main_~dd~0))) (fp.add c_currentRoundingMode .cse4 .cse4))) v_prenex_3)) .cse3))))) is different from true [2020-10-24 22:46:01,972 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse7 (fp.div c_currentRoundingMode .cse8 c_ULTIMATE.start_main_~dd~0))) (let ((.cse0 (fp.leq c_ULTIMATE.start_main_~dd~0 .cse8)) (.cse1 (fp.div c_currentRoundingMode .cse8 .cse7)) (.cse3 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse4 (let ((.cse6 (fp.add c_currentRoundingMode .cse7 .cse7))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse6) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse6))))) (and (or .cse0 (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (forall ((v_prenex_3 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_main_~dd~0))) (fp.add c_currentRoundingMode .cse2 .cse2))) v_prenex_3)) .cse3 .cse4) (or .cse0 (forall ((v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse5 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_main_~dd~0))) (fp.add c_currentRoundingMode .cse5 .cse5))) v_ULTIMATE.start_SqrtR_~linf~0_7)) (fp.geq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) .cse3 .cse4))))) is different from false [2020-10-24 22:46:05,336 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse7 (fp.div c_currentRoundingMode .cse8 c_ULTIMATE.start_main_~dd~0))) (let ((.cse0 (fp.leq c_ULTIMATE.start_main_~dd~0 .cse8)) (.cse1 (fp.div c_currentRoundingMode .cse8 .cse7)) (.cse3 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse4 (let ((.cse6 (fp.add c_currentRoundingMode .cse7 .cse7))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse6) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse6))))) (and (or .cse0 (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (forall ((v_prenex_3 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_main_~dd~0))) (fp.add c_currentRoundingMode .cse2 .cse2))) v_prenex_3)) .cse3 .cse4) (or .cse0 (forall ((v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse5 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_main_~dd~0))) (fp.add c_currentRoundingMode .cse5 .cse5))) v_ULTIMATE.start_SqrtR_~linf~0_7)) (fp.geq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) .cse3 .cse4))))) is different from true [2020-10-24 22:46:05,343 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 5, 2, 1] term [2020-10-24 22:46:05,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 22:46:05,357 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-24 22:46:07,858 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~dd~0_8 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.div c_currentRoundingMode .cse0 v_ULTIMATE.start_main_~dd~0_8))) (let ((.cse2 (fp.add c_currentRoundingMode .cse3 .cse3))) (let ((.cse1 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse2))) (or (fp.leq v_ULTIMATE.start_main_~dd~0_8 .cse0) (not (fp.geq v_ULTIMATE.start_main_~dd~0_8 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~d~0 c_ULTIMATE.start_main_~epsilon~0))) (fp.lt .cse1 v_prenex_3) (not (fp.leq v_ULTIMATE.start_main_~dd~0_8 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~d~0 c_ULTIMATE.start_main_~epsilon~0))) (fp.gt .cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse2)) (fp.leq (fp.div c_currentRoundingMode .cse0 .cse3) ((_ to_fp 11 53) c_currentRoundingMode 5.0)))))))) (forall ((v_ULTIMATE.start_main_~dd~0_8 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse7 (fp.div c_currentRoundingMode .cse4 v_ULTIMATE.start_main_~dd~0_8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse7 .cse7))) (let ((.cse5 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse6))) (or (fp.leq v_ULTIMATE.start_main_~dd~0_8 .cse4) (not (fp.geq v_ULTIMATE.start_main_~dd~0_8 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~d~0 c_ULTIMATE.start_main_~epsilon~0))) (not (fp.leq v_ULTIMATE.start_main_~dd~0_8 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~d~0 c_ULTIMATE.start_main_~epsilon~0))) (fp.gt .cse5 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse6)) (fp.lt .cse5 v_ULTIMATE.start_SqrtR_~linf~0_7) (fp.geq (fp.div c_currentRoundingMode .cse4 .cse7) ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0)))))))))) is different from false [2020-10-24 22:46:11,347 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~dd~0_8 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.div c_currentRoundingMode .cse0 v_ULTIMATE.start_main_~dd~0_8))) (let ((.cse2 (fp.add c_currentRoundingMode .cse3 .cse3))) (let ((.cse1 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse2))) (or (fp.leq v_ULTIMATE.start_main_~dd~0_8 .cse0) (not (fp.geq v_ULTIMATE.start_main_~dd~0_8 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~d~0 c_ULTIMATE.start_main_~epsilon~0))) (fp.lt .cse1 v_prenex_3) (not (fp.leq v_ULTIMATE.start_main_~dd~0_8 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~d~0 c_ULTIMATE.start_main_~epsilon~0))) (fp.gt .cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse2)) (fp.leq (fp.div c_currentRoundingMode .cse0 .cse3) ((_ to_fp 11 53) c_currentRoundingMode 5.0)))))))) (forall ((v_ULTIMATE.start_main_~dd~0_8 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse7 (fp.div c_currentRoundingMode .cse4 v_ULTIMATE.start_main_~dd~0_8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse7 .cse7))) (let ((.cse5 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse6))) (or (fp.leq v_ULTIMATE.start_main_~dd~0_8 .cse4) (not (fp.geq v_ULTIMATE.start_main_~dd~0_8 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~d~0 c_ULTIMATE.start_main_~epsilon~0))) (not (fp.leq v_ULTIMATE.start_main_~dd~0_8 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~d~0 c_ULTIMATE.start_main_~epsilon~0))) (fp.gt .cse5 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse6)) (fp.lt .cse5 v_ULTIMATE.start_SqrtR_~linf~0_7) (fp.geq (fp.div c_currentRoundingMode .cse4 .cse7) ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0)))))))))) is different from true [2020-10-24 22:46:14,083 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~dd~0_8 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.div c_currentRoundingMode .cse0 v_ULTIMATE.start_main_~dd~0_8))) (let ((.cse3 (fp.add c_currentRoundingMode .cse4 .cse4))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0))) (.cse2 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse3))) (or (fp.leq v_ULTIMATE.start_main_~dd~0_8 .cse0) (not (fp.geq v_ULTIMATE.start_main_~dd~0_8 (fp.sub c_currentRoundingMode .cse0 .cse1))) (not (fp.leq v_ULTIMATE.start_main_~dd~0_8 (fp.add c_currentRoundingMode .cse0 .cse1))) (fp.gt .cse2 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse3)) (fp.lt .cse2 v_ULTIMATE.start_SqrtR_~linf~0_7) (fp.geq (fp.div c_currentRoundingMode .cse0 .cse4) ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))))))))) (forall ((v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse8 (fp.div c_currentRoundingMode .cse7 v_prenex_4))) (let ((.cse6 (fp.add c_currentRoundingMode .cse8 .cse8))) (let ((.cse5 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse6)) (.cse9 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (or (fp.lt .cse5 v_prenex_3) (fp.gt .cse5 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse6)) (fp.leq v_prenex_4 .cse7) (fp.leq (fp.div c_currentRoundingMode .cse7 .cse8) ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (not (fp.leq v_prenex_4 (fp.add c_currentRoundingMode .cse7 .cse9))) (not (fp.geq v_prenex_4 (fp.sub c_currentRoundingMode .cse7 .cse9)))))))))) is different from false [2020-10-24 22:46:15,810 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-10-24 22:46:15,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909546443] [2020-10-24 22:46:15,813 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") [2020-10-24 22:46:15,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2014637312] [2020-10-24 22:46:15,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-24 22:46:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 22:46:21,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-24 22:46:21,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:46:21,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 22:46:21,804 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken [2020-10-24 22:46:21,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664249529] [2020-10-24 22:46:21,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-24 22:48:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 22:48:24,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-24 22:48:24,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 22:48:24,555 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@5fe4cfbb [2020-10-24 22:48:24,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-10-24 22:48:24,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-10-24 22:48:24,555 ERROR L205 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2020-10-24 22:48:24,556 INFO L523 BasicCegarLoop]: Counterexample might be feasible [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forcibly destroying the process [2020-10-24 22:48:25,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3,5 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-24 22:48:25,197 WARN L238 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-10-24 22:48:25,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:48:25 BoogieIcfgContainer [2020-10-24 22:48:25,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 22:48:25,199 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 22:48:25,199 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 22:48:25,199 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 22:48:25,205 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:43:44" (3/4) ... [2020-10-24 22:48:25,213 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-24 22:48:25,214 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 22:48:25,217 INFO L168 Benchmark]: Toolchain (without parser) took 290835.08 ms. Allocated memory is still 56.6 MB. Free memory was 33.7 MB in the beginning and 21.3 MB in the end (delta: 12.5 MB). Peak memory consumption was 15.1 MB. Max. memory is 16.1 GB. [2020-10-24 22:48:25,220 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 41.9 MB. Free memory was 21.7 MB in the beginning and 21.6 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:48:25,221 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.28 ms. Allocated memory is still 56.6 MB. Free memory was 33.1 MB in the beginning and 35.6 MB in the end (delta: -2.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 16.1 GB. [2020-10-24 22:48:25,226 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.28 ms. Allocated memory is still 56.6 MB. Free memory was 35.6 MB in the beginning and 34.0 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:48:25,227 INFO L168 Benchmark]: Boogie Preprocessor took 37.22 ms. Allocated memory is still 56.6 MB. Free memory was 34.0 MB in the beginning and 32.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 22:48:25,228 INFO L168 Benchmark]: RCFGBuilder took 9484.58 ms. Allocated memory is still 56.6 MB. Free memory was 32.6 MB in the beginning and 33.4 MB in the end (delta: -849.6 kB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-10-24 22:48:25,229 INFO L168 Benchmark]: TraceAbstraction took 280916.12 ms. Allocated memory is still 56.6 MB. Free memory was 32.9 MB in the beginning and 21.6 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.9 MB. Max. memory is 16.1 GB. [2020-10-24 22:48:25,230 INFO L168 Benchmark]: Witness Printer took 14.82 ms. Allocated memory is still 56.6 MB. Free memory was 21.6 MB in the beginning and 21.3 MB in the end (delta: 356.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 22:48:25,235 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 41.9 MB. Free memory was 21.7 MB in the beginning and 21.6 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 316.28 ms. Allocated memory is still 56.6 MB. Free memory was 33.1 MB in the beginning and 35.6 MB in the end (delta: -2.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 52.28 ms. Allocated memory is still 56.6 MB. Free memory was 35.6 MB in the beginning and 34.0 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 37.22 ms. Allocated memory is still 56.6 MB. Free memory was 34.0 MB in the beginning and 32.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 9484.58 ms. Allocated memory is still 56.6 MB. Free memory was 32.6 MB in the beginning and 33.4 MB in the end (delta: -849.6 kB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 280916.12 ms. Allocated memory is still 56.6 MB. Free memory was 32.9 MB in the beginning and 21.6 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.9 MB. Max. memory is 16.1 GB. * Witness Printer took 14.82 ms. Allocated memory is still 56.6 MB. Free memory was 21.6 MB in the beginning and 21.3 MB in the end (delta: 356.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L15] double _EPS = 1e-6; [L42] double d, dd, r; [L43] double epsilon = 1e-8; [L45] d = 1. [L45] COND TRUE d <= 20. [L47] dd = __VERIFIER_nondet_double() [L11] COND FALSE !(!cond) [L19] double xn, xnp1, residu, lsup, linf; [L20] int i, cond; [L21] COND FALSE !(Input <= 1.0) [L21] xn = 1.0/Input [L22] xnp1 = xn [L23] residu = 2.0*_EPS*(xn+xnp1) [L24] lsup = _EPS * (xn+xnp1) [L25] linf = -lsup [L26] cond = ((residu > lsup) || (residu < linf)) [L27] i = 0 [L28] COND FALSE !(\read(cond)) [L37] return 1.0 / xnp1; [L50] r = SqrtR(dd) [L13] COND TRUE !(cond) [L3] __assert_fail("0", "sqrt_Newton_pseudoconstant.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 280.8s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 27.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 31 SDtfs, 2 SDslu, 23 SDs, 0 SdLazy, 21 SolverSat, 0 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 23.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=2, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 44 ConstructedInterpolants, 1 QuantifiedInterpolants, 2992 SizeOfPredicates, 8 NumberOfNonLiveVariables, 94 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 Received shutdown request...