./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 736ab1a5e950f94d10703cde0979d12465a57eb1332dc067f0dbd06f88e9370a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:09:38,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:09:38,979 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:09:38,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:09:38,983 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:09:39,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:09:39,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:09:39,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:09:39,010 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:09:39,011 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:09:39,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:09:39,012 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:09:39,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:09:39,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:09:39,013 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:09:39,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:09:39,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:09:39,015 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:09:39,015 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:09:39,016 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:09:39,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:09:39,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:09:39,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:09:39,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:09:39,018 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:09:39,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:09:39,019 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:09:39,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:09:39,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:09:39,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:09:39,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:09:39,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:09:39,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:09:39,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:09:39,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:09:39,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:09:39,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:09:39,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:09:39,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:09:39,023 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:09:39,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:09:39,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:09:39,024 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/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_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 736ab1a5e950f94d10703cde0979d12465a57eb1332dc067f0dbd06f88e9370a [2023-11-29 00:09:39,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:09:39,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:09:39,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:09:39,274 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:09:39,275 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:09:39,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2023-11-29 00:09:42,015 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:09:42,191 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:09:42,191 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2023-11-29 00:09:42,197 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/data/601236efe/4180970ba0724f838bfbd1f5813f1d5c/FLAGe39427a0a [2023-11-29 00:09:42,208 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/data/601236efe/4180970ba0724f838bfbd1f5813f1d5c [2023-11-29 00:09:42,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:09:42,211 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:09:42,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:09:42,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:09:42,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:09:42,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:09:42" (1/1) ... [2023-11-29 00:09:42,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5420a02a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:42, skipping insertion in model container [2023-11-29 00:09:42,219 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:09:42" (1/1) ... [2023-11-29 00:09:42,240 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:09:42,384 WARN L240 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_93ed0f1e-19b0-47a3-a585-6ddfa6378888/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c[831,844] [2023-11-29 00:09:42,402 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:09:42,409 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:09:42,418 WARN L240 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_93ed0f1e-19b0-47a3-a585-6ddfa6378888/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c[831,844] [2023-11-29 00:09:42,426 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:09:42,438 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:09:42,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:42 WrapperNode [2023-11-29 00:09:42,439 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:09:42,440 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:09:42,440 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:09:42,440 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:09:42,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:42" (1/1) ... [2023-11-29 00:09:42,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:42" (1/1) ... [2023-11-29 00:09:42,467 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2023-11-29 00:09:42,467 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:09:42,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:09:42,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:09:42,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:09:42,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:42" (1/1) ... [2023-11-29 00:09:42,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:42" (1/1) ... [2023-11-29 00:09:42,477 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:42" (1/1) ... [2023-11-29 00:09:42,487 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 00:09:42,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:42" (1/1) ... [2023-11-29 00:09:42,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:42" (1/1) ... [2023-11-29 00:09:42,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:42" (1/1) ... [2023-11-29 00:09:42,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:42" (1/1) ... [2023-11-29 00:09:42,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:42" (1/1) ... [2023-11-29 00:09:42,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:42" (1/1) ... [2023-11-29 00:09:42,499 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:09:42,500 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:09:42,500 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:09:42,500 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:09:42,501 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:42" (1/1) ... [2023-11-29 00:09:42,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:09:42,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:09:42,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:09:42,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:09:42,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:09:42,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:09:42,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:09:42,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:09:42,624 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:09:42,627 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:09:42,738 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:09:42,764 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:09:42,764 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 00:09:42,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:09:42 BoogieIcfgContainer [2023-11-29 00:09:42,765 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:09:42,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:09:42,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:09:42,771 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:09:42,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:09:42" (1/3) ... [2023-11-29 00:09:42,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf070df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:09:42, skipping insertion in model container [2023-11-29 00:09:42,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:42" (2/3) ... [2023-11-29 00:09:42,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf070df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:09:42, skipping insertion in model container [2023-11-29 00:09:42,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:09:42" (3/3) ... [2023-11-29 00:09:42,774 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c [2023-11-29 00:09:42,789 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:09:42,789 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:09:42,829 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:09:42,835 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@6fc389dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:09:42,835 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:09:42,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:09:42,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 00:09:42,844 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:09:42,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:09:42,845 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:09:42,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:09:42,850 INFO L85 PathProgramCache]: Analyzing trace with hash 231581527, now seen corresponding path program 1 times [2023-11-29 00:09:42,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:09:42,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997419830] [2023-11-29 00:09:42,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:09:42,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:09:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:09:42,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 00:09:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 00:09:42,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 00:09:42,985 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 00:09:42,986 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 00:09:42,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:09:42,992 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-11-29 00:09:42,996 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 00:09:43,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 12:09:43 BoogieIcfgContainer [2023-11-29 00:09:43,014 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 00:09:43,015 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 00:09:43,015 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 00:09:43,015 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 00:09:43,015 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:09:42" (3/4) ... [2023-11-29 00:09:43,018 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 00:09:43,019 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 00:09:43,020 INFO L158 Benchmark]: Toolchain (without parser) took 808.72ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 102.0MB in the end (delta: 30.4MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2023-11-29 00:09:43,021 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 119.5MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:09:43,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.07ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 132.0MB in the end (delta: 307.6kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 00:09:43,022 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.75ms. Allocated memory is still 167.8MB. Free memory was 132.0MB in the beginning and 130.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:09:43,022 INFO L158 Benchmark]: Boogie Preprocessor took 31.27ms. Allocated memory is still 167.8MB. Free memory was 130.7MB in the beginning and 128.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 00:09:43,023 INFO L158 Benchmark]: RCFGBuilder took 265.27ms. Allocated memory is still 167.8MB. Free memory was 128.6MB in the beginning and 116.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 00:09:43,024 INFO L158 Benchmark]: TraceAbstraction took 245.39ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 102.0MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 00:09:43,024 INFO L158 Benchmark]: Witness Printer took 4.37ms. Allocated memory is still 167.8MB. Free memory was 102.0MB in the beginning and 102.0MB in the end (delta: 2.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 00:09:43,027 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.14ms. Allocated memory is still 119.5MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.07ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 132.0MB in the end (delta: 307.6kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.75ms. Allocated memory is still 167.8MB. Free memory was 132.0MB in the beginning and 130.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.27ms. Allocated memory is still 167.8MB. Free memory was 130.7MB in the beginning and 128.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 265.27ms. Allocated memory is still 167.8MB. Free memory was 128.6MB in the beginning and 116.6MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 245.39ms. Allocated memory is still 167.8MB. Free memory was 116.0MB in the beginning and 102.0MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 4.37ms. Allocated memory is still 167.8MB. Free memory was 102.0MB in the beginning and 102.0MB in the end (delta: 2.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 20]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someUnaryDOUBLEoperation at line 32, overapproximation of someBinaryArithmeticDOUBLEoperation at line 44. Possible FailurePath: [L22] double _EPS = 1e-6; [L49] double d, r; [L51] d = 1. VAL [_EPS=1/1000000, d=1] [L51] COND TRUE d <= 20. [L53] CALL, EXPR SqrtR(d) [L26] double xn, xnp1, residu, lsup, linf; [L27] int i, cond; VAL [Input=1, \old(Input)=1, _EPS=1/1000000] [L28] COND TRUE Input <= 1.0 [L28] xn = 1.0 VAL [Input=1, \old(Input)=1, _EPS=1/1000000, xn=1] [L29] xnp1 = xn [L30] residu = 2.0*_EPS*(xn+xnp1) [L31] lsup = _EPS * (xn+xnp1) [L32] linf = -lsup [L33] cond = ((residu > lsup) || (residu < linf)) [L34] i = 0 VAL [Input=1, \old(Input)=1, _EPS=1/1000000, cond=0, i=0, xn=1, xn=1] [L35] COND FALSE !(\read(cond)) VAL [Input=1, \old(Input)=1, _EPS=1/1000000, cond=0, i=0, xn=1, xn=1] [L44] return 1.0 / xnp1; [L53] RET, EXPR SqrtR(d) [L53] r = SqrtR(d) [L55] CALL __VERIFIER_assert(r >= 1.0 && r <= 5.0) [L20] COND TRUE !(cond) VAL [\old(cond)=0, _EPS=1/1000000, cond=0] [L20] reach_error() VAL [\old(cond)=0, _EPS=1/1000000, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 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, 8 NumberOfCodeBlocks, 8 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 [2023-11-29 00:09:43,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 736ab1a5e950f94d10703cde0979d12465a57eb1332dc067f0dbd06f88e9370a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:09:44,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:09:44,976 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 00:09:44,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:09:44,982 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:09:45,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:09:45,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:09:45,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:09:45,011 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:09:45,011 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:09:45,012 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:09:45,012 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:09:45,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:09:45,013 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:09:45,014 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:09:45,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:09:45,015 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:09:45,016 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:09:45,016 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:09:45,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:09:45,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:09:45,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:09:45,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:09:45,019 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 00:09:45,019 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 00:09:45,019 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 00:09:45,020 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:09:45,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:09:45,021 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:09:45,021 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:09:45,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:09:45,022 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:09:45,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:09:45,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:09:45,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:09:45,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:09:45,023 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:09:45,023 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 00:09:45,024 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 00:09:45,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:09:45,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:09:45,025 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:09:45,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:09:45,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:09:45,025 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 00:09:45,025 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/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_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 736ab1a5e950f94d10703cde0979d12465a57eb1332dc067f0dbd06f88e9370a [2023-11-29 00:09:45,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:09:45,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:09:45,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:09:45,357 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:09:45,358 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:09:45,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2023-11-29 00:09:48,165 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:09:48,330 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:09:48,331 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2023-11-29 00:09:48,339 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/data/8aa053326/95f6cebd54dd4c27ac90dd7aedcfce90/FLAG0cf90b488 [2023-11-29 00:09:48,378 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/data/8aa053326/95f6cebd54dd4c27ac90dd7aedcfce90 [2023-11-29 00:09:48,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:09:48,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:09:48,384 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:09:48,384 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:09:48,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:09:48,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:09:48" (1/1) ... [2023-11-29 00:09:48,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ef93cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:48, skipping insertion in model container [2023-11-29 00:09:48,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:09:48" (1/1) ... [2023-11-29 00:09:48,412 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:09:48,551 WARN L240 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_93ed0f1e-19b0-47a3-a585-6ddfa6378888/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c[831,844] [2023-11-29 00:09:48,568 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:09:48,582 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:09:48,592 WARN L240 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_93ed0f1e-19b0-47a3-a585-6ddfa6378888/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c[831,844] [2023-11-29 00:09:48,600 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:09:48,615 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:09:48,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:48 WrapperNode [2023-11-29 00:09:48,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:09:48,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:09:48,617 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:09:48,617 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:09:48,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:48" (1/1) ... [2023-11-29 00:09:48,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:48" (1/1) ... [2023-11-29 00:09:48,652 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2023-11-29 00:09:48,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:09:48,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:09:48,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:09:48,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:09:48,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:48" (1/1) ... [2023-11-29 00:09:48,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:48" (1/1) ... [2023-11-29 00:09:48,666 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:48" (1/1) ... [2023-11-29 00:09:48,676 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 00:09:48,677 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:48" (1/1) ... [2023-11-29 00:09:48,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:48" (1/1) ... [2023-11-29 00:09:48,684 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:48" (1/1) ... [2023-11-29 00:09:48,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:48" (1/1) ... [2023-11-29 00:09:48,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:48" (1/1) ... [2023-11-29 00:09:48,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:48" (1/1) ... [2023-11-29 00:09:48,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:09:48,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:09:48,695 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:09:48,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:09:48,696 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:48" (1/1) ... [2023-11-29 00:09:48,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:09:48,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:09:48,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:09:48,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:09:48,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:09:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 00:09:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:09:48,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:09:48,825 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:09:48,827 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:10:05,705 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:10:05,739 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:10:05,739 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 00:10:05,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:05 BoogieIcfgContainer [2023-11-29 00:10:05,740 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:10:05,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:10:05,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:10:05,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:10:05,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:09:48" (1/3) ... [2023-11-29 00:10:05,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218f21d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:10:05, skipping insertion in model container [2023-11-29 00:10:05,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:09:48" (2/3) ... [2023-11-29 00:10:05,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218f21d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:10:05, skipping insertion in model container [2023-11-29 00:10:05,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:05" (3/3) ... [2023-11-29 00:10:05,749 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c [2023-11-29 00:10:05,767 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:10:05,767 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:10:05,812 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:10:05,819 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@19ee8d2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:10:05,819 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:10:05,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:10:05,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 00:10:05,829 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:10:05,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:10:05,830 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:10:05,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:10:05,836 INFO L85 PathProgramCache]: Analyzing trace with hash 231581527, now seen corresponding path program 1 times [2023-11-29 00:10:05,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:10:05,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231819734] [2023-11-29 00:10:05,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:10:05,848 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 [2023-11-29 00:10:05,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:10:05,851 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:10:05,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:10:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:10:07,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 00:10:07,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:10:07,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:10:07,652 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:10:07,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:10:07,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231819734] [2023-11-29 00:10:07,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231819734] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:10:07,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:10:07,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:10:07,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141787885] [2023-11-29 00:10:07,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:10:07,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 00:10:07,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:10:07,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 00:10:07,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:10:07,691 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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) [2023-11-29 00:10:12,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.80s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:10:17,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.49s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:10:22,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:10:26,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:10:30,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:10:35,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:10:39,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:10:43,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:10:49,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:10:53,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:10:57,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:11:02,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:11:06,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:11:10,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:11:10,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:11:10,526 INFO L93 Difference]: Finished difference Result 25 states and 37 transitions. [2023-11-29 00:11:10,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:11:10,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2023-11-29 00:11:10,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:11:10,548 INFO L225 Difference]: With dead ends: 25 [2023-11-29 00:11:10,548 INFO L226 Difference]: Without dead ends: 12 [2023-11-29 00:11:10,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:11:10,554 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 61.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 62.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:11:10,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 11 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 14 Unknown, 0 Unchecked, 62.6s Time] [2023-11-29 00:11:10,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-11-29 00:11:10,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-11-29 00:11:10,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 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) [2023-11-29 00:11:10,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2023-11-29 00:11:10,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 8 [2023-11-29 00:11:10,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:11:10,576 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2023-11-29 00:11:10,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 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) [2023-11-29 00:11:10,577 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2023-11-29 00:11:10,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 00:11:10,577 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:11:10,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:11:10,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 00:11:10,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:11:10,778 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:11:10,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:10,779 INFO L85 PathProgramCache]: Analyzing trace with hash 288839829, now seen corresponding path program 1 times [2023-11-29 00:11:10,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:11:10,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609784047] [2023-11-29 00:11:10,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:10,779 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 [2023-11-29 00:11:10,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:11:10,780 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:11:10,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:11:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:12,587 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 00:11:12,588 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:11:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:11:12,765 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 00:11:12,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:11:12,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609784047] [2023-11-29 00:11:12,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609784047] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:11:12,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:11:12,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:11:12,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515242241] [2023-11-29 00:11:12,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:11:12,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:11:12,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:11:12,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:11:12,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:11:12,769 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2023-11-29 00:11:17,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:11:22,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:11:27,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:11:31,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:11:34,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:11:39,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.54s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:11:43,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:11:48,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:11:52,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:11:54,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:11:54,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:11:54,893 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2023-11-29 00:11:55,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 00:11:55,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2023-11-29 00:11:55,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:11:55,097 INFO L225 Difference]: With dead ends: 33 [2023-11-29 00:11:55,097 INFO L226 Difference]: Without dead ends: 22 [2023-11-29 00:11:55,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 00:11:55,099 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 13 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:11:55,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 15 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 8 Unknown, 0 Unchecked, 42.0s Time] [2023-11-29 00:11:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-29 00:11:55,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 14. [2023-11-29 00:11:55,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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) [2023-11-29 00:11:55,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2023-11-29 00:11:55,105 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2023-11-29 00:11:55,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:11:55,105 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-11-29 00:11:55,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2023-11-29 00:11:55,105 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2023-11-29 00:11:55,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 00:11:55,106 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:11:55,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:11:55,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:11:55,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:11:55,307 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:11:55,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:11:55,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1409906879, now seen corresponding path program 1 times [2023-11-29 00:11:55,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:11:55,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288922900] [2023-11-29 00:11:55,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:11:55,308 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 [2023-11-29 00:11:55,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:11:55,309 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:11:55,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:11:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:11:58,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 00:11:58,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:12:12,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:12:12,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:12:17,662 WARN L293 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:12:26,608 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:12:30,811 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2023-11-29 00:12:35,017 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from true [2023-11-29 00:12:43,965 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:12:52,892 WARN L293 SmtUtils]: Spent 8.93s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:13:03,600 WARN L293 SmtUtils]: Spent 10.71s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:13:14,206 WARN L293 SmtUtils]: Spent 10.61s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:13:18,717 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2023-11-29 00:13:23,238 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from true [2023-11-29 00:13:33,617 WARN L293 SmtUtils]: Spent 10.38s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:13:44,038 WARN L293 SmtUtils]: Spent 10.42s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:13:53,890 WARN L293 SmtUtils]: Spent 9.85s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:14:03,880 WARN L293 SmtUtils]: Spent 9.99s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:14:08,265 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2023-11-29 00:14:12,653 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2023-11-29 00:14:22,418 WARN L293 SmtUtils]: Spent 9.76s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:14:32,213 WARN L293 SmtUtils]: Spent 9.79s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:14:36,592 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~d~0#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2023-11-29 00:14:40,986 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~d~0#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2023-11-29 00:14:40,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-29 00:14:40,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:14:40,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288922900] [2023-11-29 00:14:40,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288922900] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:14:40,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:14:40,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-11-29 00:14:40,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452512919] [2023-11-29 00:14:40,987 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:14:40,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 00:14:40,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:14:40,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 00:14:40,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=38, Unknown=11, NotChecked=60, Total=132 [2023-11-29 00:14:40,990 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:14:45,486 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~d~0#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1) (= .cse1 |c_ULTIMATE.start_main_~d~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-11-29 00:14:49,851 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= .cse1 |c_ULTIMATE.start_SqrtR_~Input#1|) (fp.geq .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-11-29 00:14:54,231 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= .cse1 |c_ULTIMATE.start_SqrtR_~Input#1|) (fp.geq .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-11-29 00:14:58,772 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (= .cse1 |c_ULTIMATE.start_SqrtR_~Input#1|) (= .cse1 |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-11-29 00:15:03,282 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (= .cse1 |c_ULTIMATE.start_SqrtR_~Input#1|) (= .cse1 |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-11-29 00:15:08,897 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 .cse1) (= (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) .cse1) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-11-29 00:15:14,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:15:18,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:15:22,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:15:26,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:15:31,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.77s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:15:32,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:15:36,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:15:41,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.78s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:15:45,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:15:49,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:15:54,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.54s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:15:58,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:16:02,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:16:06,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:16:06,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:16:06,387 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2023-11-29 00:16:06,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 00:16:06,482 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-29 00:16:06,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:16:06,483 INFO L225 Difference]: With dead ends: 22 [2023-11-29 00:16:06,483 INFO L226 Difference]: Without dead ends: 20 [2023-11-29 00:16:06,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 76.6s TimeCoverageRelationStatistics Valid=31, Invalid=40, Unknown=17, NotChecked=152, Total=240 [2023-11-29 00:16:06,485 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 57.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:16:06,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 31 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 12 Unknown, 119 Unchecked, 57.6s Time] [2023-11-29 00:16:06,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-29 00:16:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2023-11-29 00:16:06,491 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) [2023-11-29 00:16:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-11-29 00:16:06,492 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 9 [2023-11-29 00:16:06,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:16:06,492 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-11-29 00:16:06,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:16:06,493 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-11-29 00:16:06,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 00:16:06,493 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:16:06,493 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:16:06,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 00:16:06,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:16:06,694 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:16:06,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:16:06,695 INFO L85 PathProgramCache]: Analyzing trace with hash -756439913, now seen corresponding path program 2 times [2023-11-29 00:16:06,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:16:06,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092341481] [2023-11-29 00:16:06,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 00:16:06,695 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 [2023-11-29 00:16:06,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:16:06,696 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:16:06,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:16:11,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 00:16:11,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 00:16:11,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 00:16:11,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:16:12,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 00:16:12,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:16:22,680 WARN L293 SmtUtils]: Spent 9.85s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:16:32,393 WARN L293 SmtUtils]: Spent 9.71s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:16:36,760 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_SqrtR_~xn~0#1|))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse2 .cse2)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (not (fp.gt .cse0 .cse1))))) is different from false [2023-11-29 00:16:41,125 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_SqrtR_~xn~0#1|))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse2 .cse2)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (not (fp.gt .cse0 .cse1))))) is different from true [2023-11-29 00:16:50,993 WARN L293 SmtUtils]: Spent 9.87s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:17:00,642 WARN L293 SmtUtils]: Spent 9.65s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:17:09,701 WARN L293 SmtUtils]: Spent 9.06s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:17:18,720 WARN L293 SmtUtils]: Spent 9.02s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:17:22,937 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse3) .cse3) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse3) .cse3))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse2 .cse3))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse2 .cse2)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))))))) is different from false [2023-11-29 00:17:27,157 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse3) .cse3) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse3) .cse3))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse2 .cse3))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse2 .cse2)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))))))) is different from true [2023-11-29 00:17:36,138 WARN L293 SmtUtils]: Spent 8.98s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:17:45,182 WARN L293 SmtUtils]: Spent 9.04s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:17:49,404 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse3) .cse3) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~d~0#1|) .cse3) .cse3))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse2 .cse3))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse2 .cse2)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))))))) is different from false [2023-11-29 00:17:53,622 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse3) .cse3) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~d~0#1|) .cse3) .cse3))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse2 .cse3))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse2 .cse2)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))))))) is different from true [2023-11-29 00:17:53,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-29 00:17:53,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:17:53,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092341481] [2023-11-29 00:17:53,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092341481] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:17:53,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:17:53,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 00:17:53,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114053139] [2023-11-29 00:17:53,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:17:53,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:17:53,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:17:53,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:17:53,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=20, Unknown=6, NotChecked=30, Total=72 [2023-11-29 00:17:53,625 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:17:57,907 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse2) .cse2) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~d~0#1|) .cse2) .cse2))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse3 .cse2))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse3 .cse3)))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.gt .cse0 .cse1)) (= .cse2 |c_ULTIMATE.start_main_~d~0#1|) (not (fp.lt .cse0 (fp.neg .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from false [2023-11-29 00:18:02,127 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse2) .cse2) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~d~0#1|) .cse2) .cse2))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse3 .cse2))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse3 .cse3)))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (not (fp.gt .cse0 .cse1)) (= .cse2 |c_ULTIMATE.start_main_~d~0#1|) (not (fp.lt .cse0 (fp.neg .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2023-11-29 00:18:06,368 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse2) .cse2))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse3 .cse2))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse3 .cse3)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (= .cse2 |c_ULTIMATE.start_SqrtR_~Input#1|) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2023-11-29 00:18:10,751 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse3 |c_ULTIMATE.start_SqrtR_~xn~0#1|))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse3 .cse3))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (= .cse2 |c_ULTIMATE.start_SqrtR_~Input#1|) (not (fp.gt .cse0 .cse1)) (= .cse2 |c_ULTIMATE.start_SqrtR_~xn~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-11-29 00:18:15,134 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse3 |c_ULTIMATE.start_SqrtR_~xn~0#1|))) (.cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 (fp.add c_currentRoundingMode .cse3 .cse3))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (= .cse2 |c_ULTIMATE.start_SqrtR_~Input#1|) (not (fp.gt .cse0 .cse1)) (= .cse2 |c_ULTIMATE.start_SqrtR_~xn~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-11-29 00:18:18,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:18:24,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.80s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:18:28,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.84s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:18:32,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.60s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:18:36,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:18:40,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:18:44,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:18:50,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.53s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:18:54,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:18:58,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:19:02,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:19:02,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:19:02,862 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2023-11-29 00:19:02,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 00:19:02,863 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-29 00:19:02,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:19:02,863 INFO L225 Difference]: With dead ends: 30 [2023-11-29 00:19:02,863 INFO L226 Difference]: Without dead ends: 19 [2023-11-29 00:19:02,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 47.8s TimeCoverageRelationStatistics Valid=22, Invalid=21, Unknown=11, NotChecked=78, Total=132 [2023-11-29 00:19:02,865 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 47.8s IncrementalHoareTripleChecker+Time [2023-11-29 00:19:02,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 22 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 9 Unknown, 63 Unchecked, 47.8s Time] [2023-11-29 00:19:02,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-29 00:19:02,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-11-29 00:19:02,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:19:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2023-11-29 00:19:02,872 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 10 [2023-11-29 00:19:02,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:19:02,872 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2023-11-29 00:19:02,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 00:19:02,872 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2023-11-29 00:19:02,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 00:19:02,873 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:19:02,873 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:19:02,945 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 00:19:03,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/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 [2023-11-29 00:19:03,074 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:19:03,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:19:03,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1621094331, now seen corresponding path program 1 times [2023-11-29 00:19:03,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 00:19:03,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645769399] [2023-11-29 00:19:03,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:19:03,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 00:19:03,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 00:19:03,076 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/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) [2023-11-29 00:19:03,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ed0f1e-19b0-47a3-a585-6ddfa6378888/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 00:19:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:19:07,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 00:19:07,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:19:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 00:19:17,950 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:19:26,388 WARN L293 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:19:34,801 WARN L293 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:19:38,900 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|))) (let ((.cse0 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse1))) (or (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_18| (_ FloatingPoint 11 53))) (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_18|)) (fp.gt .cse0 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse1))))) is different from false [2023-11-29 00:19:43,000 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|))) (let ((.cse0 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse1))) (or (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_18| (_ FloatingPoint 11 53))) (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_18|)) (fp.gt .cse0 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse1))))) is different from true [2023-11-29 00:19:52,446 WARN L293 SmtUtils]: Spent 9.44s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:20:01,042 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:20:05,386 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_SqrtR_~Input#1|))) (fp.add c_currentRoundingMode .cse2 .cse2)))) (let ((.cse0 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse1))) (or (fp.gt .cse0 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse1)) (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_18| (_ FloatingPoint 11 53))) (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_18|))))) is different from false [2023-11-29 00:20:09,709 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_SqrtR_~Input#1|))) (fp.add c_currentRoundingMode .cse2 .cse2)))) (let ((.cse0 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse1))) (or (fp.gt .cse0 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse1)) (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_18| (_ FloatingPoint 11 53))) (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_18|))))) is different from true [2023-11-29 00:20:19,146 WARN L293 SmtUtils]: Spent 9.43s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:20:27,767 WARN L293 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:20:32,113 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_main_~d~0#1|))) (fp.add c_currentRoundingMode .cse2 .cse2)))) (let ((.cse0 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse1))) (or (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_18| (_ FloatingPoint 11 53))) (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_18|)) (fp.gt .cse0 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse1))))) is different from false [2023-11-29 00:20:36,446 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) |c_ULTIMATE.start_main_~d~0#1|))) (fp.add c_currentRoundingMode .cse2 .cse2)))) (let ((.cse0 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse1))) (or (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_18| (_ FloatingPoint 11 53))) (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_18|)) (fp.gt .cse0 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse1))))) is different from true [2023-11-29 00:20:45,109 WARN L293 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:20:54,672 WARN L293 SmtUtils]: Spent 9.56s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:20:59,027 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse2 (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.div c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse3))))) (fp.add c_currentRoundingMode .cse2 .cse2)))) (let ((.cse0 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse1))) (or (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_18| (_ FloatingPoint 11 53))) (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_18|)) (fp.gt .cse0 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse1))))) is different from false [2023-11-29 00:21:03,401 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse2 (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.div c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse3))))) (fp.add c_currentRoundingMode .cse2 .cse2)))) (let ((.cse0 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse1))) (or (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_18| (_ FloatingPoint 11 53))) (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_18|)) (fp.gt .cse0 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse1))))) is different from true [2023-11-29 00:21:12,037 WARN L293 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:21:21,575 WARN L293 SmtUtils]: Spent 9.54s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:21:30,284 WARN L293 SmtUtils]: Spent 8.71s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:21:39,837 WARN L293 SmtUtils]: Spent 9.55s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:21:48,496 WARN L293 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:21:58,030 WARN L293 SmtUtils]: Spent 9.53s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:22:06,682 WARN L293 SmtUtils]: Spent 8.65s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:22:16,226 WARN L293 SmtUtils]: Spent 9.54s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:22:24,909 WARN L293 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:22:34,444 WARN L293 SmtUtils]: Spent 9.53s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:22:43,107 WARN L293 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:22:52,625 WARN L293 SmtUtils]: Spent 9.52s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:23:01,284 WARN L293 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:23:10,966 WARN L293 SmtUtils]: Spent 9.68s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 00:23:10,967 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-11-29 00:23:10,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 00:23:10,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645769399] [2023-11-29 00:23:10,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645769399] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:23:10,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 00:23:10,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-11-29 00:23:10,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29370604] [2023-11-29 00:23:10,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 00:23:10,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 00:23:10,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 00:23:10,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 00:23:10,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=41, Unknown=9, NotChecked=60, Total=132 [2023-11-29 00:23:10,969 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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) [2023-11-29 00:23:16,615 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (let ((.cse1 (let ((.cse2 (fp.div c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse3)))) (fp.add c_currentRoundingMode .cse2 .cse2)))) (let ((.cse0 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse1))) (or (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_18| (_ FloatingPoint 11 53))) (fp.lt .cse0 |v_ULTIMATE.start_SqrtR_~linf~0#1_18|)) (fp.gt .cse0 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse1))))) (= .cse3 |c_ULTIMATE.start_main_~d~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-29 00:23:20,980 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~d~0#1| (fp.add c_currentRoundingMode .cse0 .cse0)) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (let ((.cse2 (let ((.cse3 (fp.div c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~d~0#1|))) (fp.add c_currentRoundingMode .cse3 .cse3)))) (let ((.cse1 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse2))) (or (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_18| (_ FloatingPoint 11 53))) (fp.lt .cse1 |v_ULTIMATE.start_SqrtR_~linf~0#1_18|)) (fp.gt .cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-29 00:23:25,340 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~d~0#1| (fp.add c_currentRoundingMode .cse0 .cse0)) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (let ((.cse2 (let ((.cse3 (fp.div c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~d~0#1|))) (fp.add c_currentRoundingMode .cse3 .cse3)))) (let ((.cse1 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse2))) (or (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_18| (_ FloatingPoint 11 53))) (fp.lt .cse1 |v_ULTIMATE.start_SqrtR_~linf~0#1_18|)) (fp.gt .cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-29 00:23:29,714 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (= |c_ULTIMATE.start_SqrtR_~Input#1| (fp.add c_currentRoundingMode .cse0 .cse0)) (let ((.cse2 (let ((.cse3 (fp.div c_currentRoundingMode .cse0 |c_ULTIMATE.start_SqrtR_~Input#1|))) (fp.add c_currentRoundingMode .cse3 .cse3)))) (let ((.cse1 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse2))) (or (fp.gt .cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse2)) (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_18| (_ FloatingPoint 11 53))) (fp.lt .cse1 |v_ULTIMATE.start_SqrtR_~linf~0#1_18|))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-29 00:23:34,064 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (= |c_ULTIMATE.start_SqrtR_~Input#1| (fp.add c_currentRoundingMode .cse0 .cse0)) (let ((.cse2 (let ((.cse3 (fp.div c_currentRoundingMode .cse0 |c_ULTIMATE.start_SqrtR_~Input#1|))) (fp.add c_currentRoundingMode .cse3 .cse3)))) (let ((.cse1 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse2))) (or (fp.gt .cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse2)) (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_18| (_ FloatingPoint 11 53))) (fp.lt .cse1 |v_ULTIMATE.start_SqrtR_~linf~0#1_18|))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-29 00:23:38,169 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_SqrtR_~xn~0#1| (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.div c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode .cse0 .cse0)))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|))) (let ((.cse1 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse2))) (or (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_18| (_ FloatingPoint 11 53))) (fp.lt .cse1 |v_ULTIMATE.start_SqrtR_~linf~0#1_18|)) (fp.gt .cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-29 00:23:42,277 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_SqrtR_~xn~0#1| (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.div c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode .cse0 .cse0)))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|))) (let ((.cse1 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse2))) (or (forall ((|v_ULTIMATE.start_SqrtR_~linf~0#1_18| (_ FloatingPoint 11 53))) (fp.lt .cse1 |v_ULTIMATE.start_SqrtR_~linf~0#1_18|)) (fp.gt .cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-29 00:23:46,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:23:50,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:23:54,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:23:58,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:24:02,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:24:06,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:24:12,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.60s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:24:16,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:24:20,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:24:24,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:24:28,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:24:32,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:24:36,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:24:40,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:24:44,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:24:48,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:24:52,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:24:56,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:25:00,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:25:05,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.84s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 00:25:07,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []