./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/sqrt_Householder_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 e0a18ef05fc68655f6745bf4a502e0079c3ee8f2ad8ce0a20fedaec28a3ae221 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:25:33,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:25:33,789 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:25:33,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:25:33,811 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:25:33,813 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:25:33,815 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:25:33,820 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:25:33,822 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:25:33,826 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:25:33,827 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:25:33,828 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:25:33,828 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:25:33,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:25:33,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:25:33,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:25:33,833 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:25:33,834 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:25:33,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:25:33,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:25:33,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:25:33,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:25:33,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:25:33,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:25:33,846 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:25:33,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:25:33,847 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:25:33,847 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:25:33,847 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:25:33,848 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:25:33,848 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:25:33,849 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:25:33,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:25:33,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:25:33,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:25:33,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:25:33,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:25:33,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:25:33,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:25:33,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:25:33,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:25:33,853 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:25:33,867 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:25:33,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:25:33,867 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:25:33,868 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:25:33,868 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:25:33,868 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:25:33,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:25:33,869 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:25:33,869 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:25:33,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:25:33,870 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:25:33,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:25:33,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:25:33,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:25:33,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:25:33,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:25:33,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:25:33,871 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:25:33,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:25:33,871 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:25:33,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:25:33,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:25:33,872 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:25:33,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:25:33,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:25:33,872 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:25:33,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:25:33,873 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:25:33,873 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:25:33,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:25:33,873 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:25:33,873 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:25:33,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:25:33,874 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 -> e0a18ef05fc68655f6745bf4a502e0079c3ee8f2ad8ce0a20fedaec28a3ae221 [2022-02-20 16:25:34,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:25:34,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:25:34,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:25:34,047 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:25:34,048 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:25:34,049 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c [2022-02-20 16:25:34,096 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45782cada/5db236a2f366492592b75cafe651e18f/FLAG264c41e95 [2022-02-20 16:25:34,449 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:25:34,449 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c [2022-02-20 16:25:34,454 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45782cada/5db236a2f366492592b75cafe651e18f/FLAG264c41e95 [2022-02-20 16:25:34,464 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45782cada/5db236a2f366492592b75cafe651e18f [2022-02-20 16:25:34,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:25:34,467 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:25:34,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:25:34,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:25:34,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:25:34,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:25:34" (1/1) ... [2022-02-20 16:25:34,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@98e5e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:34, skipping insertion in model container [2022-02-20 16:25:34,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:25:34" (1/1) ... [2022-02-20 16:25:34,480 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:25:34,489 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:25:34,604 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c[855,868] [2022-02-20 16:25:34,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:25:34,626 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:25:34,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c[855,868] [2022-02-20 16:25:34,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:25:34,659 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:25:34,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:34 WrapperNode [2022-02-20 16:25:34,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:25:34,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:25:34,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:25:34,661 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:25:34,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:34" (1/1) ... [2022-02-20 16:25:34,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:34" (1/1) ... [2022-02-20 16:25:34,688 INFO L137 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 73 [2022-02-20 16:25:34,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:25:34,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:25:34,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:25:34,689 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:25:34,695 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:34" (1/1) ... [2022-02-20 16:25:34,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:34" (1/1) ... [2022-02-20 16:25:34,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:34" (1/1) ... [2022-02-20 16:25:34,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:34" (1/1) ... [2022-02-20 16:25:34,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:34" (1/1) ... [2022-02-20 16:25:34,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:34" (1/1) ... [2022-02-20 16:25:34,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:34" (1/1) ... [2022-02-20 16:25:34,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:25:34,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:25:34,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:25:34,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:25:34,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:34" (1/1) ... [2022-02-20 16:25:34,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:25:34,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:25:34,745 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:25:34,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:25:34,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:25:34,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:25:34,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:25:34,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:25:34,824 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:25:34,825 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:25:34,917 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:25:34,922 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:25:34,922 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 16:25:34,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:25:34 BoogieIcfgContainer [2022-02-20 16:25:34,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:25:34,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:25:34,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:25:34,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:25:34,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:25:34" (1/3) ... [2022-02-20 16:25:34,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a94244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:25:34, skipping insertion in model container [2022-02-20 16:25:34,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:34" (2/3) ... [2022-02-20 16:25:34,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8a94244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:25:34, skipping insertion in model container [2022-02-20 16:25:34,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:25:34" (3/3) ... [2022-02-20 16:25:34,940 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_pseudoconstant.c [2022-02-20 16:25:34,944 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:25:34,945 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:25:35,014 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:25:35,019 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:25:35,019 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:25:35,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:35,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:25:35,044 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:25:35,045 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:25:35,045 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:25:35,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:25:35,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1569195288, now seen corresponding path program 1 times [2022-02-20 16:25:35,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:25:35,063 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687955103] [2022-02-20 16:25:35,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:25:35,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:25:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:25:35,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(34, 2);call #Ultimate.allocInit(12, 3);~_EPS~0 := 1.0E-6; {22#true} is VALID [2022-02-20 16:25:35,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_#t~post5#1, main_~d~0#1, main_~dd~0#1, main_~r~0#1, main_~epsilon~0#1;havoc main_~d~0#1;havoc main_~dd~0#1;havoc main_~r~0#1;main_~epsilon~0#1 := 1.0E-8;main_~d~0#1 := 1.0; {22#true} is VALID [2022-02-20 16:25:35,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume !!~someBinaryDOUBLEComparisonOperation(main_~d~0#1, 20.0);main_~dd~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~dd~0#1, ~someBinaryArithmeticDOUBLEoperation(main_~d~0#1, main_~epsilon~0#1)) && ~someBinaryDOUBLEComparisonOperation(main_~dd~0#1, ~someBinaryArithmeticDOUBLEoperation(main_~d~0#1, main_~epsilon~0#1)) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {22#true} is VALID [2022-02-20 16:25:35,245 INFO L290 TraceCheckUtils]: 3: Hoare triple {22#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {23#false} is VALID [2022-02-20 16:25:35,245 INFO L290 TraceCheckUtils]: 4: Hoare triple {23#false} assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_SqrtR } true;SqrtR_#in~Input#1 := main_~dd~0#1;havoc SqrtR_#res#1;havoc SqrtR_#t~post4#1, SqrtR_~Input#1, SqrtR_~xn~0#1, SqrtR_~xnp1~0#1, SqrtR_~residu~0#1, SqrtR_~lsup~0#1, SqrtR_~linf~0#1, SqrtR_~i~0#1, SqrtR_~cond~0#1;SqrtR_~Input#1 := SqrtR_#in~Input#1;havoc SqrtR_~xn~0#1;havoc SqrtR_~xnp1~0#1;havoc SqrtR_~residu~0#1;havoc SqrtR_~lsup~0#1;havoc SqrtR_~linf~0#1;havoc SqrtR_~i~0#1;havoc SqrtR_~cond~0#1; {23#false} is VALID [2022-02-20 16:25:35,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#false} assume ~someBinaryDOUBLEComparisonOperation(SqrtR_~Input#1, 1.0);SqrtR_~xn~0#1 := 1.0; {23#false} is VALID [2022-02-20 16:25:35,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#false} SqrtR_~xnp1~0#1 := SqrtR_~xn~0#1;SqrtR_~residu~0#1 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(SqrtR_~xn~0#1, SqrtR_~xnp1~0#1));SqrtR_~lsup~0#1 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(SqrtR_~xn~0#1, SqrtR_~xnp1~0#1));SqrtR_~linf~0#1 := ~someUnaryDOUBLEoperation(SqrtR_~lsup~0#1);SqrtR_~cond~0#1 := (if ~someBinaryDOUBLEComparisonOperation(SqrtR_~residu~0#1, SqrtR_~lsup~0#1) || ~someBinaryDOUBLEComparisonOperation(SqrtR_~residu~0#1, SqrtR_~linf~0#1) then 1 else 0);SqrtR_~i~0#1 := 0; {23#false} is VALID [2022-02-20 16:25:35,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#false} assume !true; {23#false} is VALID [2022-02-20 16:25:35,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} SqrtR_#res#1 := ~someBinaryArithmeticDOUBLEoperation(1.0, SqrtR_~xnp1~0#1); {23#false} is VALID [2022-02-20 16:25:35,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} main_#t~ret7#1 := SqrtR_#res#1;assume { :end_inline_SqrtR } true;main_~r~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~r~0#1, 0.9) && ~someBinaryDOUBLEComparisonOperation(main_~r~0#1, 5.0) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {23#false} is VALID [2022-02-20 16:25:35,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume 0 == __VERIFIER_assert_~cond#1; {23#false} is VALID [2022-02-20 16:25:35,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-02-20 16:25:35,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:25:35,249 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:25:35,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687955103] [2022-02-20 16:25:35,250 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687955103] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:25:35,250 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:25:35,250 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:25:35,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934632219] [2022-02-20 16:25:35,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:25:35,256 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:25:35,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:25:35,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:35,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:25:35,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:25:35,284 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:25:35,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:25:35,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:25:35,307 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:25:35,347 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-02-20 16:25:35,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:25:35,348 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:25:35,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:25:35,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2022-02-20 16:25:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:35,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2022-02-20 16:25:35,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 48 transitions. [2022-02-20 16:25:35,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:25:35,423 INFO L225 Difference]: With dead ends: 36 [2022-02-20 16:25:35,425 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 16:25:35,428 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:25:35,431 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:25:35,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:25:35,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 16:25:35,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 16:25:35,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:25:35,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:35,454 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:35,454 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:35,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:25:35,456 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 16:25:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 16:25:35,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:25:35,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:25:35,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2022-02-20 16:25:35,459 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2022-02-20 16:25:35,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:25:35,464 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 16:25:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 16:25:35,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:25:35,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:25:35,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:25:35,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:25:35,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:35,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-20 16:25:35,468 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2022-02-20 16:25:35,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:25:35,469 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-20 16:25:35,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:35,469 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 16:25:35,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:25:35,470 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:25:35,470 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:25:35,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:25:35,471 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:25:35,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:25:35,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2049407722, now seen corresponding path program 1 times [2022-02-20 16:25:35,475 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:25:35,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201636717] [2022-02-20 16:25:35,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:25:35,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:25:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:25:35,508 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:25:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:25:35,547 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:25:35,547 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:25:35,549 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:25:35,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:25:35,557 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:25:35,559 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:25:35,598 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:25:35,598 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:25:35,598 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:25:35,598 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:25:35,598 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:25:35,598 WARN L170 areAnnotationChecker]: L52-4 has no Hoare annotation [2022-02-20 16:25:35,598 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 16:25:35,598 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 16:25:35,599 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:25:35,599 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-20 16:25:35,599 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:25:35,599 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:25:35,599 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:25:35,599 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2022-02-20 16:25:35,599 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-02-20 16:25:35,599 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-02-20 16:25:35,599 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-02-20 16:25:35,599 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-02-20 16:25:35,600 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:25:35,600 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 16:25:35,600 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 16:25:35,600 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-20 16:25:35,600 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-20 16:25:35,600 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-02-20 16:25:35,600 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:25:35,600 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:25:35,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:25:35 BoogieIcfgContainer [2022-02-20 16:25:35,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:25:35,604 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:25:35,604 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:25:35,604 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:25:35,604 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:25:34" (3/4) ... [2022-02-20 16:25:35,607 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:25:35,607 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:25:35,608 INFO L158 Benchmark]: Toolchain (without parser) took 1140.79ms. Allocated memory was 100.7MB in the beginning and 134.2MB in the end (delta: 33.6MB). Free memory was 68.5MB in the beginning and 88.8MB in the end (delta: -20.3MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2022-02-20 16:25:35,608 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:25:35,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.14ms. Allocated memory is still 100.7MB. Free memory was 68.2MB in the beginning and 74.0MB in the end (delta: -5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:25:35,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.94ms. Allocated memory is still 100.7MB. Free memory was 74.0MB in the beginning and 71.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:25:35,612 INFO L158 Benchmark]: Boogie Preprocessor took 27.14ms. Allocated memory is still 100.7MB. Free memory was 71.9MB in the beginning and 70.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:25:35,614 INFO L158 Benchmark]: RCFGBuilder took 206.94ms. Allocated memory is still 100.7MB. Free memory was 70.9MB in the beginning and 60.5MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:25:35,614 INFO L158 Benchmark]: TraceAbstraction took 677.01ms. Allocated memory was 100.7MB in the beginning and 134.2MB in the end (delta: 33.6MB). Free memory was 60.1MB in the beginning and 89.6MB in the end (delta: -29.5MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2022-02-20 16:25:35,615 INFO L158 Benchmark]: Witness Printer took 2.90ms. Allocated memory is still 134.2MB. Free memory was 89.4MB in the beginning and 88.8MB in the end (delta: 631.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:25:35,616 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.14ms. Allocated memory is still 100.7MB. Free memory was 68.2MB in the beginning and 74.0MB in the end (delta: -5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.94ms. Allocated memory is still 100.7MB. Free memory was 74.0MB in the beginning and 71.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.14ms. Allocated memory is still 100.7MB. Free memory was 71.9MB in the beginning and 70.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 206.94ms. Allocated memory is still 100.7MB. Free memory was 70.9MB in the beginning and 60.5MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 677.01ms. Allocated memory was 100.7MB in the beginning and 134.2MB in the end (delta: 33.6MB). Free memory was 60.1MB in the beginning and 89.6MB in the end (delta: -29.5MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * Witness Printer took 2.90ms. Allocated memory is still 134.2MB. Free memory was 89.4MB in the beginning and 88.8MB in the end (delta: 631.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 20]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someUnaryDOUBLEoperation at line 32, overapproximation of someBinaryArithmeticDOUBLEoperation at line 44. Possible FailurePath: [L22] double _EPS = 1e-6; VAL [_EPS=1/1000000] [L49] double d, dd, r; [L50] double epsilon = 1e-8; [L52] d = 1. VAL [_EPS=1/1000000, d=1, epsilon=1/100000000] [L52] COND TRUE d <= 20. [L54] dd = __VERIFIER_nondet_double() [L55] CALL assume_abort_if_not(dd >= d-epsilon && dd <= d+epsilon) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, _EPS=1/1000000, cond=1] [L55] RET assume_abort_if_not(dd >= d-epsilon && dd <= d+epsilon) [L57] CALL, EXPR SqrtR(dd) [L26] double xn, xnp1, residu, lsup, linf; [L27] int i, cond; VAL [\old(Input)=50, _EPS=1/1000000, Input=50] [L28] COND TRUE Input <= 1.0 [L28] xn = 1.0 VAL [\old(Input)=50, _EPS=1/1000000, Input=50, xn=1] [L29] xnp1 = xn [L30] residu = 2.0*_EPS*(xn+xnp1) [L31] lsup = _EPS * (xn+xnp1) [L32] linf = -lsup [L33] cond = ((residu > lsup) || (residu < linf)) [L34] i = 0 VAL [\old(Input)=50, _EPS=1/1000000, cond=0, i=0, Input=50, xn=1, xn=1] [L35] COND FALSE !(\read(cond)) VAL [\old(Input)=50, _EPS=1/1000000, cond=0, i=0, Input=50, xn=1, xn=1] [L44] return 1.0 / xnp1; VAL [\old(Input)=50, _EPS=1/1000000, cond=0, i=0, Input=50, xn=1, xn=1] [L57] RET, EXPR SqrtR(dd) [L57] r = SqrtR(dd) [L59] CALL __VERIFIER_assert(r >= 0.9 && r <= 5.) [L20] COND TRUE !(cond) VAL [\old(cond)=0, _EPS=1/1000000, cond=0] [L20] reach_error() VAL [\old(cond)=0, _EPS=1/1000000, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 21 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, 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, InterpolantAutomatonStates: 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 11 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 [2022-02-20 16:25:35,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/sqrt_Householder_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 e0a18ef05fc68655f6745bf4a502e0079c3ee8f2ad8ce0a20fedaec28a3ae221 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:25:37,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:25:37,264 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:25:37,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:25:37,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:25:37,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:25:37,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:25:37,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:25:37,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:25:37,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:25:37,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:25:37,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:25:37,298 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:25:37,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:25:37,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:25:37,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:25:37,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:25:37,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:25:37,315 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:25:37,316 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:25:37,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:25:37,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:25:37,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:25:37,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:25:37,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:25:37,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:25:37,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:25:37,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:25:37,325 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:25:37,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:25:37,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:25:37,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:25:37,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:25:37,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:25:37,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:25:37,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:25:37,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:25:37,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:25:37,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:25:37,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:25:37,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:25:37,339 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:25:37,359 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:25:37,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:25:37,359 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:25:37,360 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:25:37,360 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:25:37,360 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:25:37,361 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:25:37,361 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:25:37,361 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:25:37,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:25:37,361 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:25:37,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:25:37,362 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:25:37,362 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:25:37,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:25:37,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:25:37,362 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:25:37,362 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:25:37,362 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:25:37,363 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:25:37,363 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:25:37,363 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:25:37,364 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:25:37,364 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:25:37,365 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:25:37,365 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:25:37,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:25:37,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:25:37,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:25:37,365 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:25:37,365 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:25:37,366 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:25:37,366 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:25:37,366 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:25:37,366 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:25:37,366 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:25:37,367 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 -> e0a18ef05fc68655f6745bf4a502e0079c3ee8f2ad8ce0a20fedaec28a3ae221 [2022-02-20 16:25:37,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:25:37,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:25:37,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:25:37,619 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:25:37,619 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:25:37,620 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c [2022-02-20 16:25:37,668 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edaf247d6/6f5b603d5e634dbc955d01eef80a15c2/FLAG82cf03595 [2022-02-20 16:25:38,033 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:25:38,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c [2022-02-20 16:25:38,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edaf247d6/6f5b603d5e634dbc955d01eef80a15c2/FLAG82cf03595 [2022-02-20 16:25:38,438 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edaf247d6/6f5b603d5e634dbc955d01eef80a15c2 [2022-02-20 16:25:38,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:25:38,442 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:25:38,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:25:38,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:25:38,446 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:25:38,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:25:38" (1/1) ... [2022-02-20 16:25:38,449 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f42a2af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:38, skipping insertion in model container [2022-02-20 16:25:38,450 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:25:38" (1/1) ... [2022-02-20 16:25:38,454 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:25:38,467 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:25:38,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c[855,868] [2022-02-20 16:25:38,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:25:38,608 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:25:38,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c[855,868] [2022-02-20 16:25:38,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:25:38,659 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:25:38,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:38 WrapperNode [2022-02-20 16:25:38,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:25:38,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:25:38,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:25:38,661 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:25:38,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:38" (1/1) ... [2022-02-20 16:25:38,676 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:38" (1/1) ... [2022-02-20 16:25:38,710 INFO L137 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 74 [2022-02-20 16:25:38,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:25:38,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:25:38,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:25:38,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:25:38,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:38" (1/1) ... [2022-02-20 16:25:38,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:38" (1/1) ... [2022-02-20 16:25:38,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:38" (1/1) ... [2022-02-20 16:25:38,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:38" (1/1) ... [2022-02-20 16:25:38,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:38" (1/1) ... [2022-02-20 16:25:38,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:38" (1/1) ... [2022-02-20 16:25:38,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:38" (1/1) ... [2022-02-20 16:25:38,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:25:38,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:25:38,761 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:25:38,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:25:38,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:38" (1/1) ... [2022-02-20 16:25:38,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:25:38,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:25:38,787 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:25:38,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:25:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:25:38,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:25:38,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:25:38,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:25:38,882 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:25:38,884 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:25:48,612 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:25:48,616 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:25:48,616 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 16:25:48,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:25:48 BoogieIcfgContainer [2022-02-20 16:25:48,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:25:48,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:25:48,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:25:48,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:25:48,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:25:38" (1/3) ... [2022-02-20 16:25:48,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e01ff40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:25:48, skipping insertion in model container [2022-02-20 16:25:48,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:38" (2/3) ... [2022-02-20 16:25:48,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e01ff40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:25:48, skipping insertion in model container [2022-02-20 16:25:48,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:25:48" (3/3) ... [2022-02-20 16:25:48,628 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_pseudoconstant.c [2022-02-20 16:25:48,633 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:25:48,633 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:25:48,677 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:25:48,682 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:25:48,682 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:25:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:48,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:25:48,695 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:25:48,696 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:25:48,696 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:25:48,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:25:48,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1569195288, now seen corresponding path program 1 times [2022-02-20 16:25:48,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:25:48,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1004249230] [2022-02-20 16:25:48,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:25:48,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:25:48,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:25:48,712 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:25:48,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:25:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:25:49,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:25:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:25:49,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:25:50,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(34bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~_EPS~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E-6); {22#true} is VALID [2022-02-20 16:25:50,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_#t~post5#1, main_~d~0#1, main_~dd~0#1, main_~r~0#1, main_~epsilon~0#1;havoc main_~d~0#1;havoc main_~dd~0#1;havoc main_~r~0#1;main_~epsilon~0#1 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E-8);main_~d~0#1 := ~to_fp~DOUBLE(currentRoundingMode, 1.0); {22#true} is VALID [2022-02-20 16:25:50,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume !!~fp.leq~DOUBLE(main_~d~0#1, ~to_fp~DOUBLE(currentRoundingMode, 20.0));main_~dd~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~fp.geq~DOUBLE(main_~dd~0#1, ~fp.sub~DOUBLE(currentRoundingMode, main_~d~0#1, main_~epsilon~0#1)) && ~fp.leq~DOUBLE(main_~dd~0#1, ~fp.add~DOUBLE(currentRoundingMode, main_~d~0#1, main_~epsilon~0#1)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {22#true} is VALID [2022-02-20 16:25:50,067 INFO L290 TraceCheckUtils]: 3: Hoare triple {22#true} assume 0bv32 == assume_abort_if_not_~cond#1;assume false; {22#true} is VALID [2022-02-20 16:25:50,067 INFO L290 TraceCheckUtils]: 4: Hoare triple {22#true} assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_SqrtR } true;SqrtR_#in~Input#1 := main_~dd~0#1;havoc SqrtR_#res#1;havoc SqrtR_#t~post4#1, SqrtR_~Input#1, SqrtR_~xn~0#1, SqrtR_~xnp1~0#1, SqrtR_~residu~0#1, SqrtR_~lsup~0#1, SqrtR_~linf~0#1, SqrtR_~i~0#1, SqrtR_~cond~0#1;SqrtR_~Input#1 := SqrtR_#in~Input#1;havoc SqrtR_~xn~0#1;havoc SqrtR_~xnp1~0#1;havoc SqrtR_~residu~0#1;havoc SqrtR_~lsup~0#1;havoc SqrtR_~linf~0#1;havoc SqrtR_~i~0#1;havoc SqrtR_~cond~0#1; {22#true} is VALID [2022-02-20 16:25:50,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} assume ~fp.leq~DOUBLE(SqrtR_~Input#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));SqrtR_~xn~0#1 := ~to_fp~DOUBLE(currentRoundingMode, 1.0); {22#true} is VALID [2022-02-20 16:25:50,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} SqrtR_~xnp1~0#1 := SqrtR_~xn~0#1;SqrtR_~residu~0#1 := ~fp.mul~DOUBLE(currentRoundingMode, ~fp.mul~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 2.0), ~_EPS~0), ~fp.add~DOUBLE(currentRoundingMode, SqrtR_~xn~0#1, SqrtR_~xnp1~0#1));SqrtR_~lsup~0#1 := ~fp.mul~DOUBLE(currentRoundingMode, ~_EPS~0, ~fp.add~DOUBLE(currentRoundingMode, SqrtR_~xn~0#1, SqrtR_~xnp1~0#1));SqrtR_~linf~0#1 := ~fp.neg~DOUBLE(SqrtR_~lsup~0#1);SqrtR_~cond~0#1 := (if ~fp.gt~DOUBLE(SqrtR_~residu~0#1, SqrtR_~lsup~0#1) || ~fp.lt~DOUBLE(SqrtR_~residu~0#1, SqrtR_~linf~0#1) then 1bv32 else 0bv32);SqrtR_~i~0#1 := 0bv32; {22#true} is VALID [2022-02-20 16:25:50,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-02-20 16:25:50,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} SqrtR_#res#1 := ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0), SqrtR_~xnp1~0#1); {23#false} is VALID [2022-02-20 16:25:50,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} main_#t~ret7#1 := SqrtR_#res#1;assume { :end_inline_SqrtR } true;main_~r~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~fp.geq~DOUBLE(main_~r~0#1, ~to_fp~DOUBLE(currentRoundingMode, 0.9)) && ~fp.leq~DOUBLE(main_~r~0#1, ~to_fp~DOUBLE(currentRoundingMode, 5.0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {23#false} is VALID [2022-02-20 16:25:50,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {23#false} is VALID [2022-02-20 16:25:50,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-02-20 16:25:50,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:25:50,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:25:50,074 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:25:50,074 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1004249230] [2022-02-20 16:25:50,075 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1004249230] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:25:50,075 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:25:50,075 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:25:50,077 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209617797] [2022-02-20 16:25:50,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:25:50,081 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:25:50,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:25:50,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:51,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:25:51,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:25:51,104 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:25:51,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:25:51,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:25:51,120 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:26:00,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:26:00,478 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-02-20 16:26:00,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:26:00,478 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:26:00,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:26:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:26:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2022-02-20 16:26:00,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:26:00,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2022-02-20 16:26:00,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 48 transitions. [2022-02-20 16:26:06,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:26:06,600 INFO L225 Difference]: With dead ends: 36 [2022-02-20 16:26:06,600 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 16:26:06,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:26:06,605 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:26:06,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:26:06,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 16:26:06,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 16:26:06,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:26:06,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:26:06,627 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:26:06,628 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:26:06,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:26:06,632 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 16:26:06,632 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 16:26:06,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:26:06,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:26:06,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2022-02-20 16:26:06,635 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2022-02-20 16:26:06,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:26:06,637 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-02-20 16:26:06,637 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 16:26:06,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:26:06,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:26:06,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:26:06,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:26:06,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:26:06,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-02-20 16:26:06,645 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2022-02-20 16:26:06,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:26:06,645 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-02-20 16:26:06,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:26:06,646 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-02-20 16:26:06,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:26:06,646 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:26:06,646 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:26:06,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 16:26:06,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:26:06,850 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:26:06,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:26:06,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2049407722, now seen corresponding path program 1 times [2022-02-20 16:26:06,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:26:06,851 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915893457] [2022-02-20 16:26:06,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:26:06,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:26:06,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:26:06,853 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:26:06,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:26:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:26:08,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 16:26:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:26:08,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:26:09,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {154#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(34bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~_EPS~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E-6); {159#(and (= ~_EPS~0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:26:09,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#(and (= ~_EPS~0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000.0))) (= currentRoundingMode roundNearestTiesToEven))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_#t~post5#1, main_~d~0#1, main_~dd~0#1, main_~r~0#1, main_~epsilon~0#1;havoc main_~d~0#1;havoc main_~dd~0#1;havoc main_~r~0#1;main_~epsilon~0#1 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E-8);main_~d~0#1 := ~to_fp~DOUBLE(currentRoundingMode, 1.0); {159#(and (= ~_EPS~0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:26:09,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#(and (= ~_EPS~0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000.0))) (= currentRoundingMode roundNearestTiesToEven))} assume !!~fp.leq~DOUBLE(main_~d~0#1, ~to_fp~DOUBLE(currentRoundingMode, 20.0));main_~dd~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~fp.geq~DOUBLE(main_~dd~0#1, ~fp.sub~DOUBLE(currentRoundingMode, main_~d~0#1, main_~epsilon~0#1)) && ~fp.leq~DOUBLE(main_~dd~0#1, ~fp.add~DOUBLE(currentRoundingMode, main_~d~0#1, main_~epsilon~0#1)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {159#(and (= ~_EPS~0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:26:09,545 INFO L290 TraceCheckUtils]: 3: Hoare triple {159#(and (= ~_EPS~0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000.0))) (= currentRoundingMode roundNearestTiesToEven))} assume !(0bv32 == assume_abort_if_not_~cond#1); {159#(and (= ~_EPS~0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:26:09,545 INFO L290 TraceCheckUtils]: 4: Hoare triple {159#(and (= ~_EPS~0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000.0))) (= currentRoundingMode roundNearestTiesToEven))} assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_SqrtR } true;SqrtR_#in~Input#1 := main_~dd~0#1;havoc SqrtR_#res#1;havoc SqrtR_#t~post4#1, SqrtR_~Input#1, SqrtR_~xn~0#1, SqrtR_~xnp1~0#1, SqrtR_~residu~0#1, SqrtR_~lsup~0#1, SqrtR_~linf~0#1, SqrtR_~i~0#1, SqrtR_~cond~0#1;SqrtR_~Input#1 := SqrtR_#in~Input#1;havoc SqrtR_~xn~0#1;havoc SqrtR_~xnp1~0#1;havoc SqrtR_~residu~0#1;havoc SqrtR_~lsup~0#1;havoc SqrtR_~linf~0#1;havoc SqrtR_~i~0#1;havoc SqrtR_~cond~0#1; {159#(and (= ~_EPS~0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:26:09,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#(and (= ~_EPS~0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000.0))) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.leq~DOUBLE(SqrtR_~Input#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));SqrtR_~xn~0#1 := ~to_fp~DOUBLE(currentRoundingMode, 1.0); {175#(and (= |ULTIMATE.start_SqrtR_~xn~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= ~_EPS~0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:26:09,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {175#(and (= |ULTIMATE.start_SqrtR_~xn~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= ~_EPS~0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000.0))) (= currentRoundingMode roundNearestTiesToEven))} SqrtR_~xnp1~0#1 := SqrtR_~xn~0#1;SqrtR_~residu~0#1 := ~fp.mul~DOUBLE(currentRoundingMode, ~fp.mul~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 2.0), ~_EPS~0), ~fp.add~DOUBLE(currentRoundingMode, SqrtR_~xn~0#1, SqrtR_~xnp1~0#1));SqrtR_~lsup~0#1 := ~fp.mul~DOUBLE(currentRoundingMode, ~_EPS~0, ~fp.add~DOUBLE(currentRoundingMode, SqrtR_~xn~0#1, SqrtR_~xnp1~0#1));SqrtR_~linf~0#1 := ~fp.neg~DOUBLE(SqrtR_~lsup~0#1);SqrtR_~cond~0#1 := (if ~fp.gt~DOUBLE(SqrtR_~residu~0#1, SqrtR_~lsup~0#1) || ~fp.lt~DOUBLE(SqrtR_~residu~0#1, SqrtR_~linf~0#1) then 1bv32 else 0bv32);SqrtR_~i~0#1 := 0bv32; {179#(= (_ bv1 32) |ULTIMATE.start_SqrtR_~cond~0#1|)} is VALID [2022-02-20 16:26:09,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {179#(= (_ bv1 32) |ULTIMATE.start_SqrtR_~cond~0#1|)} assume !(0bv32 != SqrtR_~cond~0#1); {155#false} is VALID [2022-02-20 16:26:09,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {155#false} SqrtR_#res#1 := ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0), SqrtR_~xnp1~0#1); {155#false} is VALID [2022-02-20 16:26:09,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {155#false} main_#t~ret7#1 := SqrtR_#res#1;assume { :end_inline_SqrtR } true;main_~r~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~fp.geq~DOUBLE(main_~r~0#1, ~to_fp~DOUBLE(currentRoundingMode, 0.9)) && ~fp.leq~DOUBLE(main_~r~0#1, ~to_fp~DOUBLE(currentRoundingMode, 5.0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {155#false} is VALID [2022-02-20 16:26:09,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {155#false} is VALID [2022-02-20 16:26:09,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {155#false} assume !false; {155#false} is VALID [2022-02-20 16:26:09,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:26:09,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:26:09,553 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:26:09,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915893457] [2022-02-20 16:26:09,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915893457] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:26:09,553 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:26:09,554 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:26:09,554 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612905775] [2022-02-20 16:26:09,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:26:09,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:26:09,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:26:09,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:26:12,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 11 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 16:26:12,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:26:12,615 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:26:12,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:26:12,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:26:12,616 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:26:19,557 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:26:21,308 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:26:23,754 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:26:25,760 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:26:27,779 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:26:30,747 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:26:37,185 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:26:39,207 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:26:41,456 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:26:43,460 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:26:45,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:26:45,995 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-02-20 16:26:45,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:26:45,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:26:45,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:26:45,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:26:45,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-02-20 16:26:45,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:26:45,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-02-20 16:26:45,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions.