./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/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_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/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_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/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 6126c292b79b2663ac597229a34ee56f0c149d9383459c587f75b8bcd2abff05 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 07:26:44,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:26:44,514 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 07:26:44,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:26:44,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:26:44,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:26:44,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:26:44,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:26:44,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:26:44,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:26:44,580 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 07:26:44,580 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 07:26:44,581 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 07:26:44,581 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 07:26:44,582 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 07:26:44,585 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 07:26:44,586 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 07:26:44,586 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 07:26:44,586 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 07:26:44,587 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 07:26:44,587 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 07:26:44,588 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 07:26:44,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:26:44,591 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:26:44,592 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:26:44,592 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:26:44,592 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:26:44,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:26:44,603 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:26:44,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:26:44,604 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:26:44,604 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:26:44,604 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:26:44,605 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:26:44,605 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:26:44,605 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:26:44,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:26:44,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:26:44,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:26:44,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:26:44,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:26:44,608 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:26:44,608 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 07:26:44,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:26:44,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:26:44,610 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 07:26:44,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:26:44,611 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_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/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_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/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 -> 6126c292b79b2663ac597229a34ee56f0c149d9383459c587f75b8bcd2abff05 [2024-11-09 07:26:44,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:26:44,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:26:44,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:26:44,948 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:26:44,949 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:26:44,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c Unable to find full path for "g++" [2024-11-09 07:26:47,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:26:47,224 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:26:47,224 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c [2024-11-09 07:26:47,232 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/data/898b9d3c0/173bbf1c1e7c4f0285938cc8d5e0b4db/FLAGbe7532c66 [2024-11-09 07:26:47,249 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/data/898b9d3c0/173bbf1c1e7c4f0285938cc8d5e0b4db [2024-11-09 07:26:47,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:26:47,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:26:47,255 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:26:47,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:26:47,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:26:47,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:26:47" (1/1) ... [2024-11-09 07:26:47,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d124219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:47, skipping insertion in model container [2024-11-09 07:26:47,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:26:47" (1/1) ... [2024-11-09 07:26:47,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:26:47,482 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_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c[557,570] [2024-11-09 07:26:47,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:26:47,517 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:26:47,533 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_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c[557,570] [2024-11-09 07:26:47,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:26:47,559 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:26:47,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:47 WrapperNode [2024-11-09 07:26:47,559 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:26:47,560 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:26:47,560 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:26:47,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:26:47,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:47" (1/1) ... [2024-11-09 07:26:47,574 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:47" (1/1) ... [2024-11-09 07:26:47,593 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 71 [2024-11-09 07:26:47,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:26:47,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:26:47,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:26:47,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:26:47,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:47" (1/1) ... [2024-11-09 07:26:47,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:47" (1/1) ... [2024-11-09 07:26:47,606 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:47" (1/1) ... [2024-11-09 07:26:47,607 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:47" (1/1) ... [2024-11-09 07:26:47,611 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:47" (1/1) ... [2024-11-09 07:26:47,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:47" (1/1) ... [2024-11-09 07:26:47,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:47" (1/1) ... [2024-11-09 07:26:47,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:47" (1/1) ... [2024-11-09 07:26:47,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:26:47,620 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:26:47,620 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:26:47,620 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:26:47,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:47" (1/1) ... [2024-11-09 07:26:47,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:26:47,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:26:47,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 07:26:47,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 07:26:47,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:26:47,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:26:47,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:26:47,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:26:47,753 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:26:47,756 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:26:47,910 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-09 07:26:47,910 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:26:47,964 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:26:47,964 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 07:26:47,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:26:47 BoogieIcfgContainer [2024-11-09 07:26:47,965 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:26:47,967 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:26:47,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:26:47,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:26:47,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:26:47" (1/3) ... [2024-11-09 07:26:47,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218bfcbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:26:47, skipping insertion in model container [2024-11-09 07:26:47,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:47" (2/3) ... [2024-11-09 07:26:47,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218bfcbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:26:47, skipping insertion in model container [2024-11-09 07:26:47,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:26:47" (3/3) ... [2024-11-09 07:26:47,975 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Newton_pseudoconstant.c [2024-11-09 07:26:47,994 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:26:47,995 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 07:26:48,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:26:48,062 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;@5aad9195, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:26:48,062 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 07:26:48,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:26:48,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:26:48,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:26:48,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:26:48,073 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:26:48,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:26:48,079 INFO L85 PathProgramCache]: Analyzing trace with hash 281664915, now seen corresponding path program 1 times [2024-11-09 07:26:48,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:26:48,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500690410] [2024-11-09 07:26:48,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:26:48,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:26:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:26:48,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:26:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:26:48,241 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 07:26:48,243 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:26:48,245 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 07:26:48,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:26:48,251 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-09 07:26:48,274 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:26:48,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:26:48 BoogieIcfgContainer [2024-11-09 07:26:48,279 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:26:48,280 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:26:48,282 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:26:48,282 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:26:48,283 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:26:47" (3/4) ... [2024-11-09 07:26:48,287 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 07:26:48,288 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:26:48,289 INFO L158 Benchmark]: Toolchain (without parser) took 1035.88ms. Allocated memory is still 159.4MB. Free memory was 117.7MB in the beginning and 73.0MB in the end (delta: 44.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-09 07:26:48,291 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 159.4MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:26:48,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.88ms. Allocated memory is still 159.4MB. Free memory was 117.7MB in the beginning and 104.4MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 07:26:48,292 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.98ms. Allocated memory is still 159.4MB. Free memory was 104.4MB in the beginning and 103.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:26:48,293 INFO L158 Benchmark]: Boogie Preprocessor took 24.39ms. Allocated memory is still 159.4MB. Free memory was 103.0MB in the beginning and 101.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:26:48,294 INFO L158 Benchmark]: RCFGBuilder took 344.93ms. Allocated memory is still 159.4MB. Free memory was 101.6MB in the beginning and 89.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 07:26:48,295 INFO L158 Benchmark]: TraceAbstraction took 312.29ms. Allocated memory is still 159.4MB. Free memory was 88.3MB in the beginning and 73.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 07:26:48,296 INFO L158 Benchmark]: Witness Printer took 7.92ms. Allocated memory is still 159.4MB. Free memory was 73.7MB in the beginning and 73.0MB in the end (delta: 641.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:26:48,300 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.36ms. Allocated memory is still 159.4MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.88ms. Allocated memory is still 159.4MB. Free memory was 117.7MB in the beginning and 104.4MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.98ms. Allocated memory is still 159.4MB. Free memory was 104.4MB in the beginning and 103.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.39ms. Allocated memory is still 159.4MB. Free memory was 103.0MB in the beginning and 101.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 344.93ms. Allocated memory is still 159.4MB. Free memory was 101.6MB in the beginning and 89.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 312.29ms. Allocated memory is still 159.4MB. Free memory was 88.3MB in the beginning and 73.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 7.92ms. Allocated memory is still 159.4MB. Free memory was 73.7MB in the beginning and 73.0MB in the end (delta: 641.4kB). 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: 13]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 52, overapproximation of someBinaryArithmeticDOUBLEoperation at line 37, overapproximation of someUnaryDOUBLEoperation at line 25. Possible FailurePath: [L15] double _EPS = 1e-6; [L42] double d, dd, r; [L43] double epsilon = 1e-8; [L45] d = 1. VAL [_EPS=1/1000000] [L45] COND FALSE !(d <= 20.) VAL [_EPS=1/1000000] [L45] COND TRUE d <= 20. [L47] dd = __VERIFIER_nondet_double() [L48] CALL assume_abort_if_not(dd >= d-epsilon && dd <= d+epsilon) [L11] COND FALSE !(!cond) [L48] RET assume_abort_if_not(dd >= d-epsilon && dd <= d+epsilon) [L50] CALL, EXPR SqrtR(dd) [L19] double xn, xnp1, residu, lsup, linf; [L20] int i, cond; [L21] COND TRUE Input <= 1.0 [L21] xn = 1.0 [L22] xnp1 = xn [L23] residu = 2.0*_EPS*(xn+xnp1) [L24] lsup = _EPS * (xn+xnp1) [L25] linf = -lsup [L26] cond = ((residu > lsup) || (residu < linf)) [L27] i = 0 VAL [_EPS=1/1000000, cond=0, i=0] [L28] COND TRUE \read(cond) VAL [_EPS=1/1000000, i=0] [L37] return 1.0 / xnp1; [L50] RET, EXPR SqrtR(dd) [L50] r = SqrtR(dd) [L52] CALL __VERIFIER_assert(r >= 0.9 && r <= 5.) [L13] COND TRUE !(cond) VAL [_EPS=1/1000000] [L13] reach_error() VAL [_EPS=1/1000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.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=12occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 07:26:48,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/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_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/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_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/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 6126c292b79b2663ac597229a34ee56f0c149d9383459c587f75b8bcd2abff05 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 07:26:50,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:26:50,897 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 07:26:50,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:26:50,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:26:50,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:26:50,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:26:50,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:26:50,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:26:50,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:26:50,941 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 07:26:50,942 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 07:26:50,942 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 07:26:50,943 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 07:26:50,943 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 07:26:50,945 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 07:26:50,946 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:26:50,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:26:50,947 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:26:50,951 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:26:50,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:26:50,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:26:50,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:26:50,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:26:50,953 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:26:50,953 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:26:50,953 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:26:50,954 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:26:50,954 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:26:50,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:26:50,955 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:26:50,955 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:26:50,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:26:50,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:26:50,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:26:50,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:26:50,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:26:50,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:26:50,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:26:50,957 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 07:26:50,957 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:26:50,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:26:50,967 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 07:26:50,968 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_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/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_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/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 -> 6126c292b79b2663ac597229a34ee56f0c149d9383459c587f75b8bcd2abff05 [2024-11-09 07:26:51,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:26:51,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:26:51,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:26:51,381 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:26:51,381 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:26:51,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c Unable to find full path for "g++" [2024-11-09 07:26:53,610 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:26:53,882 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:26:53,883 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c [2024-11-09 07:26:53,897 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/data/f548ded88/0b48d9d877fd45f8b9a27695a183ae8e/FLAG3796372d7 [2024-11-09 07:26:53,921 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/data/f548ded88/0b48d9d877fd45f8b9a27695a183ae8e [2024-11-09 07:26:53,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:26:53,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:26:53,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:26:53,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:26:53,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:26:53,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:26:53" (1/1) ... [2024-11-09 07:26:53,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cd8c2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:53, skipping insertion in model container [2024-11-09 07:26:53,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:26:53" (1/1) ... [2024-11-09 07:26:53,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:26:54,140 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_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c[557,570] [2024-11-09 07:26:54,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:26:54,193 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:26:54,206 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_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c[557,570] [2024-11-09 07:26:54,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:26:54,234 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:26:54,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:54 WrapperNode [2024-11-09 07:26:54,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:26:54,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:26:54,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:26:54,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:26:54,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:54" (1/1) ... [2024-11-09 07:26:54,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:54" (1/1) ... [2024-11-09 07:26:54,288 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 72 [2024-11-09 07:26:54,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:26:54,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:26:54,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:26:54,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:26:54,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:54" (1/1) ... [2024-11-09 07:26:54,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:54" (1/1) ... [2024-11-09 07:26:54,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:54" (1/1) ... [2024-11-09 07:26:54,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:54" (1/1) ... [2024-11-09 07:26:54,317 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:54" (1/1) ... [2024-11-09 07:26:54,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:54" (1/1) ... [2024-11-09 07:26:54,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:54" (1/1) ... [2024-11-09 07:26:54,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:54" (1/1) ... [2024-11-09 07:26:54,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:26:54,327 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:26:54,328 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:26:54,328 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:26:54,329 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:54" (1/1) ... [2024-11-09 07:26:54,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:26:54,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:26:54,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 07:26:54,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 07:26:54,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:26:54,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 07:26:54,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:26:54,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:26:54,549 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:26:54,551 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:27:03,661 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-09 07:27:03,661 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:27:03,676 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:27:03,677 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 07:27:03,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:27:03 BoogieIcfgContainer [2024-11-09 07:27:03,677 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:27:03,680 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:27:03,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:27:03,684 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:27:03,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:26:53" (1/3) ... [2024-11-09 07:27:03,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e11ffe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:27:03, skipping insertion in model container [2024-11-09 07:27:03,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:26:54" (2/3) ... [2024-11-09 07:27:03,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e11ffe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:27:03, skipping insertion in model container [2024-11-09 07:27:03,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:27:03" (3/3) ... [2024-11-09 07:27:03,689 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Newton_pseudoconstant.c [2024-11-09 07:27:03,707 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:27:03,708 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 07:27:03,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:27:03,780 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;@7e55e7cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:27:03,781 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 07:27:03,788 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:27:03,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:27:03,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:27:03,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:27:03,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:27:03,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:27:03,803 INFO L85 PathProgramCache]: Analyzing trace with hash 58354842, now seen corresponding path program 1 times [2024-11-09 07:27:03,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:27:03,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261537259] [2024-11-09 07:27:03,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:03,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:27:03,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:27:03,823 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:27:03,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/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 07:27:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:05,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 07:27:05,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:27:06,318 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 07:27:06,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:27:06,320 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:27:06,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261537259] [2024-11-09 07:27:06,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261537259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:27:06,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:27:06,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:27:06,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221600397] [2024-11-09 07:27:06,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:27:06,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:27:06,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:27:06,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:27:06,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:27:06,362 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:27:09,782 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 07:27:11,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:27:13,550 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 07:27:15,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:27:18,072 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 07:27:20,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:27:22,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:27:24,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:27:26,534 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 07:27:28,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:27:30,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:27:32,925 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 07:27:34,939 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 07:27:37,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:27:39,326 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 07:27:41,333 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 07:27:43,479 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 07:27:45,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:27:45,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:27:45,694 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2024-11-09 07:27:45,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:27:45,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 07:27:45,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:27:45,713 INFO L225 Difference]: With dead ends: 41 [2024-11-09 07:27:45,713 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 07:27:45,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:27:45,722 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:27:45,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 29 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 17 Unknown, 0 Unchecked, 39.1s Time] [2024-11-09 07:27:45,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 07:27:45,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-09 07:27:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:27:45,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-09 07:27:45,769 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2024-11-09 07:27:45,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:27:45,770 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-09 07:27:45,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:27:45,771 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-11-09 07:27:45,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:27:45,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:27:45,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:27:45,809 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/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 07:27:45,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:27:45,973 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:27:45,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:27:45,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1833362204, now seen corresponding path program 1 times [2024-11-09 07:27:45,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:27:45,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740444668] [2024-11-09 07:27:45,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:27:45,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:27:45,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:27:45,980 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:27:45,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/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 07:27:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:27:48,948 WARN L253 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 07:27:48,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:28:32,216 WARN L286 SmtUtils]: Spent 11.35s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 07:29:26,338 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)))) (let ((.cse6 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse3)) (.cse5 (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0))))) (or (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse4 (fp.add c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse6 .cse4))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (not (fp.gt .cse2 (fp.mul c_currentRoundingMode .cse3 .cse4))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (not (fp.lt .cse2 |v_ULTIMATE.start_SqrtR_~linf~0#1_11|))))))) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32))) (and (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse7 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= .cse7 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (exists ((|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode .cse6 (fp.add c_currentRoundingMode .cse7 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)) |v_ULTIMATE.start_SqrtR_~linf~0#1_11|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5)))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse8 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= .cse8 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (let ((.cse9 (fp.add c_currentRoundingMode .cse8 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (fp.gt (fp.mul c_currentRoundingMode .cse6 .cse9) (fp.mul c_currentRoundingMode .cse3 .cse9))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5))))) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv1 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 07:29:50,258 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse4 (fp.add c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (let ((.cse2 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse3) .cse4))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (not (fp.gt .cse2 (fp.mul c_currentRoundingMode .cse3 .cse4))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (not (fp.lt .cse2 |v_ULTIMATE.start_SqrtR_~linf~0#1_11|)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 07:30:15,085 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse4 (fp.add c_currentRoundingMode .cse2 .cse2))) (let ((.cse1 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse3) .cse4))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (not (fp.lt .cse1 |v_ULTIMATE.start_SqrtR_~linf~0#1_11|)) (= (fp.div c_currentRoundingMode .cse0 .cse2) |c_ULTIMATE.start_SqrtR_#res#1|) (not (fp.gt .cse1 (fp.mul c_currentRoundingMode .cse3 .cse4))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 07:30:17,187 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse4 (fp.add c_currentRoundingMode .cse2 .cse2))) (let ((.cse1 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse3) .cse4))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (not (fp.lt .cse1 |v_ULTIMATE.start_SqrtR_~linf~0#1_11|)) (= (fp.div c_currentRoundingMode .cse0 .cse2) |c_ULTIMATE.start_SqrtR_#res#1|) (not (fp.gt .cse1 (fp.mul c_currentRoundingMode .cse3 .cse4))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-09 07:31:42,053 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse5 (fp.add roundNearestTiesToEven .cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (.cse9 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse1))) (or (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse8 (fp.div roundNearestTiesToEven .cse6 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse2 (fp.add roundNearestTiesToEven .cse8 .cse8))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse9 .cse2)) (.cse3 (fp.div roundNearestTiesToEven .cse6 .cse8))) (and (not (fp.gt .cse0 (fp.mul roundNearestTiesToEven .cse1 .cse2))) (fp.leq .cse3 .cse4) (not (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_11|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse6)) (fp.geq .cse3 .cse7)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse12 (fp.div roundNearestTiesToEven .cse6 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse11 (fp.add roundNearestTiesToEven .cse12 .cse12))) (let ((.cse10 (fp.mul roundNearestTiesToEven .cse9 .cse11))) (and (not (fp.gt .cse10 (fp.mul roundNearestTiesToEven .cse1 .cse11))) (not (fp.lt .cse10 |v_ULTIMATE.start_SqrtR_~linf~0#1_11|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (not (fp.geq (fp.div roundNearestTiesToEven .cse6 .cse12) .cse7)) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse6))))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse15 (fp.div roundNearestTiesToEven .cse6 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse14 (fp.add roundNearestTiesToEven .cse15 .cse15))) (let ((.cse13 (fp.mul roundNearestTiesToEven .cse9 .cse14))) (and (not (fp.gt .cse13 (fp.mul roundNearestTiesToEven .cse1 .cse14))) (not (fp.leq (fp.div roundNearestTiesToEven .cse6 .cse15) .cse4)) (not (fp.lt .cse13 |v_ULTIMATE.start_SqrtR_~linf~0#1_11|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse6)))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))))) is different from false [2024-11-09 07:32:35,535 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.add roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (.cse6 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse1))) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse5 (fp.div roundNearestTiesToEven .cse4 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse2 (fp.add roundNearestTiesToEven .cse5 .cse5))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse6 .cse2))) (and (not (fp.gt .cse0 (fp.mul roundNearestTiesToEven .cse1 .cse2))) (not (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_11|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse3) (not (fp.geq (fp.div roundNearestTiesToEven .cse4 .cse5) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4))))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse9 (fp.div roundNearestTiesToEven .cse4 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse8 (fp.add roundNearestTiesToEven .cse9 .cse9))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse6 .cse8))) (and (not (fp.gt .cse7 (fp.mul roundNearestTiesToEven .cse1 .cse8))) (not (fp.leq (fp.div roundNearestTiesToEven .cse4 .cse9) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (not (fp.lt .cse7 |v_ULTIMATE.start_SqrtR_~linf~0#1_11|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse3) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4)))))))))) is different from false [2024-11-09 07:32:37,675 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.add roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (.cse6 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse1))) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse5 (fp.div roundNearestTiesToEven .cse4 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse2 (fp.add roundNearestTiesToEven .cse5 .cse5))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse6 .cse2))) (and (not (fp.gt .cse0 (fp.mul roundNearestTiesToEven .cse1 .cse2))) (not (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_11|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse3) (not (fp.geq (fp.div roundNearestTiesToEven .cse4 .cse5) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4))))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_SqrtR_~linf~0#1_11| (_ FloatingPoint 11 53))) (let ((.cse9 (fp.div roundNearestTiesToEven .cse4 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse8 (fp.add roundNearestTiesToEven .cse9 .cse9))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse6 .cse8))) (and (not (fp.gt .cse7 (fp.mul roundNearestTiesToEven .cse1 .cse8))) (not (fp.leq (fp.div roundNearestTiesToEven .cse4 .cse9) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (not (fp.lt .cse7 |v_ULTIMATE.start_SqrtR_~linf~0#1_11|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse3) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4)))))))))) is different from true [2024-11-09 07:32:37,676 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 07:32:37,677 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:32:37,677 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:32:37,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740444668] [2024-11-09 07:32:37,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740444668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:32:37,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:32:37,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:32:37,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892841946] [2024-11-09 07:32:37,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:37,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 07:32:37,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:32:37,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 07:32:37,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=39, Unknown=9, NotChecked=80, Total=156 [2024-11-09 07:32:37,682 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:32:39,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:32:41,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:32:44,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:32:46,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:32:53,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:33:01,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:33:08,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:33:11,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:33:13,233 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 07:33:15,239 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 07:33:17,460 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (let ((.cse2 (fp.add c_currentRoundingMode .cse1 .cse0))) (and (= .cse0 |c_ULTIMATE.start_main_~epsilon~0#1|) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (fp.geq |c_ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse1 .cse0)) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse1)) (= |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.div c_currentRoundingMode .cse1 |ULTIMATE.start_SqrtR_~Input#1|)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2))) (= .cse1 |c_ULTIMATE.start_main_~d~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq |c_ULTIMATE.start_SqrtR_~Input#1| .cse2)))) is different from false [2024-11-09 07:33:19,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:33:21,718 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 07:33:23,721 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 [0] [2024-11-09 07:33:25,727 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 07:33:26,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:33:29,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.47s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:33:31,472 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 07:33:33,480 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 [0] [2024-11-09 07:33:35,486 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 07:33:37,503 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 07:33:39,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:33:41,513 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 07:33:43,524 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 [0] [2024-11-09 07:33:45,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:33:47,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:33:49,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:33:51,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:33:53,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:33:55,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:33:57,997 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 [0] [2024-11-09 07:34:00,014 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 07:34:01,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:34:03,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:34:05,933 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 07:34:07,941 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 [0] [2024-11-09 07:34:09,947 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 07:34:12,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:34:15,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:34:17,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:34:20,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:34:22,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:34:24,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:34:26,942 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 07:34:28,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:34:31,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:34:33,927 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 07:34:35,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:34:37,933 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 [0] [2024-11-09 07:34:39,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:34:41,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:34:44,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:34:46,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:34:48,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:34:50,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:34:52,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:34:54,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:34:56,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:34:58,644 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 [0] [2024-11-09 07:35:00,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:35:02,662 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 07:35:05,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:35:07,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:35:09,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:35:11,248 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 [0] [2024-11-09 07:35:13,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:35:15,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:35:17,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:35:19,604 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 07:35:21,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:35:23,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:35:25,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:35:26,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 07:35:26,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:35:26,988 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2024-11-09 07:35:26,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:35:26,989 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 07:35:26,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:35:26,990 INFO L225 Difference]: With dead ends: 59 [2024-11-09 07:35:26,990 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 07:35:26,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 61.6s TimeCoverageRelationStatistics Valid=45, Invalid=77, Unknown=12, NotChecked=138, Total=272 [2024-11-09 07:35:26,992 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 52 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 61 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 151.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 61 IncrementalHoareTripleChecker+Unknown, 319 IncrementalHoareTripleChecker+Unchecked, 152.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:35:26,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 87 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 61 Unknown, 319 Unchecked, 152.9s Time] [2024-11-09 07:35:26,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 07:35:27,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2024-11-09 07:35:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:35:27,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-09 07:35:27,003 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 13 [2024-11-09 07:35:27,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:35:27,004 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-09 07:35:27,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:35:27,004 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-09 07:35:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:35:27,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:35:27,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:35:27,060 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/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 07:35:27,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:35:27,206 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:35:27,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:35:27,207 INFO L85 PathProgramCache]: Analyzing trace with hash 793645811, now seen corresponding path program 1 times [2024-11-09 07:35:27,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:35:27,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347076496] [2024-11-09 07:35:27,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:35:27,208 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:35:27,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:35:27,210 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:35:27,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/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 07:35:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:35:29,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 07:35:29,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:35:30,030 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 07:35:30,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:35:30,030 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 07:35:30,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347076496] [2024-11-09 07:35:30,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347076496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:35:30,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:35:30,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:35:30,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735629385] [2024-11-09 07:35:30,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:35:30,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:35:30,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 07:35:30,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:35:30,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:35:30,032 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:35:32,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:35:35,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:35:37,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 07:35:37,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:35:37,248 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-11-09 07:35:37,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:35:37,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 07:35:37,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:35:37,250 INFO L225 Difference]: With dead ends: 46 [2024-11-09 07:35:37,250 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 07:35:37,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 07:35:37,252 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:35:37,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 3 Unknown, 0 Unchecked, 7.2s Time] [2024-11-09 07:35:37,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 07:35:37,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-09 07:35:37,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:35:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-09 07:35:37,263 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2024-11-09 07:35:37,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:35:37,264 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-09 07:35:37,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:35:37,265 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-09 07:35:37,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:35:37,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:35:37,266 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:35:37,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/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)] Forceful destruction successful, exit code 0 [2024-11-09 07:35:37,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:35:37,467 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 07:35:37,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:35:37,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1791493227, now seen corresponding path program 1 times [2024-11-09 07:35:37,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 07:35:37,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335017884] [2024-11-09 07:35:37,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:35:37,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:35:37,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 07:35:37,473 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:35:37,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8b3ea5a1-fa26-483c-8e6c-23af0fd3c20e/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 07:35:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:35:45,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 07:35:45,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:36:40,339 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (and (= (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse0) .cse0))) .cse1)) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| .cse0))) (.cse5 (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 ((.cse2 (fp.gt .cse4 .cse5)) (.cse3 (fp.lt .cse4 (fp.neg .cse5)))) (or (and (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv1 32)) (or .cse2 .cse3)) (and (not .cse2) (not .cse3) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-09 07:36:42,391 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (and (= (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse0) .cse0))) .cse1)) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| .cse0))) (.cse5 (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 ((.cse2 (fp.gt .cse4 .cse5)) (.cse3 (fp.lt .cse4 (fp.neg .cse5)))) (or (and (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv1 32)) (or .cse2 .cse3)) (and (not .cse2) (not .cse3) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32)))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-09 07:37:10,322 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| .cse0))) (.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|)))) (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (and (= (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse0) .cse0))) .cse1)) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))))) (not (fp.gt .cse2 .cse3)) (not (fp.lt .cse2 (fp.neg .cse3))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-09 07:37:12,381 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| .cse0))) (.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|)))) (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (and (= (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse0) .cse0))) .cse1)) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))))) (not (fp.gt .cse2 .cse3)) (not (fp.lt .cse2 (fp.neg .cse3))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-09 07:37:38,284 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)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse0) .cse0))) .cse4)))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse4 (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))) (= |c_ULTIMATE.start_SqrtR_#res#1| (fp.div c_currentRoundingMode .cse0 .cse3)) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (not (fp.gt .cse1 .cse2))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-09 07:39:04,696 WARN L286 SmtUtils]: Spent 6.23s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:39:07,465 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0))) (.cse12 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse5 (fp.sub roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse0) .cse0))) .cse7)))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse1 .cse0))) (.cse4 (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven .cse1 .cse1)))) (and (not (fp.geq (fp.div roundNearestTiesToEven .cse0 .cse1) .cse2)) (not (fp.gt .cse3 .cse4)) (not (fp.lt .cse3 (fp.neg .cse4))) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse11 (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse0) .cse0))) .cse7)))) (let ((.cse9 (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse11 .cse0))) (.cse10 (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven .cse11 .cse11)))) (and (not (fp.gt .cse9 .cse10)) (not (fp.leq (fp.div roundNearestTiesToEven .cse0 .cse11) .cse12)) (not (fp.lt .cse9 (fp.neg .cse10))) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0))))))) (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse16 (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse0) .cse0))) .cse7)))) (let ((.cse13 (fp.div roundNearestTiesToEven .cse0 .cse16)) (.cse14 (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse16 .cse0))) (.cse15 (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven .cse16 .cse16)))) (and (fp.geq .cse13 .cse2) (not (fp.gt .cse14 .cse15)) (fp.leq .cse13 .cse12) (not (fp.lt .cse14 (fp.neg .cse15))) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)))))) is different from false [2024-11-09 07:40:01,516 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse4 (fp.sub roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse0) .cse0))) .cse6)))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven .cse1 .cse0))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse1 .cse1)))) (and (not (fp.geq (fp.div roundNearestTiesToEven .cse0 .cse1) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (not (fp.gt .cse2 .cse3)) (not (fp.lt .cse2 (fp.neg .cse3))) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse10 (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse0) .cse0))) .cse6)))) (let ((.cse8 (fp.mul roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven .cse10 .cse0))) (.cse9 (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse10 .cse10)))) (and (not (fp.gt .cse8 .cse9)) (not (fp.leq (fp.div roundNearestTiesToEven .cse0 .cse10) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (not (fp.lt .cse8 (fp.neg .cse9))) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)))))))) is different from false [2024-11-09 07:40:03,682 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse4 (fp.sub roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse0) .cse0))) .cse6)))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven .cse1 .cse0))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse1 .cse1)))) (and (not (fp.geq (fp.div roundNearestTiesToEven .cse0 .cse1) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (not (fp.gt .cse2 .cse3)) (not (fp.lt .cse2 (fp.neg .cse3))) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse10 (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse0) .cse0))) .cse6)))) (let ((.cse8 (fp.mul roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven .cse10 .cse0))) (.cse9 (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven .cse10 .cse10)))) (and (not (fp.gt .cse8 .cse9)) (not (fp.leq (fp.div roundNearestTiesToEven .cse0 .cse10) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (not (fp.lt .cse8 (fp.neg .cse9))) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)))))))) is different from true [2024-11-09 07:40:03,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-09 07:40:03,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:40:15,841 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)))) is different from false [2024-11-09 07:40:18,003 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)))) is different from true [2024-11-09 07:40:34,792 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)))) (not (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32)))) is different from true [2024-11-09 07:40:39,809 WARN L286 SmtUtils]: Spent 5.00s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:40:44,902 WARN L286 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:40:49,906 WARN L286 SmtUtils]: Spent 5.00s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:40:54,959 WARN L286 SmtUtils]: Spent 5.05s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:40:57,232 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (let ((.cse3 (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (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|))) .cse4)))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse4 (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.gt .cse0 .cse1) (fp.lt .cse0 (fp.neg .cse1)) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse3))) (and (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 5.0)))))))) is different from false [2024-11-09 07:40:59,491 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (let ((.cse3 (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (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|))) .cse4)))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse4 (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.gt .cse0 .cse1) (fp.lt .cse0 (fp.neg .cse1)) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) .cse3))) (and (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 5.0)))))))) is different from true [2024-11-09 07:41:09,453 WARN L286 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:41:24,410 WARN L286 SmtUtils]: Spent 5.00s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:41:29,428 WARN L286 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:41:39,402 WARN L286 SmtUtils]: Spent 5.00s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 07:42:05,977 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (let ((.cse2 (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse1) .cse1))) .cse5)))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse5 (fp.sub c_currentRoundingMode .cse2 .cse1))) (.cse4 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse2 .cse2)))) (or (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))))) (fp.gt .cse3 .cse4) (fp.lt .cse3 (fp.neg .cse4)) (not (fp.leq |c_ULTIMATE.start_SqrtR_~Input#1| .cse1)))))) is different from false [2024-11-09 07:42:08,227 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (let ((.cse2 (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse1) .cse1))) .cse5)))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse5 (fp.sub c_currentRoundingMode .cse2 .cse1))) (.cse4 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse2 .cse2)))) (or (let ((.cse0 (fp.div c_currentRoundingMode .cse1 .cse2))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))))) (fp.gt .cse3 .cse4) (fp.lt .cse3 (fp.neg .cse4)) (not (fp.leq |c_ULTIMATE.start_SqrtR_~Input#1| .cse1)))))) is different from true