./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/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_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/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_5a79b65b-d8dd-4d62-a807-696873a9fcac/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 3bb1d9e312234d5c4f7ead2dcb51cc43e4ff3aebeffef1b0758f6a0d5be2ea9b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:46:29,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:46:29,857 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 04:46:29,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:46:29,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:46:29,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:46:29,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:46:29,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:46:29,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:46:29,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:46:29,904 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:46:29,905 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:46:29,905 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:46:29,905 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:46:29,906 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:46:29,906 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:46:29,906 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:46:29,910 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:46:29,911 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:46:29,911 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:46:29,911 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:46:29,915 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:46:29,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:46:29,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:46:29,916 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:46:29,916 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:46:29,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:46:29,917 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:46:29,917 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:46:29,917 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:46:29,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:46:29,918 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:46:29,918 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:46:29,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:46:29,919 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:46:29,919 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:46:29,919 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:46:29,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:46:29,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:46:29,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:46:29,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:46:29,923 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:46:29,924 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:46:29,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:46:29,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:46:29,924 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:46:29,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:46:29,925 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_5a79b65b-d8dd-4d62-a807-696873a9fcac/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_5a79b65b-d8dd-4d62-a807-696873a9fcac/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 -> 3bb1d9e312234d5c4f7ead2dcb51cc43e4ff3aebeffef1b0758f6a0d5be2ea9b [2024-11-09 04:46:30,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:46:30,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:46:30,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:46:30,205 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:46:30,206 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:46:30,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c Unable to find full path for "g++" [2024-11-09 04:46:32,191 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:46:32,381 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:46:32,382 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c [2024-11-09 04:46:32,390 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/data/a75a9eac0/c9d428f2245c464b8a40154b2a464987/FLAG52d69b3ac [2024-11-09 04:46:32,405 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/data/a75a9eac0/c9d428f2245c464b8a40154b2a464987 [2024-11-09 04:46:32,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:46:32,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:46:32,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:46:32,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:46:32,417 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:46:32,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:46:32" (1/1) ... [2024-11-09 04:46:32,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d3bc5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:32, skipping insertion in model container [2024-11-09 04:46:32,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:46:32" (1/1) ... [2024-11-09 04:46:32,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:46:32,645 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_5a79b65b-d8dd-4d62-a807-696873a9fcac/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c[831,844] [2024-11-09 04:46:32,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:46:32,691 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:46:32,706 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_5a79b65b-d8dd-4d62-a807-696873a9fcac/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c[831,844] [2024-11-09 04:46:32,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:46:32,739 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:46:32,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:32 WrapperNode [2024-11-09 04:46:32,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:46:32,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:46:32,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:46:32,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:46:32,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:32" (1/1) ... [2024-11-09 04:46:32,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:32" (1/1) ... [2024-11-09 04:46:32,777 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 62 [2024-11-09 04:46:32,778 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:46:32,779 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:46:32,779 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:46:32,779 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:46:32,789 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:32" (1/1) ... [2024-11-09 04:46:32,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:32" (1/1) ... [2024-11-09 04:46:32,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:32" (1/1) ... [2024-11-09 04:46:32,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:32" (1/1) ... [2024-11-09 04:46:32,800 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:32" (1/1) ... [2024-11-09 04:46:32,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:32" (1/1) ... [2024-11-09 04:46:32,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:32" (1/1) ... [2024-11-09 04:46:32,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:32" (1/1) ... [2024-11-09 04:46:32,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:46:32,809 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:46:32,809 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:46:32,809 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:46:32,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:32" (1/1) ... [2024-11-09 04:46:32,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:46:32,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:46:32,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:46:32,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:46:32,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:46:32,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 04:46:32,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:46:32,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:46:32,973 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:46:32,976 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:46:33,150 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-09 04:46:33,150 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:46:33,261 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:46:33,266 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 04:46:33,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:46:33 BoogieIcfgContainer [2024-11-09 04:46:33,266 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:46:33,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:46:33,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:46:33,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:46:33,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:46:32" (1/3) ... [2024-11-09 04:46:33,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1773e3d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:46:33, skipping insertion in model container [2024-11-09 04:46:33,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:32" (2/3) ... [2024-11-09 04:46:33,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1773e3d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:46:33, skipping insertion in model container [2024-11-09 04:46:33,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:46:33" (3/3) ... [2024-11-09 04:46:33,284 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_interval.c [2024-11-09 04:46:33,300 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:46:33,300 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:46:33,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:46:33,363 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;@26b465ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:46:33,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:46:33,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:46:33,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 04:46:33,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:33,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 04:46:33,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:46:33,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:33,389 INFO L85 PathProgramCache]: Analyzing trace with hash 80272459, now seen corresponding path program 1 times [2024-11-09 04:46:33,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:46:33,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514794653] [2024-11-09 04:46:33,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:33,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:46:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 04:46:33,541 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 04:46:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 04:46:33,575 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 04:46:33,577 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 04:46:33,578 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 04:46:33,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:46:33,585 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-09 04:46:33,603 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 04:46:33,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:46:33 BoogieIcfgContainer [2024-11-09 04:46:33,606 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 04:46:33,607 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 04:46:33,607 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 04:46:33,608 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 04:46:33,608 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:46:33" (3/4) ... [2024-11-09 04:46:33,611 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 04:46:33,612 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 04:46:33,613 INFO L158 Benchmark]: Toolchain (without parser) took 1204.04ms. Allocated memory is still 157.3MB. Free memory was 123.4MB in the beginning and 125.4MB in the end (delta: -2.0MB). Peak memory consumption was 763.9kB. Max. memory is 16.1GB. [2024-11-09 04:46:33,614 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 107.0MB. Free memory is still 53.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:46:33,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.04ms. Allocated memory is still 157.3MB. Free memory was 123.0MB in the beginning and 110.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 04:46:33,615 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.74ms. Allocated memory is still 157.3MB. Free memory was 110.4MB in the beginning and 108.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:46:33,616 INFO L158 Benchmark]: Boogie Preprocessor took 29.12ms. Allocated memory is still 157.3MB. Free memory was 108.7MB in the beginning and 107.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 04:46:33,616 INFO L158 Benchmark]: RCFGBuilder took 457.80ms. Allocated memory is still 157.3MB. Free memory was 107.4MB in the beginning and 94.1MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 04:46:33,617 INFO L158 Benchmark]: TraceAbstraction took 337.04ms. Allocated memory is still 157.3MB. Free memory was 93.2MB in the beginning and 126.1MB in the end (delta: -32.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:46:33,617 INFO L158 Benchmark]: Witness Printer took 5.06ms. Allocated memory is still 157.3MB. Free memory was 126.1MB in the beginning and 125.4MB in the end (delta: 728.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:46:33,620 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.30ms. Allocated memory is still 107.0MB. Free memory is still 53.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.04ms. Allocated memory is still 157.3MB. Free memory was 123.0MB in the beginning and 110.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.74ms. Allocated memory is still 157.3MB. Free memory was 110.4MB in the beginning and 108.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.12ms. Allocated memory is still 157.3MB. Free memory was 108.7MB in the beginning and 107.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 457.80ms. Allocated memory is still 157.3MB. Free memory was 107.4MB in the beginning and 94.1MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 337.04ms. Allocated memory is still 157.3MB. Free memory was 93.2MB in the beginning and 126.1MB in the end (delta: -32.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.06ms. Allocated memory is still 157.3MB. Free memory was 126.1MB in the beginning and 125.4MB in the end (delta: 728.8kB). 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 someBinaryArithmeticDOUBLEoperation at line 44, overapproximation of someUnaryDOUBLEoperation at line 32, overapproximation of someBinaryDOUBLEComparisonOperation at line 56. Possible FailurePath: [L22] double _EPS = 1e-6; [L49] double d, r; [L51] d = __VERIFIER_nondet_double() [L52] CALL assume_abort_if_not(d >= 0.1 && d <= 20.0) [L18] COND FALSE !(!cond) [L52] RET assume_abort_if_not(d >= 0.1 && d <= 20.0) [L54] CALL, EXPR SqrtR(d) [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; [L54] RET, EXPR SqrtR(d) [L54] r = SqrtR(d) [L56] CALL __VERIFIER_assert(r >= 0.3 && 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, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, 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=9occurred 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, 5 NumberOfCodeBlocks, 5 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 04:46:33,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/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_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/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_5a79b65b-d8dd-4d62-a807-696873a9fcac/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 3bb1d9e312234d5c4f7ead2dcb51cc43e4ff3aebeffef1b0758f6a0d5be2ea9b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:46:35,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:46:36,062 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 04:46:36,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:46:36,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:46:36,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:46:36,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:46:36,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:46:36,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:46:36,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:46:36,130 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:46:36,130 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:46:36,130 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:46:36,135 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:46:36,135 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:46:36,135 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:46:36,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:46:36,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 04:46:36,137 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:46:36,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:46:36,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:46:36,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 04:46:36,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:46:36,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 04:46:36,141 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 04:46:36,141 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 04:46:36,141 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:46:36,142 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 04:46:36,142 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:46:36,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 04:46:36,142 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:46:36,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:46:36,143 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 04:46:36,143 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:46:36,143 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:46:36,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:46:36,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:46:36,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:46:36,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 04:46:36,146 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 04:46:36,146 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 04:46:36,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:46:36,147 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:46:36,147 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_5a79b65b-d8dd-4d62-a807-696873a9fcac/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_5a79b65b-d8dd-4d62-a807-696873a9fcac/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 -> 3bb1d9e312234d5c4f7ead2dcb51cc43e4ff3aebeffef1b0758f6a0d5be2ea9b [2024-11-09 04:46:36,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:46:36,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:46:36,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:46:36,579 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:46:36,579 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:46:36,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c Unable to find full path for "g++" [2024-11-09 04:46:38,770 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:46:39,008 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:46:39,011 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c [2024-11-09 04:46:39,020 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/data/3f85574b7/742d30fa2d6c4ce59c95f5473d38955c/FLAG5ff60db77 [2024-11-09 04:46:39,343 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/data/3f85574b7/742d30fa2d6c4ce59c95f5473d38955c [2024-11-09 04:46:39,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:46:39,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:46:39,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:46:39,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:46:39,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:46:39,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:46:39" (1/1) ... [2024-11-09 04:46:39,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e7cbec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:39, skipping insertion in model container [2024-11-09 04:46:39,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:46:39" (1/1) ... [2024-11-09 04:46:39,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:46:39,612 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_5a79b65b-d8dd-4d62-a807-696873a9fcac/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c[831,844] [2024-11-09 04:46:39,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:46:39,669 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:46:39,703 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_5a79b65b-d8dd-4d62-a807-696873a9fcac/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c[831,844] [2024-11-09 04:46:39,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:46:39,745 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:46:39,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:39 WrapperNode [2024-11-09 04:46:39,747 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:46:39,748 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:46:39,748 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:46:39,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:46:39,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:39" (1/1) ... [2024-11-09 04:46:39,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:39" (1/1) ... [2024-11-09 04:46:39,819 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 63 [2024-11-09 04:46:39,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:46:39,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:46:39,823 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:46:39,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:46:39,832 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:39" (1/1) ... [2024-11-09 04:46:39,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:39" (1/1) ... [2024-11-09 04:46:39,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:39" (1/1) ... [2024-11-09 04:46:39,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:39" (1/1) ... [2024-11-09 04:46:39,849 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:39" (1/1) ... [2024-11-09 04:46:39,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:39" (1/1) ... [2024-11-09 04:46:39,858 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:39" (1/1) ... [2024-11-09 04:46:39,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:39" (1/1) ... [2024-11-09 04:46:39,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:46:39,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:46:39,868 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:46:39,870 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:46:39,871 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:39" (1/1) ... [2024-11-09 04:46:39,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:46:39,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:46:39,905 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:46:39,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:46:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:46:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 04:46:39,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:46:39,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:46:40,021 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:46:40,024 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:46:48,744 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-09 04:46:48,745 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:46:48,761 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:46:48,761 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 04:46:48,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:46:48 BoogieIcfgContainer [2024-11-09 04:46:48,762 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:46:48,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:46:48,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:46:48,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:46:48,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:46:39" (1/3) ... [2024-11-09 04:46:48,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba2dcfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:46:48, skipping insertion in model container [2024-11-09 04:46:48,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:46:39" (2/3) ... [2024-11-09 04:46:48,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba2dcfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:46:48, skipping insertion in model container [2024-11-09 04:46:48,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:46:48" (3/3) ... [2024-11-09 04:46:48,777 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_interval.c [2024-11-09 04:46:48,794 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:46:48,794 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 04:46:48,847 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:46:48,855 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;@681132e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:46:48,855 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 04:46:48,859 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 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 04:46:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 04:46:48,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:48,865 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:46:48,866 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:46:48,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:48,871 INFO L85 PathProgramCache]: Analyzing trace with hash 338147700, now seen corresponding path program 1 times [2024-11-09 04:46:48,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:46:48,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720939837] [2024-11-09 04:46:48,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:48,882 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 04:46:48,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:46:48,884 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/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 04:46:48,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/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 04:46:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:50,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 04:46:50,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:46:50,224 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 04:46:50,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:46:50,225 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:46:50,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720939837] [2024-11-09 04:46:50,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720939837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:46:50,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:46:50,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:46:50,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926674122] [2024-11-09 04:46:50,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:46:50,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 04:46:50,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:46:50,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 04:46:50,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 04:46:50,257 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:46:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:46:50,268 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-09 04:46:50,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 04:46:50,270 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 04:46:50,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:46:50,278 INFO L225 Difference]: With dead ends: 31 [2024-11-09 04:46:50,278 INFO L226 Difference]: Without dead ends: 13 [2024-11-09 04:46:50,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 04:46:50,284 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 04:46:50,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 04:46:50,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-09 04:46:50,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-09 04:46:50,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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 04:46:50,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2024-11-09 04:46:50,313 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2024-11-09 04:46:50,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:46:50,314 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2024-11-09 04:46:50,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:46:50,314 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2024-11-09 04:46:50,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 04:46:50,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:46:50,315 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:46:50,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/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)] Ended with exit code 0 [2024-11-09 04:46:50,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/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 04:46:50,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:46:50,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:46:50,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1018206070, now seen corresponding path program 1 times [2024-11-09 04:46:50,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:46:50,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270803371] [2024-11-09 04:46:50,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:46:50,518 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 04:46:50,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:46:50,522 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/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 04:46:50,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/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 04:46:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:46:51,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 04:46:51,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:46:52,969 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 04:46:52,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:46:52,972 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:46:52,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270803371] [2024-11-09 04:46:52,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270803371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:46:52,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:46:52,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:46:52,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789616048] [2024-11-09 04:46:52,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:46:52,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:46:52,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:46:52,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:46:52,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:46:52,981 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:46:55,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:46:57,584 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 04:46:59,593 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 04:47:01,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:47:04,188 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 04:47:06,194 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 04:47:08,203 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 04:47:11,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:47:13,160 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 04:47:15,170 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 04:47:18,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:47:20,026 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 04:47:22,033 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 04:47:23,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:47:23,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:47:23,978 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2024-11-09 04:47:23,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:47:23,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 04:47:23,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:47:23,980 INFO L225 Difference]: With dead ends: 21 [2024-11-09 04:47:23,980 INFO L226 Difference]: Without dead ends: 16 [2024-11-09 04:47:23,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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 04:47:23,982 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 16 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:47:23,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 17 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 13 Unknown, 0 Unchecked, 30.7s Time] [2024-11-09 04:47:23,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-09 04:47:23,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-09 04:47:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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 04:47:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2024-11-09 04:47:23,987 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 11 [2024-11-09 04:47:23,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:47:23,988 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2024-11-09 04:47:23,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:47:23,988 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2024-11-09 04:47:23,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 04:47:23,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:47:23,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:47:24,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/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 04:47:24,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/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 04:47:24,190 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:47:24,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:47:24,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1501753864, now seen corresponding path program 1 times [2024-11-09 04:47:24,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:47:24,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204700956] [2024-11-09 04:47:24,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:47:24,192 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 04:47:24,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:47:24,195 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/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 04:47:24,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/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 04:47:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:47:28,062 WARN L253 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 04:47:28,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:47:44,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)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 04:48:24,754 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse4)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (let ((.cse3 (fp.add c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (fp.gt (fp.mul c_currentRoundingMode .cse2 .cse3) (fp.mul c_currentRoundingMode .cse4 .cse3))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5)))) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv1 32))) (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse6 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= .cse6 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (not (let ((.cse7 (fp.add c_currentRoundingMode .cse6 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (fp.gt (fp.mul c_currentRoundingMode .cse2 .cse7) (fp.mul c_currentRoundingMode .cse4 .cse7))))))) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 04:48:44,061 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 ((.cse1 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (not (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse3 (fp.add c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse2) .cse3) (fp.mul c_currentRoundingMode .cse2 .cse3)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 04:49:04,406 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 ((.cse1 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp.div c_currentRoundingMode .cse0 .cse1) |c_ULTIMATE.start_SqrtR_#res#1|) (not (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse3 (fp.add c_currentRoundingMode .cse1 .cse1))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse2) .cse3) (fp.mul c_currentRoundingMode .cse2 .cse3)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 04:50:14,430 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse2)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven .cse5 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (let ((.cse1 (fp.add roundNearestTiesToEven .cse3 .cse3))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse2 .cse1)))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (not (fp.geq (fp.div roundNearestTiesToEven .cse5 .cse3) .cse6)) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse8 (fp.div roundNearestTiesToEven .cse5 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (let ((.cse7 (fp.add roundNearestTiesToEven .cse8 .cse8))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse7) (fp.mul roundNearestTiesToEven .cse2 .cse7)))) (not (fp.leq (fp.div roundNearestTiesToEven .cse5 .cse8) .cse9)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5))))))) (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse11 (fp.div roundNearestTiesToEven .cse5 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse12 (fp.div roundNearestTiesToEven .cse5 .cse11))) (and (not (let ((.cse10 (fp.add roundNearestTiesToEven .cse11 .cse11))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse10) (fp.mul roundNearestTiesToEven .cse2 .cse10)))) (fp.geq .cse12 .cse6) (fp.leq .cse12 .cse9) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)))))) is different from false [2024-11-09 04:50:57,036 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse2)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven .cse5 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (let ((.cse1 (fp.add roundNearestTiesToEven .cse3 .cse3))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse2 .cse1)))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (not (fp.geq (fp.div roundNearestTiesToEven .cse5 .cse3) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse7 (fp.div roundNearestTiesToEven .cse5 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (let ((.cse6 (fp.add roundNearestTiesToEven .cse7 .cse7))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse6) (fp.mul roundNearestTiesToEven .cse2 .cse6)))) (not (fp.leq (fp.div roundNearestTiesToEven .cse5 .cse7) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5)))))))) is different from false [2024-11-09 04:50:59,154 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse2)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven .cse5 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (let ((.cse1 (fp.add roundNearestTiesToEven .cse3 .cse3))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse2 .cse1)))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (not (fp.geq (fp.div roundNearestTiesToEven .cse5 .cse3) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse7 (fp.div roundNearestTiesToEven .cse5 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (let ((.cse6 (fp.add roundNearestTiesToEven .cse7 .cse7))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse6) (fp.mul roundNearestTiesToEven .cse2 .cse6)))) (not (fp.leq (fp.div roundNearestTiesToEven .cse5 .cse7) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5)))))))) is different from true [2024-11-09 04:50:59,155 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 04:50:59,156 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:50:59,156 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:50:59,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204700956] [2024-11-09 04:50:59,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204700956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:50:59,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:50:59,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 04:50:59,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293255319] [2024-11-09 04:50:59,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:50:59,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 04:50:59,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:50:59,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 04:50:59,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=23, Unknown=7, NotChecked=78, Total=132 [2024-11-09 04:50:59,160 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 12 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:51:01,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:51:04,195 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (and (fp.geq |c_ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10.0))) (fp.leq |c_ULTIMATE.start_SqrtR_~Input#1| .cse0) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse1)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0) (= |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.div c_currentRoundingMode .cse1 |ULTIMATE.start_SqrtR_~Input#1|))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-09 04:51:06,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:51:08,372 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 04:51:10,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 04:51:13,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:51:15,044 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 04:51:17,051 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 04:51:19,059 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 04:51:21,067 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 04:51:23,069 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 04:51:25,077 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 04:51:27,478 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 04:51:29,494 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 04:51:31,502 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 04:51:33,509 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 04:51:36,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:51:37,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:51:37,011 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-11-09 04:51:37,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 04:51:37,013 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 04:51:37,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:51:37,014 INFO L225 Difference]: With dead ends: 29 [2024-11-09 04:51:37,014 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 04:51:37,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=26, Invalid=24, Unknown=8, NotChecked=98, Total=156 [2024-11-09 04:51:37,016 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 35.6s IncrementalHoareTripleChecker+Time [2024-11-09 04:51:37,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 56 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 15 Unknown, 174 Unchecked, 35.6s Time] [2024-11-09 04:51:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 04:51:37,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2024-11-09 04:51:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 04:51:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-09 04:51:37,027 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2024-11-09 04:51:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:51:37,028 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-09 04:51:37,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:51:37,029 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-09 04:51:37,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 04:51:37,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:51:37,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:51:37,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/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 04:51:37,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/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 04:51:37,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:51:37,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:51:37,231 INFO L85 PathProgramCache]: Analyzing trace with hash 484262798, now seen corresponding path program 1 times [2024-11-09 04:51:37,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:51:37,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683493069] [2024-11-09 04:51:37,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:51:37,231 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 04:51:37,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:51:37,235 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/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 04:51:37,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/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 04:51:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:51:39,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 04:51:39,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:51:39,454 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 04:51:39,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:51:39,454 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 04:51:39,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683493069] [2024-11-09 04:51:39,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683493069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:51:39,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:51:39,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:51:39,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467218141] [2024-11-09 04:51:39,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:51:39,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:51:39,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 04:51:39,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:51:39,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:51:39,457 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:51:41,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:51:44,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 04:51:46,582 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 04:51:48,851 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 04:51:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:51:48,852 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2024-11-09 04:51:48,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:51:48,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 04:51:48,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:51:48,855 INFO L225 Difference]: With dead ends: 22 [2024-11-09 04:51:48,855 INFO L226 Difference]: Without dead ends: 17 [2024-11-09 04:51:48,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:51:48,856 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:51:48,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 4 Unknown, 0 Unchecked, 9.4s Time] [2024-11-09 04:51:48,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-09 04:51:48,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2024-11-09 04:51:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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 04:51:48,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-11-09 04:51:48,864 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2024-11-09 04:51:48,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:51:48,864 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-11-09 04:51:48,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:51:48,865 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-11-09 04:51:48,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 04:51:48,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:51:48,866 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:51:48,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/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)] Forceful destruction successful, exit code 0 [2024-11-09 04:51:49,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/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 04:51:49,067 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 04:51:49,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:51:49,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1502535249, now seen corresponding path program 1 times [2024-11-09 04:51:49,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 04:51:49,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802491965] [2024-11-09 04:51:49,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:51:49,068 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 04:51:49,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 04:51:49,071 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/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 04:51:49,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/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 (6)] Waiting until timeout for monitored process [2024-11-09 04:51:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:51:57,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 04:51:57,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:52:44,863 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.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|) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10.0))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-09 04:52:46,899 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.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|) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10.0))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-09 04:53:14,783 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.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|) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10.0))))) (not (fp.lt .cse0 (fp.neg .cse1))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-09 04:53:17,050 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.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|) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10.0))))) (not (fp.lt .cse0 (fp.neg .cse1))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-09 04:53:26,987 WARN L286 SmtUtils]: Spent 5.03s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 04:53:32,029 WARN L286 SmtUtils]: Spent 5.04s 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 04:53:44,197 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))) (not (fp.gt .cse1 .cse2)) (= (fp.div c_currentRoundingMode .cse0 .cse3) |c_ULTIMATE.start_SqrtR_#res#1|) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10.0)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 04:54:13,227 WARN L286 SmtUtils]: Spent 5.03s 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 04:54:25,294 WARN L286 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 04:55:14,440 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse9 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse11 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2) (fp.add roundNearestTiesToEven .cse9 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 |ULTIMATE.start_SqrtR_~Input#1|) .cse2) .cse2))))) .cse11))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse3 .cse2))) (.cse1 (fp.mul roundNearestTiesToEven .cse6 (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) .cse4)) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse14 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2) (fp.add roundNearestTiesToEven .cse9 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 |ULTIMATE.start_SqrtR_~Input#1|) .cse2) .cse2))))) .cse11))) (let ((.cse12 (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse14 .cse2))) (.cse13 (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven .cse14 .cse14)))) (and (not (fp.gt .cse12 .cse13)) (not (fp.lt .cse12 (fp.neg .cse13))) (not (fp.geq (fp.div roundNearestTiesToEven .cse2 .cse14) .cse15)) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2))))))) (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse19 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2) (fp.add roundNearestTiesToEven .cse9 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 |ULTIMATE.start_SqrtR_~Input#1|) .cse2) .cse2))))) .cse11))) (let ((.cse16 (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse19 .cse2))) (.cse17 (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven .cse19 .cse19))) (.cse18 (fp.div roundNearestTiesToEven .cse2 .cse19))) (and (not (fp.gt .cse16 .cse17)) (not (fp.lt .cse16 (fp.neg .cse17))) (fp.geq .cse18 .cse15) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (fp.leq .cse18 .cse4) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))))) is different from false [2024-11-09 04:56:10,058 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10.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)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.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 (/ 3.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 04:56:12,213 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10.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)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.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 (/ 3.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 04:56:12,214 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 04:56:12,214 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:56:24,279 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.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 10.0))))) is different from false [2024-11-09 04:56:26,358 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.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 10.0))))) is different from true [2024-11-09 04:56:41,122 WARN L851 $PredicateComparison]: unable to prove that (or (not (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 10.0)))))) is different from false [2024-11-09 04:56:43,208 WARN L873 $PredicateComparison]: unable to prove that (or (not (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32))) (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 10.0)))))) is different from true [2024-11-09 04:56:48,556 WARN L286 SmtUtils]: Spent 5.34s 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 04:56:53,873 WARN L286 SmtUtils]: Spent 5.32s 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 04:56:59,060 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 04:57:04,519 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 04:57:06,867 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)) (fp.gt .cse0 .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 (/ 3.0 10.0))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))))) is different from false [2024-11-09 04:57:09,220 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)) (fp.gt .cse0 .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 (/ 3.0 10.0))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))))) is different from true [2024-11-09 04:57:14,464 WARN L286 SmtUtils]: Spent 5.24s 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 04:57:19,642 WARN L286 SmtUtils]: Spent 5.18s 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 04:57:24,787 WARN L286 SmtUtils]: Spent 5.14s 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 04:57:30,096 WARN L286 SmtUtils]: Spent 5.31s 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 04:57:35,258 WARN L286 SmtUtils]: Spent 5.16s 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 04:57:40,446 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 04:57:45,569 WARN L286 SmtUtils]: Spent 5.12s 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 04:57:50,852 WARN L286 SmtUtils]: Spent 5.28s 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 04:58:17,628 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (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| .cse3) .cse3) (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|) .cse3) .cse3))))) ((_ 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 .cse4 .cse3))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse4 .cse4)))) (or (fp.lt .cse0 (fp.neg .cse1)) (let ((.cse2 (fp.div c_currentRoundingMode .cse3 .cse4))) (and (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 10.0))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 5.0)))) (fp.gt .cse0 .cse1) (not (fp.leq |c_ULTIMATE.start_SqrtR_~Input#1| .cse3)))))) is different from false [2024-11-09 04:58:19,854 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (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| .cse3) .cse3) (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|) .cse3) .cse3))))) ((_ 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 .cse4 .cse3))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse4 .cse4)))) (or (fp.lt .cse0 (fp.neg .cse1)) (let ((.cse2 (fp.div c_currentRoundingMode .cse3 .cse4))) (and (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 10.0))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 5.0)))) (fp.gt .cse0 .cse1) (not (fp.leq |c_ULTIMATE.start_SqrtR_~Input#1| .cse3)))))) is different from true [2024-11-09 04:58:44,745 WARN L286 SmtUtils]: Spent 5.18s 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 04:58:46,990 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_~d~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_~d~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_~d~0#1| .cse0)) (fp.gt .cse1 .cse2) (fp.lt .cse1 (fp.neg .cse2)) (let ((.cse3 (fp.div c_currentRoundingMode .cse0 .cse4))) (and (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 10.0))))))))) is different from false [2024-11-09 04:58:49,226 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_~d~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_~d~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_~d~0#1| .cse0)) (fp.gt .cse1 .cse2) (fp.lt .cse1 (fp.neg .cse2)) (let ((.cse3 (fp.div c_currentRoundingMode .cse0 .cse4))) (and (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 10.0))))))))) is different from true [2024-11-09 04:59:20,906 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_~d~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_~d~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_~d~0#1| .cse0)) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (fp.gt .cse1 .cse2) (fp.lt .cse1 (fp.neg .cse2)) (let ((.cse3 (fp.div c_currentRoundingMode .cse0 .cse4))) (and (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 10.0))))))))) is different from false [2024-11-09 04:59:23,185 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_~d~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_~d~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_~d~0#1| .cse0)) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (fp.gt .cse1 .cse2) (fp.lt .cse1 (fp.neg .cse2)) (let ((.cse3 (fp.div c_currentRoundingMode .cse0 .cse4))) (and (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 10.0))))))))) is different from true [2024-11-09 04:59:33,243 WARN L286 SmtUtils]: Spent 5.07s 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 04:59:44,195 WARN L286 SmtUtils]: Spent 5.14s 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 04:59:49,420 WARN L286 SmtUtils]: Spent 5.22s 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 04:59:54,566 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 05:00:17,012 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10.0))) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode 15.0)) (.cse7 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse9 ((_ to_fp 11 53) c_currentRoundingMode 8.0))) (and (forall ((|v_ULTIMATE.start_main_~d~0#1_8| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode .cse6 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~d~0#1_8| .cse0) .cse0) (fp.add c_currentRoundingMode .cse7 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 |v_ULTIMATE.start_main_~d~0#1_8|) .cse0) .cse0))))) .cse9))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse5 (fp.sub c_currentRoundingMode .cse1 .cse0))) (.cse4 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse1 .cse1)))) (or (fp.geq (fp.div c_currentRoundingMode .cse0 .cse1) ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 10.0))) (not (fp.geq |v_ULTIMATE.start_main_~d~0#1_8| .cse2)) (fp.lt .cse3 (fp.neg .cse4)) (fp.gt .cse3 .cse4) (not (fp.leq |v_ULTIMATE.start_main_~d~0#1_8| .cse0)))))) (forall ((|v_ULTIMATE.start_main_~d~0#1_8| (_ FloatingPoint 11 53))) (let ((.cse10 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode .cse6 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~d~0#1_8| .cse0) .cse0) (fp.add c_currentRoundingMode .cse7 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 |v_ULTIMATE.start_main_~d~0#1_8|) .cse0) .cse0))))) .cse9))) (let ((.cse11 (fp.mul c_currentRoundingMode .cse5 (fp.sub c_currentRoundingMode .cse10 .cse0))) (.cse12 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse10 .cse10)))) (or (not (fp.geq |v_ULTIMATE.start_main_~d~0#1_8| .cse2)) (fp.leq (fp.div c_currentRoundingMode .cse0 .cse10) ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.lt .cse11 (fp.neg .cse12)) (fp.gt .cse11 .cse12) (not (fp.leq |v_ULTIMATE.start_main_~d~0#1_8| .cse0)))))))) is different from false [2024-11-09 05:00:19,472 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10.0))) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode 15.0)) (.cse7 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse9 ((_ to_fp 11 53) c_currentRoundingMode 8.0))) (and (forall ((|v_ULTIMATE.start_main_~d~0#1_8| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode .cse6 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~d~0#1_8| .cse0) .cse0) (fp.add c_currentRoundingMode .cse7 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 |v_ULTIMATE.start_main_~d~0#1_8|) .cse0) .cse0))))) .cse9))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse5 (fp.sub c_currentRoundingMode .cse1 .cse0))) (.cse4 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse1 .cse1)))) (or (fp.geq (fp.div c_currentRoundingMode .cse0 .cse1) ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 10.0))) (not (fp.geq |v_ULTIMATE.start_main_~d~0#1_8| .cse2)) (fp.lt .cse3 (fp.neg .cse4)) (fp.gt .cse3 .cse4) (not (fp.leq |v_ULTIMATE.start_main_~d~0#1_8| .cse0)))))) (forall ((|v_ULTIMATE.start_main_~d~0#1_8| (_ FloatingPoint 11 53))) (let ((.cse10 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode .cse6 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~d~0#1_8| .cse0) .cse0) (fp.add c_currentRoundingMode .cse7 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse8 |v_ULTIMATE.start_main_~d~0#1_8|) .cse0) .cse0))))) .cse9))) (let ((.cse11 (fp.mul c_currentRoundingMode .cse5 (fp.sub c_currentRoundingMode .cse10 .cse0))) (.cse12 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse10 .cse10)))) (or (not (fp.geq |v_ULTIMATE.start_main_~d~0#1_8| .cse2)) (fp.leq (fp.div c_currentRoundingMode .cse0 .cse10) ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.lt .cse11 (fp.neg .cse12)) (fp.gt .cse11 .cse12) (not (fp.leq |v_ULTIMATE.start_main_~d~0#1_8| .cse0)))))))) is different from true [2024-11-09 05:00:19,472 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 05:00:19,473 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:00:19,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802491965] [2024-11-09 05:00:19,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802491965] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 05:00:19,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [833232943] [2024-11-09 05:00:19,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:00:19,473 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:00:19,474 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:00:19,475 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:00:19,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5a79b65b-d8dd-4d62-a807-696873a9fcac/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-09 05:00:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:00:30,778 WARN L253 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 05:00:30,780 INFO L278 TraceCheckSpWp]: Computing forward predicates...