./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB --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 3bb1d9e312234d5c4f7ead2dcb51cc43e4ff3aebeffef1b0758f6a0d5be2ea9b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:34:14,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:34:14,220 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 03:34:14,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:34:14,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:34:14,269 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:34:14,270 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:34:14,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:34:14,270 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:34:14,271 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:34:14,271 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:34:14,271 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:34:14,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:34:14,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:34:14,273 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:34:14,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:34:14,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:34:14,274 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:34:14,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:34:14,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:34:14,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:34:14,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:34:14,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:34:14,274 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:34:14,275 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:34:14,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:34:14,275 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:34:14,275 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:34:14,275 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:34:14,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:34:14,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:34:14,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:34:14,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:34:14,275 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:34:14,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:34:14,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:34:14,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:34:14,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:34:14,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:34:14,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:34:14,276 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:34:14,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:34:14,277 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:34:14,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:34:14,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:34:14,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:34:14,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:34:14,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:34:14,278 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 3bb1d9e312234d5c4f7ead2dcb51cc43e4ff3aebeffef1b0758f6a0d5be2ea9b [2024-11-28 03:34:14,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:34:14,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:34:14,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:34:14,644 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:34:14,645 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:34:14,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c [2024-11-28 03:34:17,667 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/data/991422887/a8219cb039d64e49b9e4c2ccf55d06da/FLAGbc307dcec [2024-11-28 03:34:17,939 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:34:17,940 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c [2024-11-28 03:34:17,960 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/data/991422887/a8219cb039d64e49b9e4c2ccf55d06da/FLAGbc307dcec [2024-11-28 03:34:18,004 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/data/991422887/a8219cb039d64e49b9e4c2ccf55d06da [2024-11-28 03:34:18,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:34:18,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:34:18,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:34:18,014 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:34:18,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:34:18,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:34:18" (1/1) ... [2024-11-28 03:34:18,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78265b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:18, skipping insertion in model container [2024-11-28 03:34:18,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:34:18" (1/1) ... [2024-11-28 03:34:18,048 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:34:18,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c[831,844] [2024-11-28 03:34:18,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:34:18,254 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:34:18,265 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c[831,844] [2024-11-28 03:34:18,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:34:18,287 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:34:18,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:18 WrapperNode [2024-11-28 03:34:18,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:34:18,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:34:18,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:34:18,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:34:18,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:18" (1/1) ... [2024-11-28 03:34:18,313 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:18" (1/1) ... [2024-11-28 03:34:18,330 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 62 [2024-11-28 03:34:18,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:34:18,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:34:18,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:34:18,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:34:18,340 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:18" (1/1) ... [2024-11-28 03:34:18,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:18" (1/1) ... [2024-11-28 03:34:18,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:18" (1/1) ... [2024-11-28 03:34:18,351 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]. [2024-11-28 03:34:18,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:18" (1/1) ... [2024-11-28 03:34:18,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:18" (1/1) ... [2024-11-28 03:34:18,355 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:18" (1/1) ... [2024-11-28 03:34:18,356 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:18" (1/1) ... [2024-11-28 03:34:18,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:18" (1/1) ... [2024-11-28 03:34:18,361 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:18" (1/1) ... [2024-11-28 03:34:18,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:18" (1/1) ... [2024-11-28 03:34:18,363 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:34:18,364 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:34:18,364 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:34:18,364 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:34:18,365 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:18" (1/1) ... [2024-11-28 03:34:18,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:34:18,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:34:18,406 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:34:18,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:34:18,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:34:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:34:18,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:34:18,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:34:18,513 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:34:18,515 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:34:18,628 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-28 03:34:18,628 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:34:18,637 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:34:18,638 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-28 03:34:18,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:34:18 BoogieIcfgContainer [2024-11-28 03:34:18,638 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:34:18,640 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:34:18,640 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:34:18,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:34:18,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:34:18" (1/3) ... [2024-11-28 03:34:18,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a70df35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:34:18, skipping insertion in model container [2024-11-28 03:34:18,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:18" (2/3) ... [2024-11-28 03:34:18,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a70df35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:34:18, skipping insertion in model container [2024-11-28 03:34:18,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:34:18" (3/3) ... [2024-11-28 03:34:18,648 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_interval.c [2024-11-28 03:34:18,664 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:34:18,665 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt_Householder_interval.c that has 1 procedures, 17 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 03:34:18,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:34:18,750 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@7977e6a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:34:18,750 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 03:34:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:18,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 03:34:18,763 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:34:18,764 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:34:18,764 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:34:18,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:18,773 INFO L85 PathProgramCache]: Analyzing trace with hash 335407921, now seen corresponding path program 1 times [2024-11-28 03:34:18,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:18,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448655222] [2024-11-28 03:34:18,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:18,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:18,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:34:18,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:18,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448655222] [2024-11-28 03:34:18,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448655222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:34:18,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:34:18,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:34:18,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929430478] [2024-11-28 03:34:18,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:34:18,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 03:34:18,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:18,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 03:34:18,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:34:18,984 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:18,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:34:18,999 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-28 03:34:19,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 03:34:19,005 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-28 03:34:19,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:34:19,015 INFO L225 Difference]: With dead ends: 31 [2024-11-28 03:34:19,016 INFO L226 Difference]: Without dead ends: 13 [2024-11-28 03:34:19,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:34:19,022 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:34:19,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:34:19,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-28 03:34:19,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-28 03:34:19,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:19,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-11-28 03:34:19,057 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2024-11-28 03:34:19,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:34:19,059 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-28 03:34:19,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-11-28 03:34:19,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 03:34:19,061 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:34:19,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:34:19,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:34:19,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:34:19,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:19,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1015466291, now seen corresponding path program 1 times [2024-11-28 03:34:19,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:19,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730825020] [2024-11-28 03:34:19,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:19,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:34:19,112 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:34:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:34:19,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:34:19,156 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:34:19,158 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 03:34:19,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:34:19,165 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-28 03:34:19,188 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:34:19,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:34:19 BoogieIcfgContainer [2024-11-28 03:34:19,194 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:34:19,197 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:34:19,197 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:34:19,198 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:34:19,198 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:34:18" (3/4) ... [2024-11-28 03:34:19,201 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 03:34:19,202 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:34:19,203 INFO L158 Benchmark]: Toolchain (without parser) took 1190.18ms. Allocated memory is still 117.4MB. Free memory was 94.2MB in the beginning and 48.6MB in the end (delta: 45.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-28 03:34:19,204 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 167.8MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:34:19,204 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.75ms. Allocated memory is still 117.4MB. Free memory was 94.2MB in the beginning and 82.9MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:34:19,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.96ms. Allocated memory is still 117.4MB. Free memory was 82.9MB in the beginning and 81.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:34:19,205 INFO L158 Benchmark]: Boogie Preprocessor took 32.42ms. Allocated memory is still 117.4MB. Free memory was 81.4MB in the beginning and 80.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:34:19,206 INFO L158 Benchmark]: RCFGBuilder took 274.23ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 70.1MB in the end (delta: 9.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 03:34:19,207 INFO L158 Benchmark]: TraceAbstraction took 553.64ms. Allocated memory is still 117.4MB. Free memory was 69.4MB in the beginning and 49.0MB in the end (delta: 20.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:34:19,207 INFO L158 Benchmark]: Witness Printer took 4.69ms. Allocated memory is still 117.4MB. Free memory was 49.0MB in the beginning and 48.6MB in the end (delta: 355.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:34:19,209 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.38ms. Allocated memory is still 167.8MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.75ms. Allocated memory is still 117.4MB. Free memory was 94.2MB in the beginning and 82.9MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.96ms. Allocated memory is still 117.4MB. Free memory was 82.9MB in the beginning and 81.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.42ms. Allocated memory is still 117.4MB. Free memory was 81.4MB in the beginning and 80.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 274.23ms. Allocated memory is still 117.4MB. Free memory was 80.0MB in the beginning and 70.1MB in the end (delta: 9.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 553.64ms. Allocated memory is still 117.4MB. Free memory was 69.4MB in the beginning and 49.0MB in the end (delta: 20.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Witness Printer took 4.69ms. Allocated memory is still 117.4MB. Free memory was 49.0MB in the beginning and 48.6MB in the end (delta: 355.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 20]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 44, overapproximation of someBinaryArithmeticDOUBLEoperation at line 30, overapproximation of someUnaryDOUBLEoperation at line 32, overapproximation of someBinaryDOUBLEComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryDOUBLEComparisonOperation at line 56. Possible FailurePath: [L22] double _EPS = 1e-6; VAL [_EPS=1/1000000] [L49] double d, r; [L51] d = __VERIFIER_nondet_double() [L52] CALL assume_abort_if_not(d >= 0.1 && d <= 20.0) [L18] COND FALSE !(!cond) VAL [_EPS=1/1000000] [L52] RET assume_abort_if_not(d >= 0.1 && d <= 20.0) [L54] CALL, EXPR SqrtR(d) [L26] double xn, xnp1, residu, lsup, linf; [L27] int i, cond; VAL [_EPS=1/1000000] [L28] COND TRUE Input <= 1.0 [L28] xn = 1.0 VAL [_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 [_EPS=1/1000000, cond=0, i=0] [L35] COND FALSE !(\read(cond)) VAL [_EPS=1/1000000, i=0] [L44] return 1.0 / xnp1; VAL [_EPS=1/1000000, i=0] [L54] RET, EXPR SqrtR(d) [L54] r = SqrtR(d) [L56] CALL __VERIFIER_assert(r >= 0.3 && r <= 5.) [L20] COND TRUE !(cond) VAL [_EPS=1/1000000] [L20] reach_error() VAL [_EPS=1/1000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 18 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-28 03:34:19,237 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB --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 3bb1d9e312234d5c4f7ead2dcb51cc43e4ff3aebeffef1b0758f6a0d5be2ea9b --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:34:21,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:34:22,047 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-28 03:34:22,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:34:22,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:34:22,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:34:22,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:34:22,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:34:22,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:34:22,107 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:34:22,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:34:22,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:34:22,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:34:22,108 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:34:22,108 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:34:22,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:34:22,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:34:22,110 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:34:22,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:34:22,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:34:22,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:34:22,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:34:22,111 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:34:22,111 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:34:22,111 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 03:34:22,111 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 03:34:22,111 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:34:22,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:34:22,112 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:34:22,112 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:34:22,112 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:34:22,112 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:34:22,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:34:22,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:34:22,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:34:22,113 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:34:22,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:34:22,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:34:22,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:34:22,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:34:22,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:34:22,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:34:22,114 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:34:22,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:34:22,115 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 03:34:22,115 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 03:34:22,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:34:22,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:34:22,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:34:22,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:34:22,116 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 3bb1d9e312234d5c4f7ead2dcb51cc43e4ff3aebeffef1b0758f6a0d5be2ea9b [2024-11-28 03:34:22,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:34:22,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:34:22,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:34:22,487 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:34:22,488 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:34:22,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c [2024-11-28 03:34:25,507 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/data/f1f20fffb/ea219083f1d14002b3e1b36932fe2ea5/FLAGce45c2510 [2024-11-28 03:34:25,815 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:34:25,817 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c [2024-11-28 03:34:25,828 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/data/f1f20fffb/ea219083f1d14002b3e1b36932fe2ea5/FLAGce45c2510 [2024-11-28 03:34:25,849 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/data/f1f20fffb/ea219083f1d14002b3e1b36932fe2ea5 [2024-11-28 03:34:25,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:34:25,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:34:25,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:34:25,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:34:25,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:34:25,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:34:25" (1/1) ... [2024-11-28 03:34:25,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@356268f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:25, skipping insertion in model container [2024-11-28 03:34:25,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:34:25" (1/1) ... [2024-11-28 03:34:25,885 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:34:26,051 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c[831,844] [2024-11-28 03:34:26,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:34:26,093 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:34:26,105 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c[831,844] [2024-11-28 03:34:26,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:34:26,136 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:34:26,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:26 WrapperNode [2024-11-28 03:34:26,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:34:26,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:34:26,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:34:26,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:34:26,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:26" (1/1) ... [2024-11-28 03:34:26,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:26" (1/1) ... [2024-11-28 03:34:26,175 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 63 [2024-11-28 03:34:26,175 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:34:26,176 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:34:26,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:34:26,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:34:26,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:26" (1/1) ... [2024-11-28 03:34:26,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:26" (1/1) ... [2024-11-28 03:34:26,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:26" (1/1) ... [2024-11-28 03:34:26,210 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]. [2024-11-28 03:34:26,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:26" (1/1) ... [2024-11-28 03:34:26,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:26" (1/1) ... [2024-11-28 03:34:26,230 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:26" (1/1) ... [2024-11-28 03:34:26,231 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:26" (1/1) ... [2024-11-28 03:34:26,238 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:26" (1/1) ... [2024-11-28 03:34:26,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:26" (1/1) ... [2024-11-28 03:34:26,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:26" (1/1) ... [2024-11-28 03:34:26,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:34:26,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:34:26,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:34:26,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:34:26,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:26" (1/1) ... [2024-11-28 03:34:26,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:34:26,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:34:26,299 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:34:26,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:34:26,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:34:26,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 03:34:26,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:34:26,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:34:26,422 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:34:26,424 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:34:42,185 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-28 03:34:42,185 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:34:42,197 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:34:42,197 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-28 03:34:42,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:34:42 BoogieIcfgContainer [2024-11-28 03:34:42,198 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:34:42,200 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:34:42,200 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:34:42,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:34:42,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:34:25" (1/3) ... [2024-11-28 03:34:42,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303b8ab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:34:42, skipping insertion in model container [2024-11-28 03:34:42,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:26" (2/3) ... [2024-11-28 03:34:42,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303b8ab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:34:42, skipping insertion in model container [2024-11-28 03:34:42,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:34:42" (3/3) ... [2024-11-28 03:34:42,209 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_interval.c [2024-11-28 03:34:42,226 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:34:42,227 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt_Householder_interval.c that has 1 procedures, 17 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 03:34:42,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:34:42,304 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@305a88c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:34:42,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 03:34:42,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:42,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 03:34:42,313 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:34:42,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:34:42,314 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:34:42,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:42,318 INFO L85 PathProgramCache]: Analyzing trace with hash 335407921, now seen corresponding path program 1 times [2024-11-28 03:34:42,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:34:42,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755730935] [2024-11-28 03:34:42,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:42,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:34:42,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:34:42,331 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 03:34:42,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-28 03:34:43,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:43,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-28 03:34:43,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:34:43,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:34:43,639 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:34:43,640 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:34:43,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755730935] [2024-11-28 03:34:43,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755730935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:34:43,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:34:43,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:34:43,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210137713] [2024-11-28 03:34:43,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:34:43,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-28 03:34:43,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:34:43,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-28 03:34:43,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:34:43,669 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:43,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:34:43,698 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-28 03:34:43,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-28 03:34:43,703 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-28 03:34:43,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:34:43,709 INFO L225 Difference]: With dead ends: 31 [2024-11-28 03:34:43,710 INFO L226 Difference]: Without dead ends: 13 [2024-11-28 03:34:43,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-28 03:34:43,718 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 03:34:43,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 03:34:43,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-28 03:34:43,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-28 03:34:43,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:43,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-11-28 03:34:43,753 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2024-11-28 03:34:43,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:34:43,755 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-11-28 03:34:43,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:43,756 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-11-28 03:34:43,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 03:34:43,757 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:34:43,757 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:34:43,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-28 03:34:43,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:34:43,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:34:43,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:43,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1015466291, now seen corresponding path program 1 times [2024-11-28 03:34:43,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:34:43,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416174715] [2024-11-28 03:34:43,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:43,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:34:43,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:34:43,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 03:34:43,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-28 03:34:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:45,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 03:34:45,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:34:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:34:46,574 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:34:46,574 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:34:46,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416174715] [2024-11-28 03:34:46,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416174715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:34:46,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:34:46,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:34:46,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608137858] [2024-11-28 03:34:46,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:34:46,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:34:46,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:34:46,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:34:46,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:34:46,583 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:51,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:34:55,271 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 [] [2024-11-28 03:34:57,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:35:00,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:35:04,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:35:08,613 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 [] [2024-11-28 03:35:13,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.71s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:35:17,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:35:21,475 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 [] [2024-11-28 03:35:25,489 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 [] [2024-11-28 03:35:29,495 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 [] [2024-11-28 03:35:33,503 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 [] [2024-11-28 03:35:37,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:35:42,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:35:42,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:35:42,278 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2024-11-28 03:35:42,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:35:42,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-28 03:35:42,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:35:42,280 INFO L225 Difference]: With dead ends: 21 [2024-11-28 03:35:42,280 INFO L226 Difference]: Without dead ends: 16 [2024-11-28 03:35:42,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:35:42,281 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 54.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.4s IncrementalHoareTripleChecker+Time [2024-11-28 03:35:42,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 15 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 55.4s Time] [2024-11-28 03:35:42,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-28 03:35:42,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-28 03:35:42,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:35:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-11-28 03:35:42,286 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2024-11-28 03:35:42,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:35:42,287 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-11-28 03:35:42,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:35:42,287 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-11-28 03:35:42,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 03:35:42,288 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:35:42,288 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:35:42,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/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)] Forceful destruction successful, exit code 0 [2024-11-28 03:35:42,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:35:42,489 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:35:42,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:42,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1504493643, now seen corresponding path program 1 times [2024-11-28 03:35:42,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:35:42,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595438343] [2024-11-28 03:35:42,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:42,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:35:42,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:35:42,492 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 03:35:42,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-28 03:35:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:48,478 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-28 03:35:48,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:36:00,528 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:36:06,484 WARN L286 SmtUtils]: Spent 5.96s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:36:12,386 WARN L851 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-28 03:36:21,284 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:36:29,598 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:36:37,939 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:36:46,255 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:36:54,629 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:37:02,917 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:37:11,205 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:37:23,840 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:37:28,018 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse4)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (let ((.cse3 (fp.add c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (fp.gt (fp.mul c_currentRoundingMode .cse2 .cse3) (fp.mul c_currentRoundingMode .cse4 .cse3))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5)))) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv1 32))) (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse6 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= .cse6 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (not (let ((.cse7 (fp.add c_currentRoundingMode .cse6 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (fp.gt (fp.mul c_currentRoundingMode .cse2 .cse7) (fp.mul c_currentRoundingMode .cse4 .cse7))))))) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-28 03:37:36,300 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:37:44,572 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:37:52,851 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:38:01,117 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:38:05,242 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (= .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (not (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse3 (fp.add c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse2) .cse3) (fp.mul c_currentRoundingMode .cse2 .cse3)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-28 03:38:13,780 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:38:22,199 WARN L286 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:38:29,868 WARN L286 SmtUtils]: Spent 7.67s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:38:38,345 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:38:42,536 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse0 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (= (fp.div c_currentRoundingMode .cse0 .cse1) |c_ULTIMATE.start_SqrtR_#res#1|) (not (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse3 (fp.add c_currentRoundingMode .cse1 .cse1))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse2) .cse3) (fp.mul c_currentRoundingMode .cse2 .cse3)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-28 03:38:59,446 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:39:07,968 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:39:16,402 WARN L286 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:39:24,949 WARN L286 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:39:37,625 WARN L286 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:39:46,139 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:39:54,782 WARN L286 SmtUtils]: Spent 8.64s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:03,472 WARN L286 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:16,248 WARN L286 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:24,869 WARN L286 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:33,562 WARN L286 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:42,187 WARN L286 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:50,757 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:40:55,370 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse2)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven .cse5 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (let ((.cse1 (fp.add roundNearestTiesToEven .cse3 .cse3))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse2 .cse1)))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (not (fp.geq (fp.div roundNearestTiesToEven .cse5 .cse3) .cse6)) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse8 (fp.div roundNearestTiesToEven .cse5 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (let ((.cse7 (fp.add roundNearestTiesToEven .cse8 .cse8))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse7) (fp.mul roundNearestTiesToEven .cse2 .cse7)))) (not (fp.leq (fp.div roundNearestTiesToEven .cse5 .cse8) .cse9)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5))))))) (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse11 (fp.div roundNearestTiesToEven .cse5 |ULTIMATE.start_SqrtR_~Input#1|))) (let ((.cse12 (fp.div roundNearestTiesToEven .cse5 .cse11))) (and (not (let ((.cse10 (fp.add roundNearestTiesToEven .cse11 .cse11))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse10) (fp.mul roundNearestTiesToEven .cse2 .cse10)))) (fp.geq .cse12 .cse6) (fp.leq .cse12 .cse9) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)))))) is different from false [2024-11-28 03:41:08,094 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:41:16,668 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:41:25,182 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:41:33,837 WARN L286 SmtUtils]: Spent 8.65s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:41:46,587 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:41:55,085 WARN L286 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:42:03,724 WARN L286 SmtUtils]: Spent 8.64s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:42:12,364 WARN L286 SmtUtils]: Spent 8.64s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:42:16,663 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse2)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven .cse5 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (let ((.cse1 (fp.add roundNearestTiesToEven .cse3 .cse3))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse2 .cse1)))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (not (fp.geq (fp.div roundNearestTiesToEven .cse5 .cse3) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse7 (fp.div roundNearestTiesToEven .cse5 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (let ((.cse6 (fp.add roundNearestTiesToEven .cse7 .cse7))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse6) (fp.mul roundNearestTiesToEven .cse2 .cse6)))) (not (fp.leq (fp.div roundNearestTiesToEven .cse5 .cse7) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5)))))))) is different from false [2024-11-28 03:42:20,800 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse2)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven .cse5 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (let ((.cse1 (fp.add roundNearestTiesToEven .cse3 .cse3))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse2 .cse1)))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (not (fp.geq (fp.div roundNearestTiesToEven .cse5 .cse3) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse7 (fp.div roundNearestTiesToEven .cse5 |ULTIMATE.start_SqrtR_~Input#1|))) (and (not (let ((.cse6 (fp.add roundNearestTiesToEven .cse7 .cse7))) (fp.gt (fp.mul roundNearestTiesToEven .cse0 .cse6) (fp.mul roundNearestTiesToEven .cse2 .cse6)))) (not (fp.leq (fp.div roundNearestTiesToEven .cse5 .cse7) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse5)))))))) is different from true [2024-11-28 03:42:20,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:42:20,801 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:42:20,801 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:42:20,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595438343] [2024-11-28 03:42:20,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595438343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:42:20,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:42:20,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:42:20,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452475518] [2024-11-28 03:42:20,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:42:20,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 03:42:20,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:42:20,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 03:42:20,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=23, Unknown=7, NotChecked=78, Total=132 [2024-11-28 03:42:20,804 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 12 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:42:25,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:42:27,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:42:31,423 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 20.0))) (and (fp.geq |c_ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10.0))) (fp.leq |c_ULTIMATE.start_SqrtR_~Input#1| .cse0) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) c_~_EPS~0) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse1)) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0) (= |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.div c_currentRoundingMode .cse1 |ULTIMATE.start_SqrtR_~Input#1|))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-28 03:42:35,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:42:39,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:42:43,728 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 [] [2024-11-28 03:42:48,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.87s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:42:52,603 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 [] [2024-11-28 03:42:56,607 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 [] [2024-11-28 03:43:00,619 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 [] [2024-11-28 03:43:04,631 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 [] [2024-11-28 03:43:08,636 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 [] [2024-11-28 03:43:12,640 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 [] [2024-11-28 03:43:17,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.51s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:43:21,160 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 [] [2024-11-28 03:43:22,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:43:22,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:43:22,645 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2024-11-28 03:43:22,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:43:22,647 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-28 03:43:22,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:43:22,647 INFO L225 Difference]: With dead ends: 28 [2024-11-28 03:43:22,648 INFO L226 Difference]: Without dead ends: 23 [2024-11-28 03:43:22,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.3s TimeCoverageRelationStatistics Valid=26, Invalid=24, Unknown=8, NotChecked=98, Total=156 [2024-11-28 03:43:22,649 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 17 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 166 IncrementalHoareTripleChecker+Unchecked, 57.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:43:22,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 40 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 13 Unknown, 166 Unchecked, 57.6s Time] [2024-11-28 03:43:22,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-28 03:43:22,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 14. [2024-11-28 03:43:22,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:22,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2024-11-28 03:43:22,654 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2024-11-28 03:43:22,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:43:22,655 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2024-11-28 03:43:22,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.0) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:43:22,655 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2024-11-28 03:43:22,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-28 03:43:22,655 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:43:22,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:43:22,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-28 03:43:22,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:43:22,856 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:43:22,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:43:22,857 INFO L85 PathProgramCache]: Analyzing trace with hash -991535313, now seen corresponding path program 1 times [2024-11-28 03:43:22,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:43:22,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919123214] [2024-11-28 03:43:22,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:43:22,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:43:22,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:43:22,862 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-28 03:43:22,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_baf5975a-c0f4-469f-a18c-d23984c9c7df/bin/uautomizer-verify-aQ6SnzHsRB/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-28 03:43:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:43:33,435 WARN L254 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-28 03:43:33,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:43:47,660 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:43:56,044 WARN L286 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:44:04,604 WARN L286 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:44:11,919 WARN L286 SmtUtils]: Spent 7.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:44:17,263 WARN L286 SmtUtils]: Spent 5.34s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:44:25,418 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:44:33,566 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:44:41,794 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:44:49,958 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:44:58,132 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:45:02,292 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| .cse4))) (.cse3 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)))) (let ((.cse0 (fp.gt .cse2 .cse3)) (.cse1 (fp.lt .cse2 (fp.neg .cse3)))) (or (and (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv1 32)) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32)))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (= (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse4) .cse4) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |ULTIMATE.start_SqrtR_~Input#1|) .cse4) .cse4))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10.0))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-28 03:45:06,342 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| .cse4))) (.cse3 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)))) (let ((.cse0 (fp.gt .cse2 .cse3)) (.cse1 (fp.lt .cse2 (fp.neg .cse3)))) (or (and (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv1 32)) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |c_ULTIMATE.start_SqrtR_~cond~0#1| (_ bv0 32)))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse4) (= (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse4) .cse4) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |ULTIMATE.start_SqrtR_~Input#1|) .cse4) .cse4))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10.0))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-28 03:45:14,489 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:45:22,655 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:45:31,323 WARN L286 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:45:39,829 WARN L286 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:45:48,504 WARN L286 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:45:56,715 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:46:00,881 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| .cse2))) (.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)))) (and (not (fp.gt .cse0 .cse1)) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2) (= (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |ULTIMATE.start_SqrtR_~Input#1|) .cse2) .cse2))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10.0))))) (not (fp.lt .cse0 (fp.neg .cse1))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-28 03:46:04,949 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| .cse2))) (.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xnp1~0#1| |c_ULTIMATE.start_SqrtR_~xnp1~0#1|)))) (and (not (fp.gt .cse0 .cse1)) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2) (= (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |ULTIMATE.start_SqrtR_~Input#1|) .cse2) .cse2))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10.0))))) (not (fp.lt .cse0 (fp.neg .cse1))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-28 03:46:13,930 WARN L286 SmtUtils]: Spent 8.98s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:46:23,220 WARN L286 SmtUtils]: Spent 9.29s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:46:32,483 WARN L286 SmtUtils]: Spent 9.26s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:46:41,383 WARN L286 SmtUtils]: Spent 8.90s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:46:50,601 WARN L286 SmtUtils]: Spent 9.22s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:46:54,950 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse0) .cse0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |ULTIMATE.start_SqrtR_~Input#1|) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse3 .cse0))) (.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode .cse3 .cse3)))) (and (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0) (not (fp.lt .cse1 (fp.neg .cse2))) (not (fp.gt .cse1 .cse2)) (= (fp.div c_currentRoundingMode .cse0 .cse3) |c_ULTIMATE.start_SqrtR_#res#1|) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10.0)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-11-28 03:46:59,123 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |ULTIMATE.start_SqrtR_~Input#1| .cse0) .cse0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |ULTIMATE.start_SqrtR_~Input#1|) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)))) (let ((.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode .cse3 .cse0))) (.cse2 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode .cse3 .cse3)))) (and (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse0) (not (fp.lt .cse1 (fp.neg .cse2))) (not (fp.gt .cse1 .cse2)) (= (fp.div c_currentRoundingMode .cse0 .cse3) |c_ULTIMATE.start_SqrtR_#res#1|) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10.0)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-28 03:47:16,584 WARN L286 SmtUtils]: Spent 8.86s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:47:25,582 WARN L286 SmtUtils]: Spent 9.00s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:47:34,281 WARN L286 SmtUtils]: Spent 8.70s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:47:43,219 WARN L286 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:47:52,046 WARN L286 SmtUtils]: Spent 8.83s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:48:05,238 WARN L286 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:48:14,137 WARN L286 SmtUtils]: Spent 8.90s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:48:22,859 WARN L286 SmtUtils]: Spent 8.72s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:48:31,749 WARN L286 SmtUtils]: Spent 8.89s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:48:40,636 WARN L286 SmtUtils]: Spent 8.89s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:48:53,823 WARN L286 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:49:02,838 WARN L286 SmtUtils]: Spent 9.02s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:49:11,867 WARN L286 SmtUtils]: Spent 9.03s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:49:21,040 WARN L286 SmtUtils]: Spent 9.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:49:30,195 WARN L286 SmtUtils]: Spent 9.15s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:49:39,361 WARN L286 SmtUtils]: Spent 9.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:49:44,306 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 15.0)) (.cse9 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse11 ((_ to_fp 11 53) roundNearestTiesToEven 8.0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2) (fp.add roundNearestTiesToEven .cse9 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 |ULTIMATE.start_SqrtR_~Input#1|) .cse2) .cse2))))) .cse11))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse3 .cse2))) (.cse1 (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven .cse3 .cse3)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))) (not (fp.leq (fp.div roundNearestTiesToEven .cse2 .cse3) .cse4)) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2))))) (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse14 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2) (fp.add roundNearestTiesToEven .cse9 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 |ULTIMATE.start_SqrtR_~Input#1|) .cse2) .cse2))))) .cse11))) (let ((.cse12 (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse14 .cse2))) (.cse13 (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven .cse14 .cse14)))) (and (not (fp.gt .cse12 .cse13)) (not (fp.lt .cse12 (fp.neg .cse13))) (not (fp.geq (fp.div roundNearestTiesToEven .cse2 .cse14) .cse15)) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2))))))) (and (exists ((|ULTIMATE.start_SqrtR_~Input#1| (_ FloatingPoint 11 53))) (let ((.cse19 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_SqrtR_~Input#1| .cse2) .cse2) (fp.add roundNearestTiesToEven .cse9 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse10 |ULTIMATE.start_SqrtR_~Input#1|) .cse2) .cse2))))) .cse11))) (let ((.cse16 (fp.mul roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse19 .cse2))) (.cse17 (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven .cse19 .cse19))) (.cse18 (fp.div roundNearestTiesToEven .cse2 .cse19))) (and (not (fp.gt .cse16 .cse17)) (not (fp.lt .cse16 (fp.neg .cse17))) (fp.geq .cse18 .cse15) (fp.geq |ULTIMATE.start_SqrtR_~Input#1| .cse5) (fp.leq .cse18 .cse4) (fp.leq |ULTIMATE.start_SqrtR_~Input#1| .cse2))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))))) is different from false