./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/digits_for.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_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/digits_for.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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_5f87e4fe-0145-43e6-9474-211dc10ff767/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 ae5df297f2d3ee5d728aff1b63a3afef9bfbadb73abd56462b4581e636fe830d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:03:32,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:03:32,987 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 03:03:32,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:03:32,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:03:33,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:03:33,033 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:03:33,033 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:03:33,033 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:03:33,033 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:03:33,034 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:03:33,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:03:33,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:03:33,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:03:33,034 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:03:33,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:03:33,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:03:33,035 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:03:33,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:03:33,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:03:33,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:03:33,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:03:33,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:03:33,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:03:33,035 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:03:33,035 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:03:33,036 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:03:33,036 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:03:33,036 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:03:33,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:03:33,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:03:33,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:03:33,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:03:33,036 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:03:33,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:03:33,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:03:33,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:03:33,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:03:33,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:03:33,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:03:33,037 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:03:33,037 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:03:33,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:03:33,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:03:33,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:03:33,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:03:33,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:03:33,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:03:33,038 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_5f87e4fe-0145-43e6-9474-211dc10ff767/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 -> ae5df297f2d3ee5d728aff1b63a3afef9bfbadb73abd56462b4581e636fe830d [2024-11-28 03:03:33,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:03:33,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:03:33,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:03:33,370 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:03:33,371 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:03:33,372 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/floats-esbmc-regression/digits_for.c [2024-11-28 03:03:36,385 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/data/8e61c71ed/813b6c5546d94860a6b14d6daefc4986/FLAG4aa003ebe [2024-11-28 03:03:36,633 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:03:36,634 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/sv-benchmarks/c/floats-esbmc-regression/digits_for.c [2024-11-28 03:03:36,641 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/data/8e61c71ed/813b6c5546d94860a6b14d6daefc4986/FLAG4aa003ebe [2024-11-28 03:03:36,965 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/data/8e61c71ed/813b6c5546d94860a6b14d6daefc4986 [2024-11-28 03:03:36,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:03:36,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:03:36,971 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:03:36,971 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:03:36,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:03:36,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:03:36" (1/1) ... [2024-11-28 03:03:36,978 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5187dd21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:36, skipping insertion in model container [2024-11-28 03:03:36,978 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:03:36" (1/1) ... [2024-11-28 03:03:36,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:03:37,157 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_5f87e4fe-0145-43e6-9474-211dc10ff767/sv-benchmarks/c/floats-esbmc-regression/digits_for.c[315,328] [2024-11-28 03:03:37,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:03:37,183 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:03:37,194 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_5f87e4fe-0145-43e6-9474-211dc10ff767/sv-benchmarks/c/floats-esbmc-regression/digits_for.c[315,328] [2024-11-28 03:03:37,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:03:37,214 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:03:37,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:37 WrapperNode [2024-11-28 03:03:37,215 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:03:37,216 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:03:37,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:03:37,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:03:37,223 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:03:37" (1/1) ... [2024-11-28 03:03:37,230 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:03:37" (1/1) ... [2024-11-28 03:03:37,245 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 30 [2024-11-28 03:03:37,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:03:37,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:03:37,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:03:37,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:03:37,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:37" (1/1) ... [2024-11-28 03:03:37,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:37" (1/1) ... [2024-11-28 03:03:37,256 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:37" (1/1) ... [2024-11-28 03:03:37,273 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:03:37,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:37" (1/1) ... [2024-11-28 03:03:37,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:37" (1/1) ... [2024-11-28 03:03:37,285 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:37" (1/1) ... [2024-11-28 03:03:37,285 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:37" (1/1) ... [2024-11-28 03:03:37,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:37" (1/1) ... [2024-11-28 03:03:37,295 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:37" (1/1) ... [2024-11-28 03:03:37,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:37" (1/1) ... [2024-11-28 03:03:37,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:03:37,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:03:37,300 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:03:37,300 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:03:37,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:37" (1/1) ... [2024-11-28 03:03:37,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:03:37,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:03:37,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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:03:37,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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:03:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:03:37,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:03:37,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:03:37,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:03:37,436 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:03:37,438 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:03:37,565 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-28 03:03:37,565 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:03:37,573 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:03:37,573 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-28 03:03:37,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:03:37 BoogieIcfgContainer [2024-11-28 03:03:37,574 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:03:37,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:03:37,577 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:03:37,581 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:03:37,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:03:36" (1/3) ... [2024-11-28 03:03:37,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@479b31cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:03:37, skipping insertion in model container [2024-11-28 03:03:37,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:37" (2/3) ... [2024-11-28 03:03:37,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@479b31cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:03:37, skipping insertion in model container [2024-11-28 03:03:37,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:03:37" (3/3) ... [2024-11-28 03:03:37,583 INFO L128 eAbstractionObserver]: Analyzing ICFG digits_for.c [2024-11-28 03:03:37,597 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:03:37,599 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG digits_for.c that has 1 procedures, 12 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 03:03:37,659 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:03:37,672 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;@455fa334, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:03:37,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 03:03:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:03:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 03:03:37,682 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:37,682 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 03:03:37,683 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:03:37,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:37,688 INFO L85 PathProgramCache]: Analyzing trace with hash 889664619, now seen corresponding path program 1 times [2024-11-28 03:03:37,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:03:37,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711529626] [2024-11-28 03:03:37,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:37,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:03:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:03:37,784 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:03:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:03:37,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:03:37,811 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:03:37,812 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 03:03:37,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:03:37,817 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2024-11-28 03:03:37,830 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:03:37,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:03:37 BoogieIcfgContainer [2024-11-28 03:03:37,838 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:03:37,840 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:03:37,840 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:03:37,841 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:03:37,843 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:03:37" (3/4) ... [2024-11-28 03:03:37,845 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-28 03:03:37,846 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:03:37,848 INFO L158 Benchmark]: Toolchain (without parser) took 878.49ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 57.5MB in the end (delta: 35.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-28 03:03:37,849 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 117.4MB. Free memory was 74.8MB in the beginning and 74.7MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:03:37,850 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.62ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 82.1MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:03:37,850 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.22ms. Allocated memory is still 117.4MB. Free memory was 81.8MB in the beginning and 81.0MB in the end (delta: 847.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:03:37,851 INFO L158 Benchmark]: Boogie Preprocessor took 51.66ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 79.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:03:37,852 INFO L158 Benchmark]: RCFGBuilder took 275.69ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 70.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:03:37,853 INFO L158 Benchmark]: TraceAbstraction took 262.33ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 57.8MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:03:37,853 INFO L158 Benchmark]: Witness Printer took 6.41ms. Allocated memory is still 117.4MB. Free memory was 57.8MB in the beginning and 57.5MB in the end (delta: 274.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:03:37,857 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.62ms. Allocated memory is still 117.4MB. Free memory was 74.8MB in the beginning and 74.7MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.62ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 82.1MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.22ms. Allocated memory is still 117.4MB. Free memory was 81.8MB in the beginning and 81.0MB in the end (delta: 847.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.66ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 79.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 275.69ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 70.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 262.33ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 57.8MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Witness Printer took 6.41ms. Allocated memory is still 117.4MB. Free memory was 57.8MB in the beginning and 57.5MB in the end (delta: 274.2kB). 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: 4]: 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 8, overapproximation of someBinaryLONGDOUBLEComparisonOperation at line 11. Possible FailurePath: [L8] long double x = 1.0/7.0; [L9] long long res = 0; [L11] int i = 1; VAL [i=1, res=0] [L11] COND FALSE !(x != 0) VAL [i=1, res=0] [L17] CALL __VERIFIER_assert(res == 67050) [L4] COND TRUE !(cond) [L4] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-28 03:03:37,882 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/digits_for.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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_5f87e4fe-0145-43e6-9474-211dc10ff767/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 ae5df297f2d3ee5d728aff1b63a3afef9bfbadb73abd56462b4581e636fe830d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:03:40,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:03:40,733 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-28 03:03:40,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:03:40,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:03:40,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:03:40,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:03:40,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:03:40,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:03:40,785 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:03:40,786 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:03:40,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:03:40,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:03:40,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:03:40,787 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:03:40,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:03:40,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:03:40,787 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:03:40,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:03:40,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:03:40,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:03:40,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:03:40,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:03:40,787 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:03:40,788 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-28 03:03:40,788 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-28 03:03:40,788 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:03:40,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:03:40,789 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:03:40,789 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:03:40,789 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:03:40,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:03:40,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:03:40,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:03:40,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:03:40,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:03:40,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:03:40,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:03:40,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:03:40,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:03:40,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:03:40,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:03:40,791 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:03:40,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:03:40,791 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-28 03:03:40,791 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-28 03:03:40,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:03:40,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:03:40,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:03:40,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:03:40,792 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_5f87e4fe-0145-43e6-9474-211dc10ff767/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 -> ae5df297f2d3ee5d728aff1b63a3afef9bfbadb73abd56462b4581e636fe830d [2024-11-28 03:03:41,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:03:41,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:03:41,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:03:41,140 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:03:41,141 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:03:41,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/floats-esbmc-regression/digits_for.c [2024-11-28 03:03:44,273 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/data/104167ac8/369719d18d614e5c8160f3d46379666c/FLAG0ce61c0aa [2024-11-28 03:03:44,585 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:03:44,586 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/sv-benchmarks/c/floats-esbmc-regression/digits_for.c [2024-11-28 03:03:44,607 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/data/104167ac8/369719d18d614e5c8160f3d46379666c/FLAG0ce61c0aa [2024-11-28 03:03:44,633 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/data/104167ac8/369719d18d614e5c8160f3d46379666c [2024-11-28 03:03:44,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:03:44,639 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:03:44,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:03:44,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:03:44,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:03:44,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:03:44" (1/1) ... [2024-11-28 03:03:44,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@640f5c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:44, skipping insertion in model container [2024-11-28 03:03:44,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:03:44" (1/1) ... [2024-11-28 03:03:44,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:03:44,861 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_5f87e4fe-0145-43e6-9474-211dc10ff767/sv-benchmarks/c/floats-esbmc-regression/digits_for.c[315,328] [2024-11-28 03:03:44,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:03:44,910 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:03:44,922 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_5f87e4fe-0145-43e6-9474-211dc10ff767/sv-benchmarks/c/floats-esbmc-regression/digits_for.c[315,328] [2024-11-28 03:03:44,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:03:44,956 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:03:44,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:44 WrapperNode [2024-11-28 03:03:44,957 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:03:44,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:03:44,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:03:44,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:03:44,967 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:03:44" (1/1) ... [2024-11-28 03:03:44,979 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:03:44" (1/1) ... [2024-11-28 03:03:44,999 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2024-11-28 03:03:45,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:03:45,002 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:03:45,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:03:45,003 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:03:45,013 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:44" (1/1) ... [2024-11-28 03:03:45,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:44" (1/1) ... [2024-11-28 03:03:45,017 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:44" (1/1) ... [2024-11-28 03:03:45,029 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:03:45,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:44" (1/1) ... [2024-11-28 03:03:45,030 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:44" (1/1) ... [2024-11-28 03:03:45,037 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:44" (1/1) ... [2024-11-28 03:03:45,038 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:44" (1/1) ... [2024-11-28 03:03:45,041 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:44" (1/1) ... [2024-11-28 03:03:45,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:44" (1/1) ... [2024-11-28 03:03:45,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:44" (1/1) ... [2024-11-28 03:03:45,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:03:45,047 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:03:45,047 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:03:45,047 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:03:45,048 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:44" (1/1) ... [2024-11-28 03:03:45,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:03:45,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:03:45,090 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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:03:45,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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:03:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:03:45,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:03:45,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:03:45,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-28 03:03:45,208 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:03:45,210 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:03:49,469 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-11-28 03:03:49,469 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:03:49,479 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:03:49,479 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-28 03:03:49,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:03:49 BoogieIcfgContainer [2024-11-28 03:03:49,480 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:03:49,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:03:49,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:03:49,490 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:03:49,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:03:44" (1/3) ... [2024-11-28 03:03:49,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109c6c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:03:49, skipping insertion in model container [2024-11-28 03:03:49,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:03:44" (2/3) ... [2024-11-28 03:03:49,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109c6c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:03:49, skipping insertion in model container [2024-11-28 03:03:49,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:03:49" (3/3) ... [2024-11-28 03:03:49,493 INFO L128 eAbstractionObserver]: Analyzing ICFG digits_for.c [2024-11-28 03:03:49,511 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:03:49,512 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG digits_for.c that has 1 procedures, 12 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 03:03:49,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:03:49,578 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;@3d532244, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:03:49,578 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 03:03:49,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:03:49,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-28 03:03:49,589 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:49,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-28 03:03:49,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:03:49,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:49,597 INFO L85 PathProgramCache]: Analyzing trace with hash 889664619, now seen corresponding path program 1 times [2024-11-28 03:03:49,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:03:49,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119801467] [2024-11-28 03:03:49,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:49,611 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:03:49,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:03:49,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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:03:49,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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:03:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:49,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 03:03:49,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:03:49,816 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:03:49,816 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 03:03:49,817 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:03:49,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119801467] [2024-11-28 03:03:49,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119801467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:03:49,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:03:49,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:03:49,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923200826] [2024-11-28 03:03:49,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:03:49,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:03:49,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:03:49,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:03:49,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:03:49,852 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:03:53,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:03:56,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:03:56,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:03:56,353 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-11-28 03:03:56,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:03:56,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-28 03:03:56,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:03:56,362 INFO L225 Difference]: With dead ends: 22 [2024-11-28 03:03:56,362 INFO L226 Difference]: Without dead ends: 10 [2024-11-28 03:03:56,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:03:56,368 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-28 03:03:56,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 16 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2024-11-28 03:03:56,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-28 03:03:56,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-28 03:03:56,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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:03:56,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-28 03:03:56,403 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2024-11-28 03:03:56,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:03:56,404 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-28 03:03:56,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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:03:56,404 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-28 03:03:56,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-28 03:03:56,404 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:03:56,404 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:03:56,409 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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)] Ended with exit code 0 [2024-11-28 03:03:56,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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:03:56,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:03:56,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:03:56,606 INFO L85 PathProgramCache]: Analyzing trace with hash 207982255, now seen corresponding path program 1 times [2024-11-28 03:03:56,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:03:56,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026325546] [2024-11-28 03:03:56,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:03:56,607 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:03:56,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:03:56,609 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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:03:56,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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:03:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:03:57,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-28 03:03:57,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:03:58,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:03:58,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:04:06,290 WARN L286 SmtUtils]: Spent 7.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:04:10,325 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2024-11-28 03:04:22,242 WARN L286 SmtUtils]: Spent 8.08s 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:04:22,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-28 03:04:22,434 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:04:22,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026325546] [2024-11-28 03:04:22,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026325546] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:04:22,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:04:22,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-28 03:04:22,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972117599] [2024-11-28 03:04:22,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:04:22,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:04:22,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:04:22,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:04:22,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=18, Unknown=1, NotChecked=8, Total=42 [2024-11-28 03:04:22,437 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:04:23,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:04:28,035 WARN L873 $PredicateComparison]: unable to prove that (and (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-28 03:04:32,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:04:36,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.32s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:04:40,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:04:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:04:40,805 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-11-28 03:04:40,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:04:40,807 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-28 03:04:40,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:04:40,808 INFO L225 Difference]: With dead ends: 17 [2024-11-28 03:04:40,808 INFO L226 Difference]: Without dead ends: 13 [2024-11-28 03:04:40,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=23, Invalid=25, Unknown=2, NotChecked=22, Total=72 [2024-11-28 03:04:40,809 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2024-11-28 03:04:40,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 13 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 1 Unknown, 18 Unchecked, 14.2s Time] [2024-11-28 03:04:40,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-28 03:04:40,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-28 03:04:40,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:04:40,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-28 03:04:40,814 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2024-11-28 03:04:40,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:04:40,815 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-28 03:04:40,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:04:40,815 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-28 03:04:40,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-28 03:04:40,816 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:04:40,816 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2024-11-28 03:04:40,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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:04:41,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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:04:41,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:04:41,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:04:41,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1979056183, now seen corresponding path program 2 times [2024-11-28 03:04:41,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:04:41,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133658316] [2024-11-28 03:04:41,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:04:41,018 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:04:41,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:04:41,020 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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:04:41,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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:04:42,809 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:04:42,809 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:04:42,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 03:04:42,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:04:53,699 WARN L286 SmtUtils]: Spent 7.93s 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:04:57,765 WARN L873 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-28 03:05:05,988 WARN L286 SmtUtils]: Spent 8.20s 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:05:14,613 WARN L286 SmtUtils]: Spent 8.60s 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:05:18,712 WARN L873 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-28 03:05:18,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-28 03:05:18,720 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:05:26,960 WARN L286 SmtUtils]: Spent 8.11s 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:05:31,005 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2024-11-28 03:05:35,046 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2024-11-28 03:05:43,142 WARN L286 SmtUtils]: Spent 8.09s 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:05:51,330 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:05:55,414 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2024-11-28 03:05:59,497 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2024-11-28 03:06:07,678 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:06:15,954 WARN L286 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:06:20,098 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2024-11-28 03:06:24,251 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2024-11-28 03:06:32,543 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:06:40,781 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:06:44,903 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2024-11-28 03:06:49,021 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2024-11-28 03:06:49,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-11-28 03:06:49,022 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:06:49,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133658316] [2024-11-28 03:06:49,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133658316] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:06:49,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:06:49,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-28 03:06:49,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469645683] [2024-11-28 03:06:49,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:06:49,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-28 03:06:49,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:06:49,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-28 03:06:49,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=19, Unknown=10, NotChecked=78, Total=132 [2024-11-28 03:06:49,024 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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:06:53,182 WARN L873 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-28 03:06:57,356 WARN L873 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-28 03:07:01,437 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-28 03:07:05,526 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-28 03:07:09,621 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= (let ((.cse1 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse0) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse1))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-28 03:07:13,725 WARN L873 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-28 03:07:15,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:07:20,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:07:24,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:07:28,346 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:07:32,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:07:36,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:07:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:07:36,402 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2024-11-28 03:07:36,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:07:36,470 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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) Word has length 12 [2024-11-28 03:07:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:07:36,470 INFO L225 Difference]: With dead ends: 20 [2024-11-28 03:07:36,470 INFO L226 Difference]: Without dead ends: 16 [2024-11-28 03:07:36,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 68.2s TimeCoverageRelationStatistics Valid=35, Invalid=23, Unknown=16, NotChecked=198, Total=272 [2024-11-28 03:07:36,472 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 22.7s IncrementalHoareTripleChecker+Time [2024-11-28 03:07:36,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 5 Unknown, 121 Unchecked, 22.7s Time] [2024-11-28 03:07:36,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-28 03:07:36,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-28 03:07:36,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 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:07:36,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-28 03:07:36,482 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2024-11-28 03:07:36,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:07:36,483 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-28 03:07:36,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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:07:36,483 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-28 03:07:36,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-28 03:07:36,484 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:07:36,484 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2024-11-28 03:07:36,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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)] Ended with exit code 0 [2024-11-28 03:07:36,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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:07:36,685 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:07:36,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:07:36,685 INFO L85 PathProgramCache]: Analyzing trace with hash -858744965, now seen corresponding path program 3 times [2024-11-28 03:07:36,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:07:36,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176796265] [2024-11-28 03:07:36,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 03:07:36,686 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:07:36,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:07:36,690 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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:07:36,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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:07:40,845 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-28 03:07:40,845 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:07:40,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-28 03:07:40,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:07:52,898 WARN L286 SmtUtils]: Spent 8.24s 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:07:57,045 WARN L873 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-28 03:08:05,329 WARN L286 SmtUtils]: Spent 8.25s 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:08:13,912 WARN L286 SmtUtils]: Spent 8.53s 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:08:18,015 WARN L873 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-28 03:08:26,559 WARN L286 SmtUtils]: Spent 8.49s 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:08:35,486 WARN L286 SmtUtils]: Spent 8.87s 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:08:39,673 WARN L873 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-28 03:08:39,680 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2024-11-28 03:08:39,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:08:47,977 WARN L286 SmtUtils]: Spent 8.09s 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:08:52,030 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2024-11-28 03:08:56,082 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2024-11-28 03:09:08,587 WARN L286 SmtUtils]: Spent 8.11s 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:09:12,638 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (fp.eq |c_ULTIMATE.start_main_~x~0#1| .cse0) (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) .cse0)))) is different from false [2024-11-28 03:09:16,693 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (fp.eq |c_ULTIMATE.start_main_~x~0#1| .cse0) (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) .cse0)))) is different from true [2024-11-28 03:09:25,138 WARN L286 SmtUtils]: Spent 8.44s 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:09:33,433 WARN L286 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:09:37,527 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|))))) (.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (fp.eq .cse0 .cse1) (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))) .cse1))))) is different from false [2024-11-28 03:09:41,615 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|))))) (.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (fp.eq .cse0 .cse1) (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))) .cse1))))) is different from true [2024-11-28 03:09:49,965 WARN L286 SmtUtils]: Spent 8.35s 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:09:58,219 WARN L286 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:10:06,802 WARN L286 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:10:15,282 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:10:19,411 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3)))))) (.cse2 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))) .cse2)) (fp.eq .cse0 .cse2)))) is different from false [2024-11-28 03:10:23,536 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3)))))) (.cse2 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))) .cse2)) (fp.eq .cse0 .cse2)))) is different from true [2024-11-28 03:10:32,067 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:10:40,545 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:10:49,444 WARN L286 SmtUtils]: Spent 8.90s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:10:58,290 WARN L286 SmtUtils]: Spent 8.85s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:11:02,475 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32)))))) (.cse2 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))) .cse2)) (fp.eq .cse0 .cse2)))) is different from false [2024-11-28 03:11:06,664 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32)))))) (.cse2 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))) .cse2)) (fp.eq .cse0 .cse2)))) is different from true [2024-11-28 03:11:15,337 WARN L286 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:11:24,204 WARN L286 SmtUtils]: Spent 8.87s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:11:32,909 WARN L286 SmtUtils]: Spent 8.70s 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:11:41,764 WARN L286 SmtUtils]: Spent 8.85s 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:11:45,931 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse5))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3)))))) (.cse2 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))) .cse2)) (fp.eq .cse0 .cse2)))) is different from false [2024-11-28 03:11:50,096 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse5))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3)))))) (.cse2 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))) .cse2)) (fp.eq .cse0 .cse2)))) is different from true [2024-11-28 03:11:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2024-11-28 03:11:50,097 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:11:50,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176796265] [2024-11-28 03:11:50,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176796265] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:11:50,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:11:50,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-28 03:11:50,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454713519] [2024-11-28 03:11:50,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:11:50,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-28 03:11:50,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:11:50,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-28 03:11:50,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=20, Unknown=15, NotChecked=144, Total=210 [2024-11-28 03:11:50,099 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 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:11:54,348 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse5))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3)))))) (.cse2 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))) .cse2)) (fp.eq .cse0 .cse2)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-28 03:11:58,564 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32)))))) (.cse2 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))) .cse2)) (fp.eq .cse0 .cse2)))) (= ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-28 03:12:02,702 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0))))) |c_ULTIMATE.start_main_~x~0#1|) (let ((.cse2 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4)))))) (.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32)))) .cse3)) (fp.eq .cse2 .cse3))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-28 03:12:06,959 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0))))) |c_ULTIMATE.start_main_~x~0#1|) (let ((.cse2 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4)))))) (.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32)))) .cse3)) (fp.eq .cse2 .cse3))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-28 03:12:11,102 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|))))) (.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (fp.eq .cse0 .cse1) (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))) .cse1)))) (= (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-28 03:12:15,149 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0))))) |c_ULTIMATE.start_main_~x~0#1|) (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (fp.eq |c_ULTIMATE.start_main_~x~0#1| .cse4) (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) .cse4)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-28 03:12:19,260 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0))))) |c_ULTIMATE.start_main_~x~0#1|) (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (fp.eq |c_ULTIMATE.start_main_~x~0#1| .cse4) (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) .cse4)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-28 03:12:23,306 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2024-11-28 03:12:27,542 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2024-11-28 03:12:31,717 WARN L873 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-28 03:12:35,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:39,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:43,882 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:12:47,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:52,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:12:56,211 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:13:00,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:13:04,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:13:08,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-28 03:13:08,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 03:13:08,245 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2024-11-28 03:13:08,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:13:08,306 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-28 03:13:08,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 03:13:08,307 INFO L225 Difference]: With dead ends: 22 [2024-11-28 03:13:08,307 INFO L226 Difference]: Without dead ends: 18 [2024-11-28 03:13:08,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 106.5s TimeCoverageRelationStatistics Valid=45, Invalid=24, Unknown=25, NotChecked=368, Total=462 [2024-11-28 03:13:08,308 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 36.6s IncrementalHoareTripleChecker+Time [2024-11-28 03:13:08,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 9 Unknown, 193 Unchecked, 36.6s Time] [2024-11-28 03:13:08,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-28 03:13:08,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-11-28 03:13:08,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:13:08,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2024-11-28 03:13:08,315 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2024-11-28 03:13:08,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 03:13:08,315 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2024-11-28 03:13:08,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 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:13:08,316 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2024-11-28 03:13:08,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 03:13:08,316 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 03:13:08,316 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1] [2024-11-28 03:13:08,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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)] Ended with exit code 0 [2024-11-28 03:13:08,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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:13:08,517 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 03:13:08,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:13:08,517 INFO L85 PathProgramCache]: Analyzing trace with hash -681415233, now seen corresponding path program 4 times [2024-11-28 03:13:08,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-28 03:13:08,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790901830] [2024-11-28 03:13:08,518 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 03:13:08,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-28 03:13:08,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/bin/uautomizer-verify-aQ6SnzHsRB/mathsat [2024-11-28 03:13:08,520 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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:13:08,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5f87e4fe-0145-43e6-9474-211dc10ff767/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 (6)] Waiting until timeout for monitored process [2024-11-28 03:13:11,507 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 03:13:11,507 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:13:11,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-28 03:13:11,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:13:21,805 WARN L286 SmtUtils]: Spent 5.51s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:13:46,951 WARN L286 SmtUtils]: Spent 7.69s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-28 03:14:00,004 WARN L286 SmtUtils]: Spent 8.28s 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:14:04,119 WARN L851 $PredicateComparison]: unable to prove that (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) |c_ULTIMATE.start_main_~x~0#1|) is different from false [2024-11-28 03:14:08,243 WARN L873 $PredicateComparison]: unable to prove that (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) |c_ULTIMATE.start_main_~x~0#1|) is different from true [2024-11-28 03:14:16,511 WARN L286 SmtUtils]: Spent 8.27s 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:14:24,917 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:14:29,077 WARN L851 $PredicateComparison]: unable to prove that (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) |c_ULTIMATE.start_main_~x~0#1|) is different from false [2024-11-28 03:14:33,249 WARN L873 $PredicateComparison]: unable to prove that (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) |c_ULTIMATE.start_main_~x~0#1|) is different from true [2024-11-28 03:14:41,656 WARN L286 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:14:50,261 WARN L286 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:14:54,505 WARN L851 $PredicateComparison]: unable to prove that (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse5))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) |c_ULTIMATE.start_main_~x~0#1|) is different from false [2024-11-28 03:14:58,729 WARN L873 $PredicateComparison]: unable to prove that (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse5))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) |c_ULTIMATE.start_main_~x~0#1|) is different from true [2024-11-28 03:15:11,750 WARN L286 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:15:16,098 WARN L851 $PredicateComparison]: unable to prove that (exists ((currentRoundingMode RoundingMode)) (fp.eq (let ((.cse1 ((_ to_fp 15 113) currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))))) (fp.sub currentRoundingMode (fp.mul currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub currentRoundingMode (fp.mul currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub currentRoundingMode (fp.mul currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub currentRoundingMode (fp.mul currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub currentRoundingMode (fp.mul currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) currentRoundingMode (_ bv0 32)))) is different from false [2024-11-28 03:15:20,231 WARN L873 $PredicateComparison]: unable to prove that (exists ((currentRoundingMode RoundingMode)) (fp.eq (let ((.cse1 ((_ to_fp 15 113) currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))))) (fp.sub currentRoundingMode (fp.mul currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub currentRoundingMode (fp.mul currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub currentRoundingMode (fp.mul currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub currentRoundingMode (fp.mul currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub currentRoundingMode (fp.mul currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) currentRoundingMode (_ bv0 32)))) is different from true [2024-11-28 03:15:33,254 WARN L286 SmtUtils]: Spent 8.68s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:15:46,325 WARN L286 SmtUtils]: Spent 8.73s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:15:46,326 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2024-11-28 03:15:46,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:15:59,578 WARN L286 SmtUtils]: Spent 8.11s 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:16:03,615 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2024-11-28 03:16:07,657 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32))) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2024-11-28 03:16:15,749 WARN L286 SmtUtils]: Spent 8.09s 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:16:23,974 WARN L286 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:16:28,069 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2024-11-28 03:16:32,165 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2024-11-28 03:16:40,391 WARN L286 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:16:48,746 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:16:52,905 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2024-11-28 03:16:57,065 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2024-11-28 03:17:05,465 WARN L286 SmtUtils]: Spent 8.40s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:17:13,932 WARN L286 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:17:18,137 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2024-11-28 03:17:22,351 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2024-11-28 03:17:30,830 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:17:39,529 WARN L286 SmtUtils]: Spent 8.70s 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:17:43,824 WARN L851 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2024-11-28 03:17:48,118 WARN L873 $PredicateComparison]: unable to prove that (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2024-11-28 03:17:56,818 WARN L286 SmtUtils]: Spent 8.70s 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:18:09,885 WARN L286 SmtUtils]: Spent 8.70s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-28 03:18:14,029 WARN L851 $PredicateComparison]: unable to prove that (forall ((currentRoundingMode RoundingMode)) (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))))) (fp.sub currentRoundingMode (fp.mul currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub currentRoundingMode (fp.mul currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub currentRoundingMode (fp.mul currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub currentRoundingMode (fp.mul currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub currentRoundingMode (fp.mul currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) currentRoundingMode (_ bv0 32))))) is different from false [2024-11-28 03:18:18,376 WARN L873 $PredicateComparison]: unable to prove that (forall ((currentRoundingMode RoundingMode)) (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) currentRoundingMode (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) ((_ to_fp 11 53) currentRoundingMode 7.0))))) (fp.sub currentRoundingMode (fp.mul currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub currentRoundingMode (fp.mul currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub currentRoundingMode (fp.mul currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub currentRoundingMode (fp.mul currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub currentRoundingMode (fp.mul currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) currentRoundingMode (_ bv0 32))))) is different from true [2024-11-28 03:18:18,376 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 25 not checked. [2024-11-28 03:18:18,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-28 03:18:18,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790901830] [2024-11-28 03:18:18,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790901830] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:18:18,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-28 03:18:18,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2024-11-28 03:18:18,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348598854] [2024-11-28 03:18:18,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-28 03:18:18,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-28 03:18:18,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-28 03:18:18,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-28 03:18:18,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=16, Unknown=22, NotChecked=170, Total=240 [2024-11-28 03:18:18,378 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:18:22,733 WARN L851 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))) |c_ULTIMATE.start_main_~x~0#1|)) is different from false [2024-11-28 03:18:27,030 WARN L873 $PredicateComparison]: unable to prove that (and (not (fp.eq (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))) |c_ULTIMATE.start_main_~x~0#1|)) is different from true [2024-11-28 03:18:31,264 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (let ((.cse2 (let ((.cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))))) is different from false [2024-11-28 03:18:35,654 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (let ((.cse2 (let ((.cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse3) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-28 03:18:39,884 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))) |c_ULTIMATE.start_main_~x~0#1|))) is different from false [2024-11-28 03:18:44,174 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (not (fp.eq (let ((.cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))) |c_ULTIMATE.start_main_~x~0#1|))) is different from true [2024-11-28 03:18:48,422 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))))) is different from false [2024-11-28 03:18:52,712 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-28 03:18:57,017 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))))) is different from false [2024-11-28 03:19:01,202 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))))) is different from true [2024-11-28 03:19:05,546 WARN L851 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse5))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32))))) is different from false [2024-11-28 03:19:09,990 WARN L873 $PredicateComparison]: unable to prove that (and (= (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (let ((.cse5 ((_ to_fp 15 113) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) ((_ to_fp 11 53) c_currentRoundingMode 7.0))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse5))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse3))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32))))) is different from true