./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f9bb533a6ae968b56a3b4121531d019ea186c25a1e8156a6682080f16505ca3 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:23:12,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:23:13,051 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-28 20:23:13,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:23:13,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:23:13,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:23:13,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:23:13,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:23:13,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:23:13,081 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:23:13,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:23:13,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:23:13,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:23:13,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:23:13,084 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:23:13,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:23:13,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:23:13,086 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:23:13,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:23:13,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:23:13,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:23:13,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:23:13,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:23:13,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:23:13,089 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:23:13,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:23:13,090 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:23:13,090 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:23:13,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:23:13,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:23:13,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:23:13,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:23:13,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:23:13,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:23:13,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:23:13,093 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:23:13,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:23:13,093 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:23:13,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:23:13,093 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:23:13,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:23:13,094 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:23:13,094 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f9bb533a6ae968b56a3b4121531d019ea186c25a1e8156a6682080f16505ca3 [2023-11-28 20:23:13,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:23:13,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:23:13,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:23:13,357 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:23:13,357 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:23:13,358 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c [2023-11-28 20:23:16,301 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:23:16,468 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:23:16,469 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c [2023-11-28 20:23:16,476 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/data/bd08e9331/66e43f7b7f4a4c7ab1abd4fde69ed48f/FLAG91b47dd4f [2023-11-28 20:23:16,488 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/data/bd08e9331/66e43f7b7f4a4c7ab1abd4fde69ed48f [2023-11-28 20:23:16,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:23:16,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:23:16,494 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:23:16,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:23:16,499 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:23:16,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:23:16" (1/1) ... [2023-11-28 20:23:16,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27eb99c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:16, skipping insertion in model container [2023-11-28 20:23:16,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:23:16" (1/1) ... [2023-11-28 20:23:16,521 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:23:16,672 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c[321,334] [2023-11-28 20:23:16,696 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:23:16,707 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:23:16,720 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c[321,334] [2023-11-28 20:23:16,725 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:23:16,740 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:23:16,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:16 WrapperNode [2023-11-28 20:23:16,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:23:16,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:23:16,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:23:16,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:23:16,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:16" (1/1) ... [2023-11-28 20:23:16,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:16" (1/1) ... [2023-11-28 20:23:16,779 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 30 [2023-11-28 20:23:16,779 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:23:16,780 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:23:16,780 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:23:16,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:23:16,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:16" (1/1) ... [2023-11-28 20:23:16,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:16" (1/1) ... [2023-11-28 20:23:16,793 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:16" (1/1) ... [2023-11-28 20:23:16,805 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-28 20:23:16,805 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:16" (1/1) ... [2023-11-28 20:23:16,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:16" (1/1) ... [2023-11-28 20:23:16,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:16" (1/1) ... [2023-11-28 20:23:16,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:16" (1/1) ... [2023-11-28 20:23:16,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:16" (1/1) ... [2023-11-28 20:23:16,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:16" (1/1) ... [2023-11-28 20:23:16,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:23:16,818 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:23:16,818 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:23:16,818 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:23:16,819 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:16" (1/1) ... [2023-11-28 20:23:16,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:23:16,835 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:23:16,850 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:23:16,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:23:16,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:23:16,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:23:16,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:23:16,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 20:23:16,966 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:23:16,968 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:23:17,055 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:23:17,079 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:23:17,079 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:23:17,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:23:17 BoogieIcfgContainer [2023-11-28 20:23:17,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:23:17,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:23:17,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:23:17,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:23:17,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:23:16" (1/3) ... [2023-11-28 20:23:17,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef276ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:23:17, skipping insertion in model container [2023-11-28 20:23:17,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:16" (2/3) ... [2023-11-28 20:23:17,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef276ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:23:17, skipping insertion in model container [2023-11-28 20:23:17,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:23:17" (3/3) ... [2023-11-28 20:23:17,089 INFO L112 eAbstractionObserver]: Analyzing ICFG digits_bad_while.c [2023-11-28 20:23:17,105 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:23:17,105 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:23:17,144 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:23:17,150 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@f691756, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:23:17,151 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:23:17,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:17,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-28 20:23:17,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:23:17,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:23:17,163 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:23:17,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:17,170 INFO L85 PathProgramCache]: Analyzing trace with hash 57541414, now seen corresponding path program 1 times [2023-11-28 20:23:17,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:23:17,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147782276] [2023-11-28 20:23:17,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:17,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:23:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:23:17,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 20:23:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 20:23:17,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 20:23:17,309 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 20:23:17,310 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-28 20:23:17,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:23:17,316 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-11-28 20:23:17,321 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 20:23:17,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:23:17 BoogieIcfgContainer [2023-11-28 20:23:17,336 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 20:23:17,337 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 20:23:17,337 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 20:23:17,337 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 20:23:17,338 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:23:17" (3/4) ... [2023-11-28 20:23:17,340 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 20:23:17,341 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 20:23:17,343 INFO L158 Benchmark]: Toolchain (without parser) took 849.90ms. Allocated memory is still 151.0MB. Free memory was 114.4MB in the beginning and 76.2MB in the end (delta: 38.2MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-11-28 20:23:17,343 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:23:17,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.63ms. Allocated memory is still 151.0MB. Free memory was 114.1MB in the beginning and 103.9MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-28 20:23:17,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.25ms. Allocated memory is still 151.0MB. Free memory was 103.9MB in the beginning and 102.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:23:17,345 INFO L158 Benchmark]: Boogie Preprocessor took 36.76ms. Allocated memory is still 151.0MB. Free memory was 102.4MB in the beginning and 100.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:23:17,346 INFO L158 Benchmark]: RCFGBuilder took 262.30ms. Allocated memory is still 151.0MB. Free memory was 100.6MB in the beginning and 90.3MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-28 20:23:17,346 INFO L158 Benchmark]: TraceAbstraction took 253.52ms. Allocated memory is still 151.0MB. Free memory was 89.6MB in the beginning and 76.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-28 20:23:17,347 INFO L158 Benchmark]: Witness Printer took 4.43ms. Allocated memory is still 151.0MB. Free memory was 76.5MB in the beginning and 76.2MB in the end (delta: 255.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:23:17,350 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.17ms. Allocated memory is still 151.0MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.63ms. Allocated memory is still 151.0MB. Free memory was 114.1MB in the beginning and 103.9MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.25ms. Allocated memory is still 151.0MB. Free memory was 103.9MB in the beginning and 102.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.76ms. Allocated memory is still 151.0MB. Free memory was 102.4MB in the beginning and 100.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 262.30ms. Allocated memory is still 151.0MB. Free memory was 100.6MB in the beginning and 90.3MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 253.52ms. Allocated memory is still 151.0MB. Free memory was 89.6MB in the beginning and 76.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 4.43ms. Allocated memory is still 151.0MB. Free memory was 76.5MB in the beginning and 76.2MB in the end (delta: 255.5kB). 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 someBinaryLONGDOUBLEComparisonOperation at line 12, overapproximation of someBinaryArithmeticDOUBLEoperation at line 8. Possible FailurePath: [L8] long double x = 1.0/7.0; [L9] long long res = 0; [L11] int i = 1; VAL [i=1, res=0] [L12] COND FALSE !(x != 0) VAL [i=1, res=0] [L19] CALL __VERIFIER_assert(res > 67050) [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 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=8occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-28 20:23:17,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f9bb533a6ae968b56a3b4121531d019ea186c25a1e8156a6682080f16505ca3 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:23:19,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:23:19,478 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-28 20:23:19,497 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:23:19,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:23:19,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:23:19,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:23:19,532 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:23:19,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 20:23:19,533 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 20:23:19,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:23:19,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:23:19,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:23:19,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:23:19,537 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:23:19,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:23:19,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:23:19,538 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:23:19,539 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:23:19,539 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:23:19,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:23:19,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:23:19,541 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:23:19,541 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 20:23:19,542 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 20:23:19,542 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 20:23:19,543 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:23:19,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:23:19,544 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:23:19,544 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:23:19,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:23:19,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 20:23:19,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:23:19,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:23:19,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:23:19,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:23:19,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:23:19,547 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 20:23:19,547 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 20:23:19,547 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:23:19,547 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:23:19,548 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:23:19,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:23:19,548 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:23:19,548 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 20:23:19,549 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f9bb533a6ae968b56a3b4121531d019ea186c25a1e8156a6682080f16505ca3 [2023-11-28 20:23:19,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:23:19,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:23:19,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:23:19,954 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:23:19,954 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:23:19,956 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c [2023-11-28 20:23:23,091 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:23:23,316 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:23:23,317 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c [2023-11-28 20:23:23,325 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/data/702ab1a04/585dce11484141e6bd9344316c9830cf/FLAGe56a057a4 [2023-11-28 20:23:23,341 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/data/702ab1a04/585dce11484141e6bd9344316c9830cf [2023-11-28 20:23:23,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:23:23,346 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:23:23,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:23:23,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:23:23,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:23:23,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:23:23" (1/1) ... [2023-11-28 20:23:23,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cb6e519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:23, skipping insertion in model container [2023-11-28 20:23:23,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:23:23" (1/1) ... [2023-11-28 20:23:23,378 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:23:23,550 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c[321,334] [2023-11-28 20:23:23,569 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:23:23,586 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:23:23,601 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/sv-benchmarks/c/floats-esbmc-regression/digits_bad_while.c[321,334] [2023-11-28 20:23:23,605 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:23:23,624 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:23:23,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:23 WrapperNode [2023-11-28 20:23:23,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:23:23,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:23:23,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:23:23,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:23:23,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:23" (1/1) ... [2023-11-28 20:23:23,646 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:23" (1/1) ... [2023-11-28 20:23:23,666 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2023-11-28 20:23:23,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:23:23,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:23:23,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:23:23,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:23:23,681 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:23" (1/1) ... [2023-11-28 20:23:23,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:23" (1/1) ... [2023-11-28 20:23:23,685 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:23" (1/1) ... [2023-11-28 20:23:23,699 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-28 20:23:23,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:23" (1/1) ... [2023-11-28 20:23:23,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:23" (1/1) ... [2023-11-28 20:23:23,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:23" (1/1) ... [2023-11-28 20:23:23,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:23" (1/1) ... [2023-11-28 20:23:23,714 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:23" (1/1) ... [2023-11-28 20:23:23,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:23" (1/1) ... [2023-11-28 20:23:23,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:23:23,720 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:23:23,720 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:23:23,720 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:23:23,721 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:23" (1/1) ... [2023-11-28 20:23:23,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:23:23,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:23:23,755 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:23:23,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:23:23,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:23:23,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:23:23,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:23:23,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 20:23:23,880 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:23:23,882 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:23:28,115 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:23:28,147 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:23:28,148 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-28 20:23:28,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:23:28 BoogieIcfgContainer [2023-11-28 20:23:28,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:23:28,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:23:28,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:23:28,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:23:28,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:23:23" (1/3) ... [2023-11-28 20:23:28,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119f5831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:23:28, skipping insertion in model container [2023-11-28 20:23:28,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:23:23" (2/3) ... [2023-11-28 20:23:28,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119f5831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:23:28, skipping insertion in model container [2023-11-28 20:23:28,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:23:28" (3/3) ... [2023-11-28 20:23:28,161 INFO L112 eAbstractionObserver]: Analyzing ICFG digits_bad_while.c [2023-11-28 20:23:28,183 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:23:28,183 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-28 20:23:28,237 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:23:28,245 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6d9cb7a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:23:28,246 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-28 20:23:28,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:28,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-28 20:23:28,257 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:23:28,258 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 20:23:28,259 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:23:28,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:28,265 INFO L85 PathProgramCache]: Analyzing trace with hash 57541414, now seen corresponding path program 1 times [2023-11-28 20:23:28,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:28,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453560613] [2023-11-28 20:23:28,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:28,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:28,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:28,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:23:28,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-28 20:23:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:28,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-28 20:23:28,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:28,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:23:28,483 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 20:23:28,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:28,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453560613] [2023-11-28 20:23:28,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453560613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:23:28,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:23:28,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:23:28,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962133337] [2023-11-28 20:23:28,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:23:28,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:23:28,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:28,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:23:28,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:23:28,524 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:31,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:23:32,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:23:32,203 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2023-11-28 20:23:32,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:23:32,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2023-11-28 20:23:32,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:23:32,212 INFO L225 Difference]: With dead ends: 15 [2023-11-28 20:23:32,213 INFO L226 Difference]: Without dead ends: 7 [2023-11-28 20:23:32,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:23:32,220 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-28 20:23:32,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-28 20:23:32,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2023-11-28 20:23:32,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2023-11-28 20:23:32,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:32,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2023-11-28 20:23:32,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2023-11-28 20:23:32,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:23:32,251 INFO L495 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2023-11-28 20:23:32,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:23:32,251 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2023-11-28 20:23:32,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-28 20:23:32,252 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:23:32,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-28 20:23:32,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-28 20:23:32,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:32,453 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:23:32,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:23:32,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1785449205, now seen corresponding path program 1 times [2023-11-28 20:23:32,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:23:32,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692056104] [2023-11-28 20:23:32,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:23:32,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:23:32,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:23:32,457 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:23:32,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-28 20:23:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:23:33,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 20:23:33,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:23:35,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:23:35,254 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:23:43,723 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:23:47,779 WARN L854 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2023-11-28 20:23:51,836 WARN L876 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2023-11-28 20:23:51,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-28 20:23:51,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:23:51,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692056104] [2023-11-28 20:23:51,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1692056104] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:23:51,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:23:51,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-11-28 20:23:51,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261614929] [2023-11-28 20:23:51,839 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:23:51,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:23:51,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:23:51,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:23:51,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=11, Unknown=2, NotChecked=6, Total=30 [2023-11-28 20:23:51,842 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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) [2023-11-28 20:23:55,910 WARN L876 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ 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 [2023-11-28 20:23:59,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:24:03,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:24:07,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:24:11,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:24:15,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:24:15,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:24:15,798 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2023-11-28 20:24:15,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 20:24:15,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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) Word has length 6 [2023-11-28 20:24:15,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:24:15,881 INFO L225 Difference]: With dead ends: 12 [2023-11-28 20:24:15,881 INFO L226 Difference]: Without dead ends: 8 [2023-11-28 20:24:15,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=13, Invalid=12, Unknown=3, NotChecked=14, Total=42 [2023-11-28 20:24:15,883 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 19.9s IncrementalHoareTripleChecker+Time [2023-11-28 20:24:15,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 4 Unknown, 9 Unchecked, 19.9s Time] [2023-11-28 20:24:15,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-11-28 20:24:15,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-11-28 20:24:15,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:24:15,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-11-28 20:24:15,888 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2023-11-28 20:24:15,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:24:15,888 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-11-28 20:24:15,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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) [2023-11-28 20:24:15,888 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-11-28 20:24:15,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-28 20:24:15,889 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:24:15,889 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2023-11-28 20:24:15,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-28 20:24:16,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:24:16,090 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:24:16,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:16,091 INFO L85 PathProgramCache]: Analyzing trace with hash -483984122, now seen corresponding path program 2 times [2023-11-28 20:24:16,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:24:16,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935876014] [2023-11-28 20:24:16,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 20:24:16,093 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:24:16,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:24:16,094 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:24:16,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-28 20:24:17,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-28 20:24:17,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:24:17,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 20:24:17,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:24:28,128 WARN L293 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:24:48,595 WARN L293 SmtUtils]: Spent 7.02s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:24:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:24:48,606 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:25:01,026 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:25:05,094 WARN L854 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2023-11-28 20:25:09,165 WARN L876 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2023-11-28 20:25:17,484 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:25:21,625 WARN L854 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ 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 [2023-11-28 20:25:25,766 WARN L876 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ 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 [2023-11-28 20:25:25,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-28 20:25:25,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:25:25,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935876014] [2023-11-28 20:25:25,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935876014] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:25:25,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:25:25,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-11-28 20:25:25,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015687956] [2023-11-28 20:25:25,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:25:25,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-28 20:25:25,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:25:25,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-28 20:25:25,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=16, Unknown=6, NotChecked=18, Total=56 [2023-11-28 20:25:25,771 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:25:29,926 WARN L854 $PredicateComparison]: unable to prove that (and (= ((_ 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|) (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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ 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)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-11-28 20:25:34,070 WARN L876 $PredicateComparison]: unable to prove that (and (= ((_ 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|) (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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ 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)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-28 20:25:38,140 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) (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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-28 20:25:42,213 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) (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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-28 20:25:46,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:25:49,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:25:54,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:25:58,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:25:59,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:26:03,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:26:07,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:26:11,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:26:11,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:26:11,819 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2023-11-28 20:26:11,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 20:26:11,901 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-28 20:26:11,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:26:11,901 INFO L225 Difference]: With dead ends: 13 [2023-11-28 20:26:11,901 INFO L226 Difference]: Without dead ends: 9 [2023-11-28 20:26:11,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 59.3s TimeCoverageRelationStatistics Valid=20, Invalid=16, Unknown=10, NotChecked=44, Total=90 [2023-11-28 20:26:11,903 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 29.6s IncrementalHoareTripleChecker+Time [2023-11-28 20:26:11,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 6 Unknown, 23 Unchecked, 29.6s Time] [2023-11-28 20:26:11,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-11-28 20:26:11,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-11-28 20:26:11,907 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) [2023-11-28 20:26:11,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2023-11-28 20:26:11,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2023-11-28 20:26:11,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:26:11,908 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2023-11-28 20:26:11,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:26:11,909 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2023-11-28 20:26:11,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-28 20:26:11,909 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:26:11,909 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2023-11-28 20:26:11,937 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-28 20:26:12,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:26:12,110 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:26:12,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:26:12,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2116940523, now seen corresponding path program 3 times [2023-11-28 20:26:12,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:26:12,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744219849] [2023-11-28 20:26:12,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-28 20:26:12,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:26:12,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:26:12,114 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:26:12,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-28 20:26:14,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-28 20:26:14,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:26:14,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 20:26:14,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:26:24,281 WARN L293 SmtUtils]: Spent 7.98s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:26:28,445 WARN L876 $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 ((_ 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)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-28 20:26:37,476 WARN L293 SmtUtils]: Spent 9.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:26:41,614 WARN L876 $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 ((_ 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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-28 20:26:41,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-11-28 20:26:41,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:26:49,982 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:26:54,055 WARN L854 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2023-11-28 20:26:58,132 WARN L876 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2023-11-28 20:27:06,454 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:27:10,617 WARN L854 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ 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 [2023-11-28 20:27:14,773 WARN L876 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ 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 [2023-11-28 20:27:23,350 WARN L293 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:27:27,648 WARN L854 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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 [2023-11-28 20:27:31,952 WARN L876 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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 [2023-11-28 20:27:31,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-28 20:27:31,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:27:31,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744219849] [2023-11-28 20:27:31,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744219849] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:27:31,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:27:31,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-11-28 20:27:31,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259381470] [2023-11-28 20:27:31,954 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:27:31,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 20:27:31,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:27:31,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 20:27:31,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=13, Unknown=8, NotChecked=50, Total=90 [2023-11-28 20:27:31,956 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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) [2023-11-28 20:27:36,315 WARN L876 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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)))) (= ((_ 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 [2023-11-28 20:27:40,501 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) (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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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 [2023-11-28 20:27:44,656 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) (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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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 [2023-11-28 20:27:48,735 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (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 ((_ 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))))) |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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-28 20:27:52,855 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (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 ((_ 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))))) |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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-28 20:27:57,014 WARN L876 $PredicateComparison]: unable to prove that (and (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= (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 ((_ 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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-28 20:28:01,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:28:05,320 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 [] [2023-11-28 20:28:09,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:28:09,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:28:09,325 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2023-11-28 20:28:09,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:28:09,417 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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 [2023-11-28 20:28:09,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:28:09,418 INFO L225 Difference]: With dead ends: 14 [2023-11-28 20:28:09,418 INFO L226 Difference]: Without dead ends: 10 [2023-11-28 20:28:09,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 60.4s TimeCoverageRelationStatistics Valid=27, Invalid=15, Unknown=14, NotChecked=126, Total=182 [2023-11-28 20:28:09,420 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2023-11-28 20:28:09,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 3 Unknown, 59 Unchecked, 12.3s Time] [2023-11-28 20:28:09,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-11-28 20:28:09,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-11-28 20:28:09,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:28:09,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2023-11-28 20:28:09,427 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2023-11-28 20:28:09,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:28:09,427 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2023-11-28 20:28:09,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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) [2023-11-28 20:28:09,428 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2023-11-28 20:28:09,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-28 20:28:09,428 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:28:09,429 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2023-11-28 20:28:09,480 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-28 20:28:09,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:28:09,630 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:28:09,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:28:09,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1198981402, now seen corresponding path program 4 times [2023-11-28 20:28:09,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:28:09,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163205612] [2023-11-28 20:28:09,632 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-28 20:28:09,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:28:09,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:28:09,634 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:28:09,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-28 20:28:12,286 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-28 20:28:12,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:28:12,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-28 20:28:12,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:28:23,558 WARN L293 SmtUtils]: Spent 8.42s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:28:27,773 WARN L876 $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 ((_ 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)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-28 20:28:36,556 WARN L293 SmtUtils]: Spent 8.76s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:28:41,000 WARN L876 $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 ((_ 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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-28 20:28:50,607 WARN L293 SmtUtils]: Spent 9.58s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:28:55,156 WARN L876 $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 ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-28 20:28:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-11-28 20:28:55,171 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:29:03,510 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:29:07,583 WARN L854 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2023-11-28 20:29:11,664 WARN L876 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2023-11-28 20:29:20,017 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:29:24,194 WARN L854 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ 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 [2023-11-28 20:29:28,367 WARN L876 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ 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 [2023-11-28 20:29:36,894 WARN L293 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:29:41,171 WARN L854 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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 [2023-11-28 20:29:45,452 WARN L876 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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 [2023-11-28 20:29:54,332 WARN L293 SmtUtils]: Spent 8.88s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:29:58,880 WARN L854 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2023-11-28 20:30:03,402 WARN L876 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2023-11-28 20:30:03,403 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2023-11-28 20:30:03,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:30:03,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163205612] [2023-11-28 20:30:03,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163205612] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:30:03,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:30:03,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-11-28 20:30:03,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909174881] [2023-11-28 20:30:03,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:30:03,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-28 20:30:03,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:30:03,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-28 20:30:03,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=14, Unknown=11, NotChecked=84, Total=132 [2023-11-28 20:30:03,406 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:30:08,020 WARN L876 $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 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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 ((_ 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 [2023-11-28 20:30:12,302 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) (not (fp.eq (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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-28 20:30:16,620 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) (not (fp.eq (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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-28 20:30:20,796 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (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 ((_ 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))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-28 20:30:25,009 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (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 ((_ 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))))) |c_ULTIMATE.start_main_~x~0#1|) (not (fp.eq (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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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))))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-28 20:30:29,095 WARN L854 $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 ((_ 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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) |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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-28 20:30:33,383 WARN L876 $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 ((_ 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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) |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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-28 20:30:37,648 WARN L876 $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 ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |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 [2023-11-28 20:30:41,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:30:45,958 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 [] [2023-11-28 20:30:49,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:30:49,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:30:49,963 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2023-11-28 20:30:50,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 20:30:50,059 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-28 20:30:50,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:30:50,060 INFO L225 Difference]: With dead ends: 15 [2023-11-28 20:30:50,060 INFO L226 Difference]: Without dead ends: 11 [2023-11-28 20:30:50,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 84.1s TimeCoverageRelationStatistics Valid=33, Invalid=16, Unknown=19, NotChecked=204, Total=272 [2023-11-28 20:30:50,061 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2023-11-28 20:30:50,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 3 Unknown, 88 Unchecked, 12.4s Time] [2023-11-28 20:30:50,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-11-28 20:30:50,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-11-28 20:30:50,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:30:50,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-11-28 20:30:50,066 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2023-11-28 20:30:50,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:30:50,066 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-11-28 20:30:50,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:30:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-11-28 20:30:50,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-28 20:30:50,067 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:30:50,067 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2023-11-28 20:30:50,119 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-28 20:30:50,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:30:50,268 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:30:50,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:30:50,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1487947573, now seen corresponding path program 5 times [2023-11-28 20:30:50,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:30:50,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922124844] [2023-11-28 20:30:50,269 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-28 20:30:50,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:30:50,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:30:50,270 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:30:50,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-28 20:30:56,930 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-28 20:30:56,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:30:57,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-28 20:30:57,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:31:06,980 WARN L876 $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 ((_ 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)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-28 20:31:15,951 WARN L293 SmtUtils]: Spent 8.93s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:31:20,173 WARN L876 $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 ((_ 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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-28 20:31:30,130 WARN L293 SmtUtils]: Spent 9.90s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:31:34,581 WARN L876 $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 ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-28 20:31:45,372 WARN L293 SmtUtils]: Spent 10.72s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:31:49,769 WARN L876 $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 ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (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)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-28 20:31:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2023-11-28 20:31:49,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:31:58,309 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:32:02,375 WARN L854 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2023-11-28 20:32:06,439 WARN L876 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from true [2023-11-28 20:32:14,355 WARN L293 SmtUtils]: Spent 7.91s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:32:22,705 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:32:26,921 WARN L854 $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 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse1)))))) .cse0)))) is different from false [2023-11-28 20:32:31,075 WARN L876 $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 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse1)))))) .cse0)))) is different from true [2023-11-28 20:32:39,707 WARN L293 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:32:48,780 WARN L293 SmtUtils]: Spent 9.07s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:32:53,030 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ 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| .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32))))) (.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (fp.eq .cse0 .cse1) (not (fp.eq (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))) .cse1))))) is different from false [2023-11-28 20:32:57,287 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ 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| .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32))))) (.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (fp.eq .cse0 .cse1) (not (fp.eq (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse2))))) .cse1))))) is different from true [2023-11-28 20:33:06,289 WARN L293 SmtUtils]: Spent 9.00s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:33:15,673 WARN L293 SmtUtils]: Spent 9.38s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:33:19,971 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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 (let ((.cse0 (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))))) .cse3)) (fp.eq .cse2 .cse3)))) is different from false [2023-11-28 20:33:24,271 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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 (let ((.cse0 (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))))) .cse3)) (fp.eq .cse2 .cse3)))) is different from true [2023-11-28 20:33:34,073 WARN L293 SmtUtils]: Spent 9.80s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:33:43,813 WARN L293 SmtUtils]: Spent 9.74s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:33:48,190 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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)))))) (.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (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))))) .cse3)) (fp.eq .cse2 .cse3)))) is different from false [2023-11-28 20:33:52,604 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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)))))) (.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (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))))) .cse3)) (fp.eq .cse2 .cse3)))) is different from true [2023-11-28 20:33:52,604 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2023-11-28 20:33:52,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 20:33:52,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922124844] [2023-11-28 20:33:52,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922124844] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-28 20:33:52,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-28 20:33:52,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-11-28 20:33:52,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463691874] [2023-11-28 20:33:52,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-28 20:33:52,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-28 20:33:52,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 20:33:52,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-28 20:33:52,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=15, Unknown=14, NotChecked=126, Total=182 [2023-11-28 20:33:52,607 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:33:57,081 WARN L876 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse2 (let ((.cse4 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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)))))) (.cse3 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (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))))) .cse3)) (fp.eq .cse2 .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))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-28 20:34:01,391 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) (let ((.cse3 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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)))))) (.cse4 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse2 (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))))) .cse4)) (fp.eq .cse3 .cse4))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-28 20:34:05,746 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= |c_ULTIMATE.start_main_~x~0#1| (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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) (let ((.cse3 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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)))))) (.cse4 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse2 (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))))) .cse4)) (fp.eq .cse3 .cse4))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-28 20:34:09,994 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (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 ((_ 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))))) |c_ULTIMATE.start_main_~x~0#1|) (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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32))))) (.cse4 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (fp.eq .cse3 .cse4) (not (fp.eq (let ((.cse5 (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 .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse5))))) .cse4)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-28 20:34:14,267 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (and (= (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 ((_ 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))))) |c_ULTIMATE.start_main_~x~0#1|) (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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32))))) (.cse4 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (fp.eq .cse3 .cse4) (not (fp.eq (let ((.cse5 (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 .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse5))))) .cse4)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-28 20:34:18,419 WARN L854 $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 ((_ 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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) |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 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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))))) .cse4)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-28 20:34:22,684 WARN L876 $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 ((_ 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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) |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 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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))))) .cse4)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-28 20:34:30,150 WARN L876 $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 ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32))))) |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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-28 20:34:34,526 WARN L876 $PredicateComparison]: unable to prove that (and (not (fp.eq |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (= (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 ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (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)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-28 20:34:39,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:34:43,268 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 [] [2023-11-28 20:34:47,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-28 20:34:47,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-28 20:34:47,271 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2023-11-28 20:34:47,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 20:34:47,361 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-28 20:34:47,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-28 20:34:47,361 INFO L225 Difference]: With dead ends: 16 [2023-11-28 20:34:47,361 INFO L226 Difference]: Without dead ends: 12 [2023-11-28 20:34:47,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 104.1s TimeCoverageRelationStatistics Valid=39, Invalid=18, Unknown=23, NotChecked=300, Total=380 [2023-11-28 20:34:47,363 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2023-11-28 20:34:47,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 3 Unknown, 121 Unchecked, 12.8s Time] [2023-11-28 20:34:47,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-11-28 20:34:47,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-11-28 20:34:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:34:47,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2023-11-28 20:34:47,368 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2023-11-28 20:34:47,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-28 20:34:47,368 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2023-11-28 20:34:47,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 20:34:47,369 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2023-11-28 20:34:47,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-28 20:34:47,369 INFO L187 NwaCegarLoop]: Found error trace [2023-11-28 20:34:47,369 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2023-11-28 20:34:47,423 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-28 20:34:47,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:34:47,570 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-28 20:34:47,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:34:47,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1116600122, now seen corresponding path program 6 times [2023-11-28 20:34:47,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 20:34:47,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850296945] [2023-11-28 20:34:47,571 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-28 20:34:47,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 20:34:47,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 20:34:47,572 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-28 20:34:47,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93ce653a-6b14-49a3-8eb0-d48157c0dc76/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-28 20:34:50,978 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-11-28 20:34:50,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 20:34:51,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-28 20:34:51,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 20:35:02,511 WARN L293 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:35:24,666 WARN L293 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-28 20:35:33,512 WARN L293 SmtUtils]: Spent 8.80s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:35:37,674 WARN L876 $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 ((_ 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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-28 20:35:47,020 WARN L293 SmtUtils]: Spent 9.29s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:35:51,247 WARN L876 $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 ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (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 ((_ fp.to_sbv 32) roundTowardZero .cse0) (_ bv10 32)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-28 20:36:01,225 WARN L293 SmtUtils]: Spent 9.93s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:36:05,687 WARN L876 $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 ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (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)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-28 20:36:16,387 WARN L293 SmtUtils]: Spent 10.65s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:36:21,254 WARN L876 $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 (let ((.cse6 ((_ 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 .cse6 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse6) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse5) (_ bv10 32))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse4) (_ bv10 32))))))) (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 (_ 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)))))) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2023-11-28 20:36:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2023-11-28 20:36:21,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-28 20:36:33,962 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:36:38,034 WARN L854 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))) ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) is different from false [2023-11-28 20:36:50,345 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:36:54,512 WARN L854 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ 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 [2023-11-28 20:36:58,663 WARN L876 $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 ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ 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 [2023-11-28 20:37:07,178 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:37:16,223 WARN L293 SmtUtils]: Spent 9.04s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:37:20,477 WARN L854 $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 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse1)))))) .cse0)))) is different from false [2023-11-28 20:37:24,725 WARN L876 $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 (let ((.cse2 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse1)))))) .cse0)))) is different from true [2023-11-28 20:37:33,560 WARN L293 SmtUtils]: Spent 8.83s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:37:42,990 WARN L293 SmtUtils]: Spent 9.43s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:37:47,421 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ 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| .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32))))) (.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (fp.eq .cse0 .cse1) (not (fp.eq (let ((.cse2 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))) .cse1))))) is different from false [2023-11-28 20:37:51,827 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ 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| .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32))))) (.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (fp.eq .cse0 .cse1) (not (fp.eq (let ((.cse2 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0)))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse4))))))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero .cse2) (_ bv10 32))))) .cse1))))) is different from true [2023-11-28 20:38:01,043 WARN L293 SmtUtils]: Spent 9.21s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:38:10,977 WARN L293 SmtUtils]: Spent 9.93s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:38:15,524 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse3 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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)))))) (.cse4 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (let ((.cse2 (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 (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0))))) .cse4)) (fp.eq .cse3 .cse4)))) is different from false [2023-11-28 20:38:20,054 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 15 113) c_currentRoundingMode (_ bv10 32)))) (let ((.cse3 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse1) ((_ to_fp 15 113) c_currentRoundingMode (bvmul ((_ fp.to_sbv 32) roundTowardZero |c_ULTIMATE.start_main_~x~0#1|) (_ bv10 32)))))) (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)))))) (.cse4 ((_ to_fp 15 113) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.eq (let ((.cse0 (let ((.cse2 (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 (_ bv10 32) ((_ fp.to_sbv 32) roundTowardZero .cse0))))) .cse4)) (fp.eq .cse3 .cse4)))) is different from true [2023-11-28 20:38:30,864 WARN L293 SmtUtils]: Spent 10.81s on a formula simplification that was a NOOP. DAG size: 23 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-28 20:38:40,905 WARN L293 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)