./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --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 bd7fa6dfe7a0889f513bad4c7cfc96eb426f92168ff26ce4409068874579f6bc --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 09:30:57,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:30:57,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:30:57,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:30:57,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:30:57,321 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:30:57,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:30:57,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:30:57,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:30:57,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:30:57,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:30:57,329 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:30:57,330 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:30:57,331 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:30:57,332 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:30:57,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:30:57,334 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:30:57,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:30:57,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:30:57,338 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:30:57,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:30:57,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:30:57,342 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:30:57,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:30:57,346 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:30:57,347 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:30:57,347 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:30:57,348 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:30:57,348 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:30:57,349 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:30:57,349 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:30:57,350 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:30:57,351 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:30:57,352 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:30:57,353 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:30:57,353 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:30:57,354 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:30:57,354 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:30:57,355 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:30:57,356 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:30:57,356 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:30:57,360 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 09:30:57,396 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:30:57,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:30:57,397 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:30:57,397 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:30:57,398 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:30:57,399 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:30:57,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:30:57,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:30:57,400 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:30:57,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:30:57,401 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:30:57,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:30:57,402 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:30:57,402 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:30:57,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 09:30:57,402 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:30:57,403 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 09:30:57,403 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:30:57,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:30:57,403 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:30:57,404 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 09:30:57,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:30:57,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:30:57,405 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:30:57,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:30:57,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:30:57,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:30:57,406 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 09:30:57,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:30:57,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:30:57,407 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 09:30:57,407 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 09:30:57,407 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 09:30:57,408 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/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_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> bd7fa6dfe7a0889f513bad4c7cfc96eb426f92168ff26ce4409068874579f6bc [2022-11-20 09:30:57,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:30:57,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:30:57,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:30:57,771 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:30:57,771 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:30:57,772 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2022-11-20 09:31:00,867 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:31:01,089 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:31:01,090 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2022-11-20 09:31:01,097 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/data/af8494aa8/d9f7affc987446f3b8b4aada215fd384/FLAGf06d34f2e [2022-11-20 09:31:01,117 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/data/af8494aa8/d9f7affc987446f3b8b4aada215fd384 [2022-11-20 09:31:01,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:31:01,125 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:31:01,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:31:01,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:31:01,133 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:31:01,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:31:01" (1/1) ... [2022-11-20 09:31:01,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25fd48ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:01, skipping insertion in model container [2022-11-20 09:31:01,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:31:01" (1/1) ... [2022-11-20 09:31:01,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:31:01,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:31:01,372 WARN L237 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_68533095-f6a5-4cc5-9982-a816b7327cd0/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c[472,485] [2022-11-20 09:31:01,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:31:01,417 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:31:01,437 WARN L237 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_68533095-f6a5-4cc5-9982-a816b7327cd0/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c[472,485] [2022-11-20 09:31:01,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:31:01,475 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:31:01,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:01 WrapperNode [2022-11-20 09:31:01,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:31:01,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:31:01,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:31:01,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:31:01,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:01" (1/1) ... [2022-11-20 09:31:01,497 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:01" (1/1) ... [2022-11-20 09:31:01,525 INFO L138 Inliner]: procedures = 15, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2022-11-20 09:31:01,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:31:01,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:31:01,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:31:01,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:31:01,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:01" (1/1) ... [2022-11-20 09:31:01,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:01" (1/1) ... [2022-11-20 09:31:01,549 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:01" (1/1) ... [2022-11-20 09:31:01,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:01" (1/1) ... [2022-11-20 09:31:01,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:01" (1/1) ... [2022-11-20 09:31:01,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:01" (1/1) ... [2022-11-20 09:31:01,567 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:01" (1/1) ... [2022-11-20 09:31:01,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:01" (1/1) ... [2022-11-20 09:31:01,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:31:01,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:31:01,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:31:01,574 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:31:01,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:01" (1/1) ... [2022-11-20 09:31:01,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:31:01,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:31:01,612 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:31:01,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:31:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:31:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:31:01,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:31:01,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:31:01,753 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:31:01,756 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:31:01,969 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:31:01,974 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:31:01,985 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 09:31:01,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:31:01 BoogieIcfgContainer [2022-11-20 09:31:01,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:31:01,990 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:31:01,991 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:31:01,994 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:31:01,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:31:01" (1/3) ... [2022-11-20 09:31:01,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2873192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:31:01, skipping insertion in model container [2022-11-20 09:31:01,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:01" (2/3) ... [2022-11-20 09:31:01,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2873192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:31:01, skipping insertion in model container [2022-11-20 09:31:01,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:31:01" (3/3) ... [2022-11-20 09:31:02,000 INFO L112 eAbstractionObserver]: Analyzing ICFG loop3.c [2022-11-20 09:31:02,020 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:31:02,021 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 09:31:02,086 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:31:02,094 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=LoopsAndPotentialCycles, 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;@2f31042d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:31:02,094 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 09:31:02,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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) [2022-11-20 09:31:02,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 09:31:02,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:02,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:02,107 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:31:02,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:02,115 INFO L85 PathProgramCache]: Analyzing trace with hash 119513908, now seen corresponding path program 1 times [2022-11-20 09:31:02,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:02,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769883948] [2022-11-20 09:31:02,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:02,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:02,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:31:02,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:31:02,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769883948] [2022-11-20 09:31:02,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769883948] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:02,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:02,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:31:02,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66516729] [2022-11-20 09:31:02,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:02,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 09:31:02,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:31:02,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 09:31:02,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:31:02,375 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2022-11-20 09:31:02,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:02,392 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-11-20 09:31:02,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 09:31:02,394 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-20 09:31:02,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:02,403 INFO L225 Difference]: With dead ends: 25 [2022-11-20 09:31:02,403 INFO L226 Difference]: Without dead ends: 10 [2022-11-20 09:31:02,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:31:02,411 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:02,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 09:31:02,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-11-20 09:31:02,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-11-20 09:31:02,450 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) [2022-11-20 09:31:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-11-20 09:31:02,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2022-11-20 09:31:02,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:02,453 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-11-20 09:31:02,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2022-11-20 09:31:02,454 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-11-20 09:31:02,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 09:31:02,455 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:02,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:02,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 09:31:02,456 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:31:02,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:02,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1186636597, now seen corresponding path program 1 times [2022-11-20 09:31:02,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:31:02,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282586820] [2022-11-20 09:31:02,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:02,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:31:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:31:02,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 09:31:02,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 09:31:02,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 09:31:02,589 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-20 09:31:02,591 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-20 09:31:02,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 09:31:02,596 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-20 09:31:02,600 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-20 09:31:02,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:31:02 BoogieIcfgContainer [2022-11-20 09:31:02,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-20 09:31:02,621 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 09:31:02,621 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 09:31:02,621 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 09:31:02,622 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:31:01" (3/4) ... [2022-11-20 09:31:02,625 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-20 09:31:02,625 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 09:31:02,626 INFO L158 Benchmark]: Toolchain (without parser) took 1501.31ms. Allocated memory is still 144.7MB. Free memory was 104.1MB in the beginning and 113.2MB in the end (delta: -9.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:31:02,626 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 113.2MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:31:02,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.18ms. Allocated memory is still 144.7MB. Free memory was 104.1MB in the beginning and 93.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 09:31:02,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.35ms. Allocated memory is still 144.7MB. Free memory was 93.6MB in the beginning and 92.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:31:02,628 INFO L158 Benchmark]: Boogie Preprocessor took 46.07ms. Allocated memory is still 144.7MB. Free memory was 92.0MB in the beginning and 90.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 09:31:02,629 INFO L158 Benchmark]: RCFGBuilder took 414.68ms. Allocated memory is still 144.7MB. Free memory was 90.5MB in the beginning and 80.5MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-20 09:31:02,629 INFO L158 Benchmark]: TraceAbstraction took 630.75ms. Allocated memory is still 144.7MB. Free memory was 79.5MB in the beginning and 113.2MB in the end (delta: -33.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:31:02,630 INFO L158 Benchmark]: Witness Printer took 4.35ms. Allocated memory is still 144.7MB. Free memory is still 113.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 09:31:02,632 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 113.2MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.18ms. Allocated memory is still 144.7MB. Free memory was 104.1MB in the beginning and 93.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.35ms. Allocated memory is still 144.7MB. Free memory was 93.6MB in the beginning and 92.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.07ms. Allocated memory is still 144.7MB. Free memory was 92.0MB in the beginning and 90.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 414.68ms. Allocated memory is still 144.7MB. Free memory was 90.5MB in the beginning and 80.5MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 630.75ms. Allocated memory is still 144.7MB. Free memory was 79.5MB in the beginning and 113.2MB in the end (delta: -33.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.35ms. Allocated memory is still 144.7MB. Free memory is still 113.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 51, overapproximation of to_real at line 22, overapproximation of someBinaryArithmeticFLOAToperation at line 34. Possible FailurePath: [L15] float pi = 3.14159 ; VAL [pi=314159/100000] [L21] float x = __VERIFIER_nondet_float() ; [L22] float octant1 = 0 ; [L23] float octant2 = pi/8 ; [L24] CALL assume_abort_if_not(x > octant1 && x < octant2) [L11] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, pi=314159/100000] [L24] RET assume_abort_if_not(x > octant1 && x < octant2) [L25] float oddExp = x ; [L26] float evenExp = 1.0 ; [L27] float term = x ; [L28] unsigned int count = 2 ; [L29] int multFactor = 0 ; [L30] int temp ; VAL [count=2, evenExp=1, multFactor=0, oddExp=118, pi=314159/100000, term=118, x=118] [L32] COND TRUE 1 [L34] term = term * (x/count) [L35] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L37] evenExp = evenExp + multFactor*term [L39] count++ [L41] term = term * (x/count) [L43] oddExp = oddExp + multFactor*term [L45] count++ [L47] temp = __VERIFIER_nondet_int() [L48] COND TRUE temp == 0 VAL [count=4, multFactor=-1, pi=314159/100000, temp=0, x=118] [L51] CALL __VERIFIER_assert( evenExp >= oddExp ) [L13] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, pi=314159/100000] [L13] reach_error() VAL [\old(cond)=0, cond=0, pi=314159/100000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 14 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-20 09:31:02,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN --witnessprinter.witness.filename witness.graphml --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 bd7fa6dfe7a0889f513bad4c7cfc96eb426f92168ff26ce4409068874579f6bc --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 09:31:05,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:31:05,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:31:05,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:31:05,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:31:05,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:31:05,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:31:05,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:31:05,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:31:05,063 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:31:05,064 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:31:05,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:31:05,067 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:31:05,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:31:05,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:31:05,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:31:05,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:31:05,080 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:31:05,082 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:31:05,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:31:05,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:31:05,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:31:05,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:31:05,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:31:05,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:31:05,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:31:05,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:31:05,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:31:05,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:31:05,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:31:05,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:31:05,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:31:05,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:31:05,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:31:05,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:31:05,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:31:05,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:31:05,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:31:05,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:31:05,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:31:05,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:31:05,146 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-11-20 09:31:05,187 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:31:05,188 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:31:05,189 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:31:05,189 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:31:05,190 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:31:05,191 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:31:05,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:31:05,192 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:31:05,192 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:31:05,192 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:31:05,193 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:31:05,193 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:31:05,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:31:05,194 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 09:31:05,194 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:31:05,194 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 09:31:05,194 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-20 09:31:05,195 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-20 09:31:05,195 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-20 09:31:05,195 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:31:05,195 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:31:05,195 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:31:05,196 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 09:31:05,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:31:05,196 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:31:05,196 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:31:05,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:31:05,197 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:31:05,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:31:05,197 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 09:31:05,198 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-20 09:31:05,198 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-20 09:31:05,198 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 09:31:05,198 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 09:31:05,199 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 09:31:05,199 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-20 09:31:05,199 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/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_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> bd7fa6dfe7a0889f513bad4c7cfc96eb426f92168ff26ce4409068874579f6bc [2022-11-20 09:31:05,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:31:05,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:31:05,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:31:05,594 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:31:05,595 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:31:05,597 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2022-11-20 09:31:08,666 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:31:08,876 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:31:08,877 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2022-11-20 09:31:08,885 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/data/2f21a4ae4/c770652b699c4ef689b10fd600475afd/FLAG9de179a8e [2022-11-20 09:31:08,899 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/data/2f21a4ae4/c770652b699c4ef689b10fd600475afd [2022-11-20 09:31:08,902 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:31:08,903 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:31:08,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:31:08,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:31:08,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:31:08,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:31:08" (1/1) ... [2022-11-20 09:31:08,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3026a24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:08, skipping insertion in model container [2022-11-20 09:31:08,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:31:08" (1/1) ... [2022-11-20 09:31:08,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:31:08,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:31:09,108 WARN L237 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_68533095-f6a5-4cc5-9982-a816b7327cd0/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c[472,485] [2022-11-20 09:31:09,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:31:09,143 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:31:09,158 WARN L237 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_68533095-f6a5-4cc5-9982-a816b7327cd0/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c[472,485] [2022-11-20 09:31:09,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:31:09,180 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:31:09,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:09 WrapperNode [2022-11-20 09:31:09,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:31:09,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:31:09,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:31:09,183 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:31:09,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:09" (1/1) ... [2022-11-20 09:31:09,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:09" (1/1) ... [2022-11-20 09:31:09,219 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2022-11-20 09:31:09,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:31:09,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:31:09,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:31:09,220 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:31:09,229 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:09" (1/1) ... [2022-11-20 09:31:09,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:09" (1/1) ... [2022-11-20 09:31:09,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:09" (1/1) ... [2022-11-20 09:31:09,233 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:09" (1/1) ... [2022-11-20 09:31:09,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:09" (1/1) ... [2022-11-20 09:31:09,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:09" (1/1) ... [2022-11-20 09:31:09,244 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:09" (1/1) ... [2022-11-20 09:31:09,246 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:09" (1/1) ... [2022-11-20 09:31:09,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:31:09,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:31:09,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:31:09,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:31:09,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:09" (1/1) ... [2022-11-20 09:31:09,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:31:09,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:31:09,307 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:31:09,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:31:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:31:09,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-20 09:31:09,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:31:09,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:31:09,430 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:31:09,432 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:31:11,875 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:31:11,882 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:31:11,882 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 09:31:11,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:31:11 BoogieIcfgContainer [2022-11-20 09:31:11,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:31:11,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:31:11,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:31:11,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:31:11,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:31:08" (1/3) ... [2022-11-20 09:31:11,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b973c01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:31:11, skipping insertion in model container [2022-11-20 09:31:11,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:31:09" (2/3) ... [2022-11-20 09:31:11,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b973c01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:31:11, skipping insertion in model container [2022-11-20 09:31:11,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:31:11" (3/3) ... [2022-11-20 09:31:11,900 INFO L112 eAbstractionObserver]: Analyzing ICFG loop3.c [2022-11-20 09:31:11,928 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:31:11,928 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 09:31:11,979 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:31:11,987 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=LoopsAndPotentialCycles, 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;@2c78a1ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:31:11,987 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-20 09:31:11,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 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) [2022-11-20 09:31:11,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-20 09:31:11,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:11,999 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:12,000 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:31:12,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:12,005 INFO L85 PathProgramCache]: Analyzing trace with hash 119513908, now seen corresponding path program 1 times [2022-11-20 09:31:12,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:31:12,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111722884] [2022-11-20 09:31:12,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:12,020 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 [2022-11-20 09:31:12,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:31:12,027 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/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) [2022-11-20 09:31:12,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 09:31:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:12,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 09:31:12,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:31:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:31:12,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:31:12,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:31:12,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111722884] [2022-11-20 09:31:12,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111722884] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:31:12,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:31:12,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:31:12,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416103258] [2022-11-20 09:31:12,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:31:12,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 09:31:12,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:31:12,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 09:31:12,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:31:12,230 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2022-11-20 09:31:12,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:31:12,245 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-11-20 09:31:12,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 09:31:12,247 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-20 09:31:12,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:31:12,255 INFO L225 Difference]: With dead ends: 25 [2022-11-20 09:31:12,256 INFO L226 Difference]: Without dead ends: 10 [2022-11-20 09:31:12,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:31:12,262 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-20 09:31:12,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-20 09:31:12,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-11-20 09:31:12,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-11-20 09:31:12,293 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) [2022-11-20 09:31:12,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-11-20 09:31:12,295 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2022-11-20 09:31:12,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:31:12,295 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-11-20 09:31:12,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2022-11-20 09:31:12,296 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-11-20 09:31:12,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-20 09:31:12,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:31:12,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:31:12,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-20 09:31:12,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 09:31:12,511 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:31:12,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:31:12,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1186636597, now seen corresponding path program 1 times [2022-11-20 09:31:12,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:31:12,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984054212] [2022-11-20 09:31:12,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:31:12,513 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 [2022-11-20 09:31:12,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:31:12,515 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/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) [2022-11-20 09:31:12,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 09:31:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:31:15,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-20 09:31:15,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:31:37,907 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) |c_ULTIMATE.start_main_~evenExp~0#1|) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2022-11-20 09:31:39,966 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) |c_ULTIMATE.start_main_~evenExp~0#1|) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2022-11-20 09:32:30,601 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))) (.cse5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))) (.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (or (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0) (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse5)))) (fp.geq (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 .cse3)) (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse4)))))) (fp.gt |ULTIMATE.start_main_~x~0#1| .cse6))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (not (let ((.cse7 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse5)))) (fp.geq (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 .cse7)) (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse4))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0) (fp.gt |ULTIMATE.start_main_~x~0#1| .cse6))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))))) is different from false [2022-11-20 09:32:48,082 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from false [2022-11-20 09:32:50,146 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from true [2022-11-20 09:32:50,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:32:50,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:32:50,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:32:50,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984054212] [2022-11-20 09:32:50,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1984054212] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:32:50,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:32:50,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 09:32:50,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421231689] [2022-11-20 09:32:50,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:32:50,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 09:32:50,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:32:50,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 09:32:50,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=21, Unknown=5, NotChecked=30, Total=72 [2022-11-20 09:32:50,151 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second 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) [2022-11-20 09:32:56,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-20 09:32:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:32:56,018 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-11-20 09:32:56,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:32:56,153 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 9 [2022-11-20 09:32:56,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:32:56,153 INFO L225 Difference]: With dead ends: 16 [2022-11-20 09:32:56,154 INFO L226 Difference]: Without dead ends: 12 [2022-11-20 09:32:56,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=34, Invalid=45, Unknown=5, NotChecked=48, Total=132 [2022-11-20 09:32:56,156 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-20 09:32:56,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 7 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 17 Unchecked, 2.7s Time] [2022-11-20 09:32:56,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-20 09:32:56,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-20 09:32:56,164 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) [2022-11-20 09:32:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-11-20 09:32:56,165 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2022-11-20 09:32:56,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:32:56,166 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-11-20 09:32:56,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2022-11-20 09:32:56,166 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-11-20 09:32:56,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-20 09:32:56,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:32:56,168 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:32:56,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-20 09:32:56,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 09:32:56,393 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:32:56,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:56,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2054856368, now seen corresponding path program 1 times [2022-11-20 09:32:56,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:32:56,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922973462] [2022-11-20 09:32:56,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:56,395 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 [2022-11-20 09:32:56,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:32:56,397 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/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) [2022-11-20 09:32:56,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 09:33:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:21,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-20 09:33:21,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:34:03,434 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv4294967294 32))))))) (and (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~count~0#1|))))) (= (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~term~0#1|)) |c_ULTIMATE.start_main_~oddExp~0#1|) (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse1 .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-20 09:34:56,875 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|)))))) is different from false [2022-11-20 09:34:58,991 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|)))))) is different from true [2022-11-20 09:35:52,553 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse6 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))) (.cse7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))) (.cse8 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))) (.cse9 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (.cse10 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (or (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (let ((.cse2 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse8)))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse7)))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse6)))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 .cse4)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse5)))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse9) (fp.gt |ULTIMATE.start_main_~x~0#1| .cse10))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (not (let ((.cse11 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse8)))) (let ((.cse13 (fp.mul roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse7)))) (let ((.cse12 (fp.mul roundNearestTiesToEven .cse13 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse6)))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 .cse11)) (fp.mul roundNearestTiesToEven .cse1 .cse12)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 .cse13)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse12 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse5))))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse9) (fp.gt |ULTIMATE.start_main_~x~0#1| .cse10))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))))) is different from false [2022-11-20 09:36:10,806 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from false [2022-11-20 09:36:12,913 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from true [2022-11-20 09:36:12,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 09:36:12,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:36:28,918 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse0 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32))))))) (and (or .cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse3))))) (or (not .cse0) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse4 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse4 .cse3)))))))) is different from false [2022-11-20 09:36:31,058 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse0 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32))))))) (and (or .cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse3))))) (or (not .cse0) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse4 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse4 .cse3)))))))) is different from true [2022-11-20 09:36:53,991 WARN L233 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:37:16,157 WARN L233 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:37:25,935 WARN L233 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:37:28,231 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse10 (fp.mul c_currentRoundingMode .cse11 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))))) (.cse8 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse10 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode .cse8))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|))))) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (let ((.cse12 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse2 (fp.mul c_currentRoundingMode .cse9 .cse6)) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (.cse4 (fp.mul c_currentRoundingMode .cse9 .cse7))) (and (or (let ((.cse1 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse9 .cse11))) (.cse3 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse9 .cse10))) (.cse0 (= (bvlshr .cse8 (_ bv1 32)) (_ bv0 32)))) (and (or .cse0 (fp.geq (fp.add c_currentRoundingMode .cse1 .cse2) (fp.add c_currentRoundingMode .cse3 .cse4))) (or (fp.geq (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse5 .cse6)) (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse5 .cse7))) (not .cse0)))) .cse12) (or (not .cse12) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse5 .cse11)) .cse2) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse5 .cse10)) .cse4))))))))) is different from false [2022-11-20 09:37:30,538 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse11 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse10 (fp.mul c_currentRoundingMode .cse11 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))))) (.cse8 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse10 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode .cse8))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|))))) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (let ((.cse12 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse2 (fp.mul c_currentRoundingMode .cse9 .cse6)) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (.cse4 (fp.mul c_currentRoundingMode .cse9 .cse7))) (and (or (let ((.cse1 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse9 .cse11))) (.cse3 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse9 .cse10))) (.cse0 (= (bvlshr .cse8 (_ bv1 32)) (_ bv0 32)))) (and (or .cse0 (fp.geq (fp.add c_currentRoundingMode .cse1 .cse2) (fp.add c_currentRoundingMode .cse3 .cse4))) (or (fp.geq (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse5 .cse6)) (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse5 .cse7))) (not .cse0)))) .cse12) (or (not .cse12) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse5 .cse11)) .cse2) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse5 .cse10)) .cse4))))))))) is different from true [2022-11-20 09:37:37,107 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) is different from false [2022-11-20 09:37:39,283 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) is different from true [2022-11-20 09:37:50,594 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from false [2022-11-20 09:37:52,786 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from true [2022-11-20 09:38:09,738 WARN L859 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_5| (_ FloatingPoint 8 24))) (or (let ((.cse1 (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) (not (fp.gt |v_ULTIMATE.start_main_~x~0#1_5| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (not (fp.lt |v_ULTIMATE.start_main_~x~0#1_5| (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))))) is different from true [2022-11-20 09:38:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-20 09:38:09,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-20 09:38:09,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922973462] [2022-11-20 09:38:09,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922973462] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:38:09,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:38:09,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2022-11-20 09:38:09,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322186843] [2022-11-20 09:38:09,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:38:09,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 09:38:09,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-20 09:38:09,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 09:38:09,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=44, Unknown=15, NotChecked=180, Total=272 [2022-11-20 09:38:09,742 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:11,910 WARN L837 $PredicateComparison]: unable to prove that (and (= c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0)))) (forall ((|v_ULTIMATE.start_main_~x~0#1_5| (_ FloatingPoint 8 24))) (or (let ((.cse1 (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) (not (fp.gt |v_ULTIMATE.start_main_~x~0#1_5| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (not (fp.lt |v_ULTIMATE.start_main_~x~0#1_5| (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-20 09:38:14,114 WARN L859 $PredicateComparison]: unable to prove that (and (= c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0)))) (forall ((|v_ULTIMATE.start_main_~x~0#1_5| (_ FloatingPoint 8 24))) (or (let ((.cse1 (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) (not (fp.gt |v_ULTIMATE.start_main_~x~0#1_5| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (not (fp.lt |v_ULTIMATE.start_main_~x~0#1_5| (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-20 09:38:16,313 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (or (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) .cse4) (let ((.cse5 (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (.cse6 (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))))) (or (and (or (not .cse5) (not .cse6)) .cse4) (and .cse5 .cse6 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-20 09:38:18,509 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (or (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) .cse4) (let ((.cse5 (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (.cse6 (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))))) (or (and (or (not .cse5) (not .cse6)) .cse4) (and .cse5 .cse6 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-20 09:38:20,703 WARN L837 $PredicateComparison]: unable to prove that (and (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-20 09:38:22,873 WARN L859 $PredicateComparison]: unable to prove that (and (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-20 09:38:25,080 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse10 (fp.mul c_currentRoundingMode .cse11 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))))) (.cse8 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse10 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode .cse8))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|))))) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (let ((.cse12 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse2 (fp.mul c_currentRoundingMode .cse9 .cse6)) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (.cse4 (fp.mul c_currentRoundingMode .cse9 .cse7))) (and (or (let ((.cse1 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse9 .cse11))) (.cse3 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse9 .cse10))) (.cse0 (= (bvlshr .cse8 (_ bv1 32)) (_ bv0 32)))) (and (or .cse0 (fp.geq (fp.add c_currentRoundingMode .cse1 .cse2) (fp.add c_currentRoundingMode .cse3 .cse4))) (or (fp.geq (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse5 .cse6)) (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse5 .cse7))) (not .cse0)))) .cse12) (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~oddExp~0#1|) (or (not .cse12) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse5 .cse11)) .cse2) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse5 .cse10)) .cse4))) (= |c_ULTIMATE.start_main_~evenExp~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~term~0#1| |c_ULTIMATE.start_main_~x~0#1|))))))) is different from false [2022-11-20 09:38:27,373 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse11 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse10 (fp.mul c_currentRoundingMode .cse11 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))))) (.cse8 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse10 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode .cse8))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|))))) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (let ((.cse12 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse2 (fp.mul c_currentRoundingMode .cse9 .cse6)) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (.cse4 (fp.mul c_currentRoundingMode .cse9 .cse7))) (and (or (let ((.cse1 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse9 .cse11))) (.cse3 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse9 .cse10))) (.cse0 (= (bvlshr .cse8 (_ bv1 32)) (_ bv0 32)))) (and (or .cse0 (fp.geq (fp.add c_currentRoundingMode .cse1 .cse2) (fp.add c_currentRoundingMode .cse3 .cse4))) (or (fp.geq (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse5 .cse6)) (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse5 .cse7))) (not .cse0)))) .cse12) (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~oddExp~0#1|) (or (not .cse12) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse5 .cse11)) .cse2) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse5 .cse10)) .cse4))) (= |c_ULTIMATE.start_main_~evenExp~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~term~0#1| |c_ULTIMATE.start_main_~x~0#1|))))))) is different from true [2022-11-20 09:38:29,719 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse4 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv4294967294 32)))))) (.cse0 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32))))))) (and (or .cse0 (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse3)))) (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~count~0#1|))))) (= (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~term~0#1|)) |c_ULTIMATE.start_main_~oddExp~0#1|) (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse1 .cse4))) (or (not .cse0) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse5 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse5 .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2022-11-20 09:38:31,975 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse4 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv4294967294 32)))))) (.cse0 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32))))))) (and (or .cse0 (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse3)))) (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~count~0#1|))))) (= (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~term~0#1|)) |c_ULTIMATE.start_main_~oddExp~0#1|) (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse1 .cse4))) (or (not .cse0) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse5 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse5 .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-20 09:38:34,187 WARN L837 $PredicateComparison]: unable to prove that (and (fp.geq |c_ULTIMATE.start_main_~evenExp~0#1| |c_ULTIMATE.start_main_~oddExp~0#1|) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|))))))) is different from false [2022-11-20 09:38:36,392 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))) (and (not .cse0) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse6 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))) (.cse8 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))) (.cse9 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))) (.cse10 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (.cse11 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (or (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse9)))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse8)))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse7)))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 .cse3)) (fp.mul roundNearestTiesToEven .cse2 .cse4)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse2 .cse5)) (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse6)))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse10) (fp.gt |ULTIMATE.start_main_~x~0#1| .cse11))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (not (let ((.cse12 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse9)))) (let ((.cse14 (fp.mul roundNearestTiesToEven .cse12 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse8)))) (let ((.cse13 (fp.mul roundNearestTiesToEven .cse14 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse7)))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 .cse12)) (fp.mul roundNearestTiesToEven .cse2 .cse13)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse2 .cse14)) (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse13 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse6))))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse10) (fp.gt |ULTIMATE.start_main_~x~0#1| .cse11))) .cse0))))) is different from false [2022-11-20 09:38:36,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 09:38:36,424 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-11-20 09:38:36,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:38:36,424 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-20 09:38:36,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 09:38:36,425 INFO L225 Difference]: With dead ends: 18 [2022-11-20 09:38:36,425 INFO L226 Difference]: Without dead ends: 14 [2022-11-20 09:38:36,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 64.1s TimeCoverageRelationStatistics Valid=47, Invalid=46, Unknown=27, NotChecked=432, Total=552 [2022-11-20 09:38:36,427 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 09:38:36,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 31 Unchecked, 0.1s Time] [2022-11-20 09:38:36,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-20 09:38:36,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-11-20 09:38:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-11-20 09:38:36,433 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2022-11-20 09:38:36,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 09:38:36,434 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-11-20 09:38:36,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:36,434 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-11-20 09:38:36,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-20 09:38:36,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 09:38:36,435 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:38:36,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 09:38:36,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 09:38:36,636 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-20 09:38:36,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:38:36,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1016661163, now seen corresponding path program 2 times [2022-11-20 09:38:36,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-20 09:38:36,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [828882513] [2022-11-20 09:38:36,637 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:38:36,637 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 [2022-11-20 09:38:36,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/mathsat [2022-11-20 09:38:36,639 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/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) [2022-11-20 09:38:36,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68533095-f6a5-4cc5-9982-a816b7327cd0/bin/uautomizer-ug76WZFUDN/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 [2022-11-20 09:40:11,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:40:11,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:40:11,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-20 09:40:11,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:40:49,129 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (and (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))) (= (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~term~0#1|)) |c_ULTIMATE.start_main_~oddExp~0#1|) (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse1 .cse0)) |c_ULTIMATE.start_main_~evenExp~0#1|) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-20 09:41:58,160 WARN L233 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:42:05,375 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv4294967294 32))))))) (and (= (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~count~0#1|)))) |c_ULTIMATE.start_main_~term~0#1|) (= (_ bv6 32) |c_ULTIMATE.start_main_~count~0#1|) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~term~0#1|))) (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse1 .cse3)) (fp.mul c_currentRoundingMode .cse1 .cse0)) |c_ULTIMATE.start_main_~evenExp~0#1|) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from false [2022-11-20 09:42:08,292 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv4294967294 32))))))) (and (= (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~count~0#1|)))) |c_ULTIMATE.start_main_~term~0#1|) (= (_ bv6 32) |c_ULTIMATE.start_main_~count~0#1|) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~term~0#1|))) (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse1 .cse3)) (fp.mul c_currentRoundingMode .cse1 .cse0)) |c_ULTIMATE.start_main_~evenExp~0#1|) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2022-11-20 09:42:13,312 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:42:38,170 WARN L233 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:42:43,177 WARN L233 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:42:48,717 WARN L233 SmtUtils]: Spent 5.53s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:42:53,923 WARN L233 SmtUtils]: Spent 5.21s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:42:59,392 WARN L233 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:43:04,878 WARN L233 SmtUtils]: Spent 5.49s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:43:07,238 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (and (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) |c_ULTIMATE.start_main_~evenExp~0#1|) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) |c_ULTIMATE.start_main_~oddExp~0#1|)))))))) is different from false [2022-11-20 09:43:09,429 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (and (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) |c_ULTIMATE.start_main_~evenExp~0#1|) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) |c_ULTIMATE.start_main_~oddExp~0#1|)))))))) is different from true [2022-11-20 09:43:14,967 WARN L233 SmtUtils]: Spent 5.53s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:43:20,205 WARN L233 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:43:25,688 WARN L233 SmtUtils]: Spent 5.48s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:43:31,181 WARN L233 SmtUtils]: Spent 5.49s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:43:39,117 WARN L233 SmtUtils]: Spent 5.54s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:43:44,637 WARN L233 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:43:57,232 WARN L233 SmtUtils]: Spent 5.50s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:44:02,734 WARN L233 SmtUtils]: Spent 5.50s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:44:10,796 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse9 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))) (.cse10 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32))) (.cse11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse12 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))) (.cse13 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))) (.cse14 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))) (or (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0) (fp.gt |ULTIMATE.start_main_~x~0#1| .cse1) (let ((.cse4 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse14)))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse13)))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse12)))) (let ((.cse8 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse11)))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse8 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse10)))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse3 .cse4)) (fp.mul roundNearestTiesToEven .cse3 .cse5)) (fp.mul roundNearestTiesToEven .cse3 .cse6)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse3 .cse7)) (fp.mul roundNearestTiesToEven .cse3 .cse8)) (fp.mul roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse9)))))))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0) (fp.gt |ULTIMATE.start_main_~x~0#1| .cse1) (not (let ((.cse15 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse14)))) (let ((.cse18 (fp.mul roundNearestTiesToEven .cse15 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse13)))) (let ((.cse16 (fp.mul roundNearestTiesToEven .cse18 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse12)))) (let ((.cse19 (fp.mul roundNearestTiesToEven .cse16 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse11)))) (let ((.cse17 (fp.mul roundNearestTiesToEven .cse19 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse10)))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse3 .cse15)) (fp.mul roundNearestTiesToEven .cse3 .cse16)) (fp.mul roundNearestTiesToEven .cse3 .cse17)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse3 .cse18)) (fp.mul roundNearestTiesToEven .cse3 .cse19)) (fp.mul roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse17 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse9))))))))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))))) is different from false [2022-11-20 09:44:18,694 WARN L233 SmtUtils]: Spent 5.51s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:44:24,215 WARN L233 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:44:31,241 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (let ((.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))))) is different from false [2022-11-20 09:44:33,431 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (let ((.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))))) is different from true [2022-11-20 09:44:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-20 09:44:33,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:44:49,882 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse0 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32))))))) (and (or .cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse3))))) (or (not .cse0) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse4 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse4 .cse3)))))))) is different from false [2022-11-20 09:44:52,046 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse0 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32))))))) (and (or .cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse3))))) (or (not .cse0) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse4 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse4 .cse3)))))))) is different from true [2022-11-20 09:45:15,453 WARN L233 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:45:25,379 WARN L233 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:45:35,369 WARN L233 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:45:44,009 WARN L233 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:45:50,989 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse10 (fp.mul c_currentRoundingMode .cse11 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))))) (.cse8 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse10 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode .cse8))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|))))) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (let ((.cse12 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse2 (fp.mul c_currentRoundingMode .cse9 .cse6)) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (.cse4 (fp.mul c_currentRoundingMode .cse9 .cse7))) (and (or (let ((.cse1 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse9 .cse11))) (.cse3 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse9 .cse10))) (.cse0 (= (bvlshr .cse8 (_ bv1 32)) (_ bv0 32)))) (and (or .cse0 (fp.geq (fp.add c_currentRoundingMode .cse1 .cse2) (fp.add c_currentRoundingMode .cse3 .cse4))) (or (fp.geq (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse5 .cse6)) (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse5 .cse7))) (not .cse0)))) .cse12) (or (not .cse12) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse5 .cse11)) .cse2) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse5 .cse10)) .cse4))))))))) is different from false [2022-11-20 09:45:53,336 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse11 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse10 (fp.mul c_currentRoundingMode .cse11 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))))) (.cse8 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse10 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode .cse8))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|))))) (.cse9 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (let ((.cse12 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse2 (fp.mul c_currentRoundingMode .cse9 .cse6)) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (.cse4 (fp.mul c_currentRoundingMode .cse9 .cse7))) (and (or (let ((.cse1 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse9 .cse11))) (.cse3 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse9 .cse10))) (.cse0 (= (bvlshr .cse8 (_ bv1 32)) (_ bv0 32)))) (and (or .cse0 (fp.geq (fp.add c_currentRoundingMode .cse1 .cse2) (fp.add c_currentRoundingMode .cse3 .cse4))) (or (fp.geq (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse5 .cse6)) (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse5 .cse7))) (not .cse0)))) .cse12) (or (not .cse12) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse5 .cse11)) .cse2) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse5 .cse10)) .cse4))))))))) is different from true [2022-11-20 09:45:58,687 WARN L233 SmtUtils]: Spent 5.34s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:46:08,838 WARN L233 SmtUtils]: Spent 5.46s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:46:19,007 WARN L233 SmtUtils]: Spent 5.49s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-20 09:46:24,449 WARN L233 SmtUtils]: Spent 5.44s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)