./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0a18ef05fc68655f6745bf4a502e0079c3ee8f2ad8ce0a20fedaec28a3ae221 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:52:40,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:52:40,124 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 06:52:40,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:52:40,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:52:40,167 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:52:40,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:52:40,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:52:40,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:52:40,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:52:40,172 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:52:40,174 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:52:40,174 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:52:40,174 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:52:40,175 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:52:40,177 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:52:40,177 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:52:40,178 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:52:40,178 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:52:40,178 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:52:40,179 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:52:40,183 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:52:40,183 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:52:40,183 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:52:40,184 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:52:40,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:52:40,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:52:40,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:52:40,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:52:40,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:52:40,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:52:40,186 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:52:40,186 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:52:40,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:52:40,189 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:52:40,190 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:52:40,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:52:40,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:52:40,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:52:40,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:52:40,192 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:52:40,192 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:52:40,193 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:52:40,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:52:40,194 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:52:40,194 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:52:40,194 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:52:40,195 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan 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 [2024-11-09 06:52:40,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:52:40,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:52:40,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:52:40,552 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:52:40,552 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:52:40,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c Unable to find full path for "g++" [2024-11-09 06:52:42,563 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:52:42,765 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:52:42,766 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c [2024-11-09 06:52:42,774 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/data/835ec9be3/470e01637a104711b5fc7bb39c333f04/FLAG62dcb2520 [2024-11-09 06:52:43,146 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/data/835ec9be3/470e01637a104711b5fc7bb39c333f04 [2024-11-09 06:52:43,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:52:43,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:52:43,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:52:43,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:52:43,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:52:43,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:52:43" (1/1) ... [2024-11-09 06:52:43,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@914a262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:43, skipping insertion in model container [2024-11-09 06:52:43,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:52:43" (1/1) ... [2024-11-09 06:52:43,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:52:43,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c[855,868] [2024-11-09 06:52:43,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:52:43,440 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:52:43,456 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c[855,868] [2024-11-09 06:52:43,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:52:43,498 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:52:43,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:43 WrapperNode [2024-11-09 06:52:43,499 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:52:43,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:52:43,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:52:43,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:52:43,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:43" (1/1) ... [2024-11-09 06:52:43,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:43" (1/1) ... [2024-11-09 06:52:43,545 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 71 [2024-11-09 06:52:43,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:52:43,546 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:52:43,546 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:52:43,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:52:43,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:43" (1/1) ... [2024-11-09 06:52:43,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:43" (1/1) ... [2024-11-09 06:52:43,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:43" (1/1) ... [2024-11-09 06:52:43,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:43" (1/1) ... [2024-11-09 06:52:43,565 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:43" (1/1) ... [2024-11-09 06:52:43,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:43" (1/1) ... [2024-11-09 06:52:43,577 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:43" (1/1) ... [2024-11-09 06:52:43,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:43" (1/1) ... [2024-11-09 06:52:43,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:52:43,584 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:52:43,585 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:52:43,585 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:52:43,585 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:43" (1/1) ... [2024-11-09 06:52:43,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:52:43,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:52:43,618 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:52:43,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:52:43,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:52:43,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:52:43,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:52:43,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:52:43,718 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:52:43,720 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:52:43,868 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-09 06:52:43,868 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:52:43,924 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:52:43,924 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 06:52:43,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:52:43 BoogieIcfgContainer [2024-11-09 06:52:43,925 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:52:43,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:52:43,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:52:43,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:52:43,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:52:43" (1/3) ... [2024-11-09 06:52:43,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e3bfdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:52:43, skipping insertion in model container [2024-11-09 06:52:43,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:43" (2/3) ... [2024-11-09 06:52:43,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e3bfdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:52:43, skipping insertion in model container [2024-11-09 06:52:43,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:52:43" (3/3) ... [2024-11-09 06:52:43,938 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_pseudoconstant.c [2024-11-09 06:52:43,957 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:52:43,958 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 06:52:44,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:52:44,033 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1bcdd285, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:52:44,034 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 06:52:44,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 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) [2024-11-09 06:52:44,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:52:44,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:52:44,043 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:52:44,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:52:44,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:52:44,048 INFO L85 PathProgramCache]: Analyzing trace with hash 281664915, now seen corresponding path program 1 times [2024-11-09 06:52:44,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:52:44,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182669609] [2024-11-09 06:52:44,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:52:44,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:52:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:52:44,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:52:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:52:44,264 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 06:52:44,266 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:52:44,267 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 06:52:44,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:52:44,272 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-09 06:52:44,291 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:52:44,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:52:44 BoogieIcfgContainer [2024-11-09 06:52:44,295 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:52:44,296 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:52:44,296 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:52:44,296 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:52:44,297 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:52:43" (3/4) ... [2024-11-09 06:52:44,300 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 06:52:44,301 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:52:44,302 INFO L158 Benchmark]: Toolchain (without parser) took 1151.98ms. Allocated memory was 138.4MB in the beginning and 190.8MB in the end (delta: 52.4MB). Free memory was 78.5MB in the beginning and 152.2MB in the end (delta: -73.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:52:44,303 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 138.4MB. Free memory was 111.4MB in the beginning and 111.2MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:52:44,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.87ms. Allocated memory was 138.4MB in the beginning and 190.8MB in the end (delta: 52.4MB). Free memory was 78.4MB in the beginning and 158.6MB in the end (delta: -80.2MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2024-11-09 06:52:44,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.08ms. Allocated memory is still 190.8MB. Free memory was 158.6MB in the beginning and 160.1MB in the end (delta: -1.5MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2024-11-09 06:52:44,305 INFO L158 Benchmark]: Boogie Preprocessor took 38.07ms. Allocated memory is still 190.8MB. Free memory was 160.1MB in the beginning and 159.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:52:44,306 INFO L158 Benchmark]: RCFGBuilder took 340.41ms. Allocated memory is still 190.8MB. Free memory was 159.0MB in the beginning and 146.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 06:52:44,306 INFO L158 Benchmark]: TraceAbstraction took 367.84ms. Allocated memory is still 190.8MB. Free memory was 145.4MB in the beginning and 152.2MB in the end (delta: -6.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:52:44,307 INFO L158 Benchmark]: Witness Printer took 5.15ms. Allocated memory is still 190.8MB. Free memory is still 152.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:52:44,310 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 138.4MB. Free memory was 111.4MB in the beginning and 111.2MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.87ms. Allocated memory was 138.4MB in the beginning and 190.8MB in the end (delta: 52.4MB). Free memory was 78.4MB in the beginning and 158.6MB in the end (delta: -80.2MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.08ms. Allocated memory is still 190.8MB. Free memory was 158.6MB in the beginning and 160.1MB in the end (delta: -1.5MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.07ms. Allocated memory is still 190.8MB. Free memory was 160.1MB in the beginning and 159.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 340.41ms. Allocated memory is still 190.8MB. Free memory was 159.0MB in the beginning and 146.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 367.84ms. Allocated memory is still 190.8MB. Free memory was 145.4MB in the beginning and 152.2MB in the end (delta: -6.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.15ms. Allocated memory is still 190.8MB. Free memory is still 152.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 20]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryArithmeticDOUBLEoperation at line 44, overapproximation of someUnaryDOUBLEoperation at line 32. Possible FailurePath: [L22] double _EPS = 1e-6; [L49] double d, dd, r; [L50] double epsilon = 1e-8; [L52] d = 1. VAL [_EPS=1/1000000] [L52] COND FALSE !(d <= 20.) VAL [_EPS=1/1000000] [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) [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; [L28] COND TRUE Input <= 1.0 [L28] xn = 1.0 [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 [_EPS=1/1000000, cond=0, i=0] [L35] COND TRUE \read(cond) VAL [_EPS=1/1000000, i=0] [L44] return 1.0 / xnp1; [L57] RET, EXPR SqrtR(dd) [L57] r = SqrtR(dd) [L59] CALL __VERIFIER_assert(r >= 0.9 && r <= 5.) [L20] COND TRUE !(cond) VAL [_EPS=1/1000000] [L20] reach_error() VAL [_EPS=1/1000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 [2024-11-09 06:52:44,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0a18ef05fc68655f6745bf4a502e0079c3ee8f2ad8ce0a20fedaec28a3ae221 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:52:46,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:52:46,842 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 06:52:46,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:52:46,850 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:52:46,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:52:46,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:52:46,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:52:46,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:52:46,895 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:52:46,895 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:52:46,896 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:52:46,896 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:52:46,897 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:52:46,899 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:52:46,899 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:52:46,900 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:52:46,900 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:52:46,901 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:52:46,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:52:46,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:52:46,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:52:46,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:52:46,907 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:52:46,907 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:52:46,908 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 06:52:46,908 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:52:46,908 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 06:52:46,908 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:52:46,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:52:46,910 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:52:46,911 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:52:46,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:52:46,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:52:46,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:52:46,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:52:46,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:52:46,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:52:46,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:52:46,915 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 06:52:46,915 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 06:52:46,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:52:46,918 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:52:46,918 INFO L153 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> Taipan 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 [2024-11-09 06:52:47,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:52:47,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:52:47,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:52:47,377 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:52:47,377 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:52:47,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c Unable to find full path for "g++" [2024-11-09 06:52:49,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:52:49,784 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:52:49,784 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c [2024-11-09 06:52:49,797 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/data/806e48b41/60ac32b41015434d8a79bf71eebc2262/FLAG0ece5168d [2024-11-09 06:52:50,076 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/data/806e48b41/60ac32b41015434d8a79bf71eebc2262 [2024-11-09 06:52:50,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:52:50,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:52:50,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:52:50,087 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:52:50,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:52:50,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:52:50" (1/1) ... [2024-11-09 06:52:50,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d361612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:50, skipping insertion in model container [2024-11-09 06:52:50,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:52:50" (1/1) ... [2024-11-09 06:52:50,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:52:50,380 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c[855,868] [2024-11-09 06:52:50,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:52:50,450 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:52:50,497 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/sv-benchmarks/c/float-benchs/sqrt_Householder_pseudoconstant.c[855,868] [2024-11-09 06:52:50,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:52:50,593 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:52:50,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:50 WrapperNode [2024-11-09 06:52:50,595 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:52:50,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:52:50,598 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:52:50,598 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:52:50,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:50" (1/1) ... [2024-11-09 06:52:50,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:50" (1/1) ... [2024-11-09 06:52:50,656 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 72 [2024-11-09 06:52:50,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:52:50,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:52:50,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:52:50,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:52:50,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:50" (1/1) ... [2024-11-09 06:52:50,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:50" (1/1) ... [2024-11-09 06:52:50,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:50" (1/1) ... [2024-11-09 06:52:50,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:50" (1/1) ... [2024-11-09 06:52:50,700 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:50" (1/1) ... [2024-11-09 06:52:50,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:50" (1/1) ... [2024-11-09 06:52:50,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:50" (1/1) ... [2024-11-09 06:52:50,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:50" (1/1) ... [2024-11-09 06:52:50,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:52:50,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:52:50,732 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:52:50,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:52:50,737 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:50" (1/1) ... [2024-11-09 06:52:50,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:52:50,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:52:50,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:52:50,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:52:50,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:52:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 06:52:50,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:52:50,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:52:50,949 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:52:50,952 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:53:00,467 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-09 06:53:00,468 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:53:00,484 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:53:00,484 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 06:53:00,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:53:00 BoogieIcfgContainer [2024-11-09 06:53:00,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:53:00,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:53:00,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:53:00,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:53:00,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:52:50" (1/3) ... [2024-11-09 06:53:00,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9ce4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:53:00, skipping insertion in model container [2024-11-09 06:53:00,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:52:50" (2/3) ... [2024-11-09 06:53:00,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e9ce4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:53:00, skipping insertion in model container [2024-11-09 06:53:00,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:53:00" (3/3) ... [2024-11-09 06:53:00,497 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_pseudoconstant.c [2024-11-09 06:53:00,522 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:53:00,523 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 06:53:00,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:53:00,613 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@49ec230e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:53:00,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 06:53:00,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 states have internal predecessors, (26), 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) [2024-11-09 06:53:00,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 06:53:00,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:53:00,628 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:53:00,629 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:53:00,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:53:00,636 INFO L85 PathProgramCache]: Analyzing trace with hash 58354842, now seen corresponding path program 1 times [2024-11-09 06:53:00,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:53:00,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10303007] [2024-11-09 06:53:00,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:53:00,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:53:00,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:53:00,654 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:53:00,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 06:53:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:53:02,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 06:53:02,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:53:03,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:53:03,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:53:03,463 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:53:03,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10303007] [2024-11-09 06:53:03,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10303007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:53:03,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:53:03,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:53:03,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626962863] [2024-11-09 06:53:03,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:53:03,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:53:03,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:53:03,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:53:03,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:53:03,495 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 states have internal predecessors, (26), 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 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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) [2024-11-09 06:53:06,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:53:08,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:53:10,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:53:12,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:53:15,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:53:17,013 WARN L539 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 [] [2024-11-09 06:53:19,016 WARN L539 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 [] [2024-11-09 06:53:21,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:53:23,770 WARN L539 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 [] [2024-11-09 06:53:25,774 WARN L539 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 [] [2024-11-09 06:53:28,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:53:30,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:53:32,141 WARN L539 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 [] [2024-11-09 06:53:34,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:53:36,781 WARN L539 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 [] [2024-11-09 06:53:38,785 WARN L539 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 [] [2024-11-09 06:53:39,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:53:39,192 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2024-11-09 06:53:39,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:53:39,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-09 06:53:39,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:53:39,210 INFO L225 Difference]: With dead ends: 41 [2024-11-09 06:53:39,210 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 06:53:39,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:53:39,216 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:53:39,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 29 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 15 Unknown, 0 Unchecked, 35.4s Time] [2024-11-09 06:53:39,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 06:53:39,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-09 06:53:39,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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) [2024-11-09 06:53:39,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-09 06:53:39,248 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2024-11-09 06:53:39,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:53:39,249 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-09 06:53:39,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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) [2024-11-09 06:53:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-11-09 06:53:39,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 06:53:39,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:53:39,250 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:53:39,280 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 06:53:39,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:53:39,451 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:53:39,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:53:39,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1833362204, now seen corresponding path program 1 times [2024-11-09 06:53:39,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:53:39,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902976419] [2024-11-09 06:53:39,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:53:39,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:53:39,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:53:39,467 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:53:39,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 06:53:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:53:41,755 WARN L253 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 06:53:41,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:53:59,634 WARN L851 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 06:54:55,339 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)))) (let ((.cse6 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse3)) (.cse5 (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0))))) (or (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse4 (fp.add c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse6 .cse4))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (not (fp.gt .cse2 (fp.mul c_currentRoundingMode .cse3 .cse4))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (not (fp.lt .cse2 |v_ULTIMATE.start_SqrtR_~linf~0#1_11|))))))) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32))) (and (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse7 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= .cse7 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (exists ((|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode .cse6 (fp.add c_currentRoundingMode .cse7 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)) |v_ULTIMATE.start_SqrtR_~linf~0#1_11|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5)))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse8 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= .cse8 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (let ((.cse9 (fp.add c_currentRoundingMode .cse8 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (fp.gt (fp.mul c_currentRoundingMode .cse6 .cse9) (fp.mul c_currentRoundingMode .cse3 .cse9))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5))))) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv1 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 06:55:19,650 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse4 (fp.add c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (let ((.cse2 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse3) .cse4))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (not (fp.gt .cse2 (fp.mul c_currentRoundingMode .cse3 .cse4))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (not (fp.lt .cse2 |v_ULTIMATE.start_SqrtR_~linf~0#1_11|)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 06:55:45,156 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse4 (fp.add c_currentRoundingMode .cse2 .cse2))) (let ((.cse1 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse3) .cse4))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (not (fp.lt .cse1 |v_ULTIMATE.start_SqrtR_~linf~0#1_11|)) (= (fp.div c_currentRoundingMode .cse0 .cse2) |c_ULTIMATE.start_SqrtR_#res#1|) (not (fp.gt .cse1 (fp.mul c_currentRoundingMode .cse3 .cse4))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 06:57:10,350 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse5 (fp.add roundNearestTiesToEven .cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (.cse9 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse1))) (or (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse8 (fp.div roundNearestTiesToEven .cse6 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse2 (fp.add roundNearestTiesToEven .cse8 .cse8))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse9 .cse2)) (.cse3 (fp.div roundNearestTiesToEven .cse6 .cse8))) (and (not (fp.gt .cse0 (fp.mul roundNearestTiesToEven .cse1 .cse2))) (fp.leq .cse3 .cse4) (not (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_11|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse6)) (fp.geq .cse3 .cse7)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse12 (fp.div roundNearestTiesToEven .cse6 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse11 (fp.add roundNearestTiesToEven .cse12 .cse12))) (let ((.cse10 (fp.mul roundNearestTiesToEven .cse9 .cse11))) (and (not (fp.gt .cse10 (fp.mul roundNearestTiesToEven .cse1 .cse11))) (not (fp.lt .cse10 |v_ULTIMATE.start_SqrtR_~linf~0#1_11|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (not (fp.geq (fp.div roundNearestTiesToEven .cse6 .cse12) .cse7)) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse6))))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse15 (fp.div roundNearestTiesToEven .cse6 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse14 (fp.add roundNearestTiesToEven .cse15 .cse15))) (let ((.cse13 (fp.mul roundNearestTiesToEven .cse9 .cse14))) (and (not (fp.gt .cse13 (fp.mul roundNearestTiesToEven .cse1 .cse14))) (not (fp.leq (fp.div roundNearestTiesToEven .cse6 .cse15) .cse4)) (not (fp.lt .cse13 |v_ULTIMATE.start_SqrtR_~linf~0#1_11|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse6)))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))))) is different from false [2024-11-09 06:58:03,107 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.add roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (.cse6 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse1))) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse5 (fp.div roundNearestTiesToEven .cse4 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse2 (fp.add roundNearestTiesToEven .cse5 .cse5))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse6 .cse2))) (and (not (fp.gt .cse0 (fp.mul roundNearestTiesToEven .cse1 .cse2))) (not (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_11|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse3) (not (fp.geq (fp.div roundNearestTiesToEven .cse4 .cse5) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4))))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse9 (fp.div roundNearestTiesToEven .cse4 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse8 (fp.add roundNearestTiesToEven .cse9 .cse9))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse6 .cse8))) (and (not (fp.gt .cse7 (fp.mul roundNearestTiesToEven .cse1 .cse8))) (not (fp.leq (fp.div roundNearestTiesToEven .cse4 .cse9) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (not (fp.lt .cse7 |v_ULTIMATE.start_SqrtR_~linf~0#1_11|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse3) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4)))))))))) is different from false [2024-11-09 06:58:05,248 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.add roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (.cse6 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse1))) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse5 (fp.div roundNearestTiesToEven .cse4 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse2 (fp.add roundNearestTiesToEven .cse5 .cse5))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse6 .cse2))) (and (not (fp.gt .cse0 (fp.mul roundNearestTiesToEven .cse1 .cse2))) (not (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_11|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse3) (not (fp.geq (fp.div roundNearestTiesToEven .cse4 .cse5) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4))))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse9 (fp.div roundNearestTiesToEven .cse4 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse8 (fp.add roundNearestTiesToEven .cse9 .cse9))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse6 .cse8))) (and (not (fp.gt .cse7 (fp.mul roundNearestTiesToEven .cse1 .cse8))) (not (fp.leq (fp.div roundNearestTiesToEven .cse4 .cse9) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (not (fp.lt .cse7 |v_ULTIMATE.start_SqrtR_~linf~0#1_11|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse3) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4)))))))))) is different from true [2024-11-09 06:58:05,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:05,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:58:05,249 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:58:05,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902976419] [2024-11-09 06:58:05,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902976419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:05,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:05,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 06:58:05,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391700763] [2024-11-09 06:58:05,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:05,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 06:58:05,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:58:05,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 06:58:05,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=32, Unknown=7, NotChecked=90, Total=156 [2024-11-09 06:58:05,255 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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) [2024-11-09 06:58:17,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:58:19,040 WARN L539 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 [] [2024-11-09 06:58:21,045 WARN L539 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 [] [2024-11-09 06:58:23,231 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (let ((.cse2 (fp.add c_currentRoundingMode .cse1 .cse0))) (and (= .cse0 |c_ULTIMATE.start_main_~epsilon~0#1|) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (fp.geq |c_ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse1 .cse0)) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse1)) (= |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.div c_currentRoundingMode .cse1 |ULTIMATE.start_SqrtR_~Input#1|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2))) (= .cse1 |c_ULTIMATE.start_main_~d~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq |c_ULTIMATE.start_SqrtR_~Input#1| .cse2)))) is different from false [2024-11-09 06:58:25,472 WARN L539 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 [] [2024-11-09 06:58:27,477 WARN L539 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 [] [2024-11-09 06:58:29,484 WARN L539 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 [] [2024-11-09 06:58:32,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:58:34,399 WARN L539 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 [] [2024-11-09 06:58:36,407 WARN L539 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 [] [2024-11-09 06:58:38,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:58:40,454 WARN L539 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 [] [2024-11-09 06:58:42,458 WARN L539 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 [] [2024-11-09 06:58:44,469 WARN L539 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 [] [2024-11-09 06:58:46,476 WARN L539 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 [] [2024-11-09 06:58:48,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:58:50,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:58:52,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:58:54,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:58:56,203 WARN L539 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 [] [2024-11-09 06:58:58,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:59:00,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:59:02,284 WARN L539 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 [] [2024-11-09 06:59:05,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:59:07,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:59:09,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:59:11,979 WARN L539 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 [] [2024-11-09 06:59:13,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:59:15,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:59:17,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:59:19,381 WARN L539 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 [] [2024-11-09 06:59:21,383 WARN L539 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 [] [2024-11-09 06:59:23,387 WARN L539 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 [] [2024-11-09 06:59:25,391 WARN L539 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 [] [2024-11-09 06:59:27,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:59:29,907 WARN L539 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 [] [2024-11-09 06:59:32,593 WARN L539 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 [] [2024-11-09 06:59:34,598 WARN L539 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 [] [2024-11-09 06:59:36,603 WARN L539 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 [] [2024-11-09 06:59:38,607 WARN L539 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 [] [2024-11-09 06:59:40,611 WARN L539 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 [] [2024-11-09 06:59:43,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:59:45,305 WARN L539 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 [] [2024-11-09 06:59:47,307 WARN L539 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 [] [2024-11-09 06:59:49,314 WARN L539 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 [] [2024-11-09 06:59:51,322 WARN L539 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 [] [2024-11-09 06:59:53,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 06:59:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:59:54,858 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2024-11-09 06:59:54,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:59:54,859 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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 13 [2024-11-09 06:59:54,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:59:54,860 INFO L225 Difference]: With dead ends: 59 [2024-11-09 06:59:54,861 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 06:59:54,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=8, NotChecked=154, Total=272 [2024-11-09 06:59:54,862 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 53 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 43 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 99.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 43 IncrementalHoareTripleChecker+Unknown, 357 IncrementalHoareTripleChecker+Unchecked, 101.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:59:54,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 96 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 43 Unknown, 357 Unchecked, 101.2s Time] [2024-11-09 06:59:54,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 06:59:54,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2024-11-09 06:59:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 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) [2024-11-09 06:59:54,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-09 06:59:54,871 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 13 [2024-11-09 06:59:54,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:59:54,871 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-09 06:59:54,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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) [2024-11-09 06:59:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-09 06:59:54,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 06:59:54,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:59:54,873 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:59:54,919 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 06:59:55,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:59:55,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:59:55,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:59:55,074 INFO L85 PathProgramCache]: Analyzing trace with hash 793645811, now seen corresponding path program 1 times [2024-11-09 06:59:55,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:59:55,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839404947] [2024-11-09 06:59:55,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:59:55,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:59:55,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:59:55,077 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 06:59:55,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 06:59:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:59:57,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 06:59:57,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:59:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:59:57,909 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:59:57,910 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:59:57,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839404947] [2024-11-09 06:59:57,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839404947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:59:57,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:59:57,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:59:57,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481183562] [2024-11-09 06:59:57,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:59:57,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:59:57,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:59:57,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:59:57,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:59:57,913 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2024-11-09 07:00:00,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:00:03,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:00:05,336 WARN L539 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 [] [2024-11-09 07:00:05,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:00:05,623 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-11-09 07:00:05,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:00:05,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2024-11-09 07:00:05,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:00:05,625 INFO L225 Difference]: With dead ends: 46 [2024-11-09 07:00:05,625 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 07:00:05,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:00:05,627 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:00:05,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 3 Unknown, 0 Unchecked, 7.7s Time] [2024-11-09 07:00:05,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 07:00:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-09 07:00:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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) [2024-11-09 07:00:05,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-09 07:00:05,634 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2024-11-09 07:00:05,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:00:05,634 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-09 07:00:05,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) [2024-11-09 07:00:05,635 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-09 07:00:05,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:00:05,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:00:05,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:00:05,682 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 07:00:05,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:00:05,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:00:05,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:00:05,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1791493227, now seen corresponding path program 1 times [2024-11-09 07:00:05,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:00:05,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054792435] [2024-11-09 07:00:05,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:00:05,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:00:05,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:00:05,841 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:00:05,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0e3d516d-48d5-4893-8e92-88b88e940518/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 07:00:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:00:24,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 07:00:24,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:01:12,925 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| .cse4))) (.cse3 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)))) (let ((.cse0 (fp.gt .cse2 .cse3)) (.cse1 (fp.lt .cse2 (fp.neg .cse3)))) (or (and (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv1 32)) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32)))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (= (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse4) .cse4) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |ULTIMATE.start_SqrtR_~Input#1|) .cse4) .cse4))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-09 07:01:14,976 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| .cse4))) (.cse3 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)))) (let ((.cse0 (fp.gt .cse2 .cse3)) (.cse1 (fp.lt .cse2 (fp.neg .cse3)))) (or (and (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv1 32)) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32)))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (= (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse4) .cse4) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |ULTIMATE.start_SqrtR_~Input#1|) .cse4) .cse4))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-09 07:01:43,019 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| .cse2))) (.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)))) (and (not (fp.gt .cse0 .cse1)) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (= (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |ULTIMATE.start_SqrtR_~Input#1|) .cse2) .cse2))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (not (fp.lt .cse0 (fp.neg .cse1))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-09 07:01:45,059 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| .cse2))) (.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)))) (and (not (fp.gt .cse0 .cse1)) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (= (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |ULTIMATE.start_SqrtR_~Input#1|) .cse2) .cse2))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (not (fp.lt .cse0 (fp.neg .cse1))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-09 07:01:59,751 WARN L286 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:02:11,762 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse0) .cse0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |ULTIMATE.start_SqrtR_~Input#1|) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse3 .cse0))) (.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode .cse3 .cse3)))) (and (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0) (not (fp.lt .cse1 (fp.neg .cse2))) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (not (fp.gt .cse1 .cse2)) (= (fp.div c_currentRoundingMode .cse0 .cse3) |c_ULTIMATE.start_SqrtR_#res#1|)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 07:02:13,898 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse0) .cse0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |ULTIMATE.start_SqrtR_~Input#1|) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse3 .cse0))) (.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode .cse3 .cse3)))) (and (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0) (not (fp.lt .cse1 (fp.neg .cse2))) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (not (fp.gt .cse1 .cse2)) (= (fp.div c_currentRoundingMode .cse0 .cse3) |c_ULTIMATE.start_SqrtR_#res#1|)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-09 07:03:14,429 WARN L286 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:03:43,201 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0))) (.cse4 (fp.sub roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse11 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse12 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse13 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (or (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse7 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse10 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse5) .cse5) (fp.add roundNearestTiesToEven .cse11 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse12 |ULTIMATE.start_SqrtR_~Input#1|) .cse5) .cse5))))) .cse13))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven .cse7 .cse5))) (.cse1 (fp.mul roundNearestTiesToEven .cse8 (fp.add roundNearestTiesToEven .cse7 .cse7))) (.cse2 (fp.div roundNearestTiesToEven .cse5 .cse7))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))) (fp.leq .cse2 .cse3) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (fp.geq .cse2 .cse6))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse16 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse10 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse5) .cse5) (fp.add roundNearestTiesToEven .cse11 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse12 |ULTIMATE.start_SqrtR_~Input#1|) .cse5) .cse5))))) .cse13))) (let ((.cse14 (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven .cse16 .cse5))) (.cse15 (fp.mul roundNearestTiesToEven .cse8 (fp.add roundNearestTiesToEven .cse16 .cse16)))) (and (not (fp.gt .cse14 .cse15)) (not (fp.lt .cse14 (fp.neg .cse15))) (not (fp.leq (fp.div roundNearestTiesToEven .cse5 .cse16) .cse3)) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse19 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse10 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse5) .cse5) (fp.add roundNearestTiesToEven .cse11 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse12 |ULTIMATE.start_SqrtR_~Input#1|) .cse5) .cse5))))) .cse13))) (let ((.cse17 (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven .cse19 .cse5))) (.cse18 (fp.mul roundNearestTiesToEven .cse8 (fp.add roundNearestTiesToEven .cse19 .cse19)))) (and (not (fp.gt .cse17 .cse18)) (not (fp.lt .cse17 (fp.neg .cse18))) (not (fp.geq (fp.div roundNearestTiesToEven .cse5 .cse19) .cse6)) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))))) is different from false [2024-11-09 07:04:38,076 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse4 (fp.sub roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse8 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2) (fp.add roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 |ULTIMATE.start_SqrtR_~Input#1|) .cse2) .cse2))))) .cse10))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven .cse3 .cse2))) (.cse1 (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse3 .cse3)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))) (not (fp.leq (fp.div roundNearestTiesToEven .cse2 .cse3) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse13 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2) (fp.add roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 |ULTIMATE.start_SqrtR_~Input#1|) .cse2) .cse2))))) .cse10))) (let ((.cse11 (fp.mul roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven .cse13 .cse2))) (.cse12 (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse13 .cse13)))) (and (not (fp.gt .cse11 .cse12)) (not (fp.lt .cse11 (fp.neg .cse12))) (not (fp.geq (fp.div roundNearestTiesToEven .cse2 .cse13) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2)))))))) is different from false [2024-11-09 07:04:40,248 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse4 (fp.sub roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse8 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2) (fp.add roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 |ULTIMATE.start_SqrtR_~Input#1|) .cse2) .cse2))))) .cse10))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven .cse3 .cse2))) (.cse1 (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse3 .cse3)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))) (not (fp.leq (fp.div roundNearestTiesToEven .cse2 .cse3) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse13 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2) (fp.add roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse9 |ULTIMATE.start_SqrtR_~Input#1|) .cse2) .cse2))))) .cse10))) (let ((.cse11 (fp.mul roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven .cse13 .cse2))) (.cse12 (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse13 .cse13)))) (and (not (fp.gt .cse11 .cse12)) (not (fp.lt .cse11 (fp.neg .cse12))) (not (fp.geq (fp.div roundNearestTiesToEven .cse2 .cse13) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2)))))))) is different from true [2024-11-09 07:04:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-09 07:04:40,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:04:52,715 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)))) is different from false [2024-11-09 07:04:54,789 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)))) is different from true [2024-11-09 07:05:07,751 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)))) (not (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32)))) is different from false [2024-11-09 07:05:09,823 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)))) (not (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32)))) is different from true [2024-11-09 07:05:15,014 WARN L286 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:05:20,205 WARN L286 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:05:25,454 WARN L286 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:05:30,797 WARN L286 SmtUtils]: Spent 5.34s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:05:33,145 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse3 |c_ULTIMATE.start_SqrtR_~xn~0#1|))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse3 .cse3)))) (or (fp.lt .cse0 (fp.neg .cse1)) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse3))) (and (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 5.0)))) (fp.gt .cse0 .cse1)))) is different from false [2024-11-09 07:05:35,440 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse3 |c_ULTIMATE.start_SqrtR_~xn~0#1|))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse3 .cse3)))) (or (fp.lt .cse0 (fp.neg .cse1)) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse3))) (and (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 5.0)))) (fp.gt .cse0 .cse1)))) is different from true [2024-11-09 07:05:40,644 WARN L286 SmtUtils]: Spent 5.20s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:05:45,991 WARN L286 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:05:51,250 WARN L286 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:05:56,709 WARN L286 SmtUtils]: Spent 5.46s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:06:02,025 WARN L286 SmtUtils]: Spent 5.31s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:06:07,377 WARN L286 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:06:12,690 WARN L286 SmtUtils]: Spent 5.31s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:06:17,948 WARN L286 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:06:42,913 WARN L286 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:06:45,209 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse3 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse2 .cse1))) (.cse4 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse2 .cse2)))) (or (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))))) (fp.lt .cse3 (fp.neg .cse4)) (fp.gt .cse3 .cse4) (not (fp.leq |c_ULTIMATE.start_SqrtR_~Input#1| .cse1)))))) is different from false [2024-11-09 07:06:47,490 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse3 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse2 .cse1))) (.cse4 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse2 .cse2)))) (or (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))))) (fp.lt .cse3 (fp.neg .cse4)) (fp.gt .cse3 .cse4) (not (fp.leq |c_ULTIMATE.start_SqrtR_~Input#1| .cse1)))))) is different from true [2024-11-09 07:07:13,813 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~dd~0#1| .cse0) .cse0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~dd~0#1|) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse4 .cse0))) (.cse2 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse4 .cse4)))) (or (not (fp.leq |c_ULTIMATE.start_main_~dd~0#1| .cse0)) (fp.lt .cse1 (fp.neg .cse2)) (fp.gt .cse1 .cse2) (let ((.cse3 (fp.div c_currentRoundingMode .cse0 .cse4))) (and (fp.geq .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 5.0)))))))) is different from false [2024-11-09 07:07:16,080 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~dd~0#1| .cse0) .cse0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~dd~0#1|) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse4 .cse0))) (.cse2 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse4 .cse4)))) (or (not (fp.leq |c_ULTIMATE.start_main_~dd~0#1| .cse0)) (fp.lt .cse1 (fp.neg .cse2)) (fp.gt .cse1 .cse2) (let ((.cse3 (fp.div c_currentRoundingMode .cse0 .cse4))) (and (fp.geq .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 5.0)))))))) is different from true [2024-11-09 07:07:21,218 WARN L286 SmtUtils]: Spent 5.13s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:07:26,239 WARN L286 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:07:36,133 WARN L286 SmtUtils]: Spent 5.00s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:07:46,152 WARN L286 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:07:48,387 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~dd~0#1| .cse0) .cse0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~dd~0#1|) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse4 .cse0))) (.cse2 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse4 .cse4)))) (or (not (fp.leq |c_ULTIMATE.start_main_~dd~0#1| .cse0)) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (fp.lt .cse1 (fp.neg .cse2)) (fp.gt .cse1 .cse2) (let ((.cse3 (fp.div c_currentRoundingMode .cse0 .cse4))) (and (fp.geq .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 5.0)))))))) is different from false [2024-11-09 07:07:50,643 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~dd~0#1| .cse0) .cse0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~dd~0#1|) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse4 .cse0))) (.cse2 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse4 .cse4)))) (or (not (fp.leq |c_ULTIMATE.start_main_~dd~0#1| .cse0)) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (fp.lt .cse1 (fp.neg .cse2)) (fp.gt .cse1 .cse2) (let ((.cse3 (fp.div c_currentRoundingMode .cse0 .cse4))) (and (fp.geq .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 5.0)))))))) is different from true [2024-11-09 07:07:55,750 WARN L286 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:08:00,830 WARN L286 SmtUtils]: Spent 5.08s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:08:05,969 WARN L286 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:08:11,134 WARN L286 SmtUtils]: Spent 5.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)