./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/cos_polynomial.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8e1c903 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/cos_polynomial.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX --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 c41c899e123885a0a5b4b47d325ecb3bae7fd8ace0e033e73eafae066c754dcb --- Real Ultimate output --- This is Ultimate 0.2.1-dev-f8e1c90 [2021-11-09 09:36:31,719 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 09:36:31,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 09:36:31,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 09:36:31,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 09:36:31,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 09:36:31,799 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 09:36:31,805 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 09:36:31,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 09:36:31,815 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 09:36:31,816 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 09:36:31,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 09:36:31,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 09:36:31,821 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 09:36:31,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 09:36:31,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 09:36:31,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 09:36:31,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 09:36:31,831 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 09:36:31,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 09:36:31,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 09:36:31,838 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 09:36:31,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 09:36:31,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 09:36:31,846 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 09:36:31,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 09:36:31,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 09:36:31,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 09:36:31,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 09:36:31,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 09:36:31,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 09:36:31,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 09:36:31,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 09:36:31,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 09:36:31,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 09:36:31,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 09:36:31,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 09:36:31,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 09:36:31,861 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 09:36:31,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 09:36:31,864 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 09:36:31,865 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-09 09:36:31,896 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 09:36:31,897 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 09:36:31,897 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 09:36:31,898 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 09:36:31,900 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 09:36:31,900 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 09:36:31,901 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 09:36:31,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 09:36:31,902 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-09 09:36:31,902 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-09 09:36:31,903 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-09 09:36:31,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 09:36:31,904 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-09 09:36:31,904 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-09 09:36:31,905 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-09 09:36:31,905 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-09 09:36:31,905 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-09 09:36:31,906 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 09:36:31,906 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-09 09:36:31,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 09:36:31,906 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 09:36:31,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-09 09:36:31,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 09:36:31,907 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 09:36:31,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-09 09:36:31,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-09 09:36:31,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-09 09:36:31,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-09 09:36:31,909 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-09 09:36:31,909 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-09 09:36:31,909 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-09 09:36:31,910 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 09:36:31,910 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_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/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_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX 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 -> c41c899e123885a0a5b4b47d325ecb3bae7fd8ace0e033e73eafae066c754dcb [2021-11-09 09:36:32,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 09:36:32,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 09:36:32,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 09:36:32,280 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 09:36:32,281 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 09:36:32,281 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/float-benchs/cos_polynomial.c [2021-11-09 09:36:32,369 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/data/a461f6cea/524b336c3d1b426aabd424c5a907079b/FLAGe32456f64 [2021-11-09 09:36:32,886 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 09:36:32,887 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/sv-benchmarks/c/float-benchs/cos_polynomial.c [2021-11-09 09:36:32,895 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/data/a461f6cea/524b336c3d1b426aabd424c5a907079b/FLAGe32456f64 [2021-11-09 09:36:33,240 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/data/a461f6cea/524b336c3d1b426aabd424c5a907079b [2021-11-09 09:36:33,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 09:36:33,246 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-09 09:36:33,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 09:36:33,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 09:36:33,253 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 09:36:33,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:36:33" (1/1) ... [2021-11-09 09:36:33,256 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4957f6ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:33, skipping insertion in model container [2021-11-09 09:36:33,256 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:36:33" (1/1) ... [2021-11-09 09:36:33,265 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 09:36:33,281 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 09:36:33,479 WARN L228 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_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/sv-benchmarks/c/float-benchs/cos_polynomial.c[619,632] [2021-11-09 09:36:33,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:36:33,524 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 09:36:33,540 WARN L228 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_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/sv-benchmarks/c/float-benchs/cos_polynomial.c[619,632] [2021-11-09 09:36:33,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:36:33,567 INFO L208 MainTranslator]: Completed translation [2021-11-09 09:36:33,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:33 WrapperNode [2021-11-09 09:36:33,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 09:36:33,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-09 09:36:33,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-09 09:36:33,571 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-09 09:36:33,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:33" (1/1) ... [2021-11-09 09:36:33,586 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:33" (1/1) ... [2021-11-09 09:36:33,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-09 09:36:33,611 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 09:36:33,611 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 09:36:33,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 09:36:33,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:33" (1/1) ... [2021-11-09 09:36:33,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:33" (1/1) ... [2021-11-09 09:36:33,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:33" (1/1) ... [2021-11-09 09:36:33,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:33" (1/1) ... [2021-11-09 09:36:33,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:33" (1/1) ... [2021-11-09 09:36:33,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:33" (1/1) ... [2021-11-09 09:36:33,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:33" (1/1) ... [2021-11-09 09:36:33,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 09:36:33,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 09:36:33,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 09:36:33,640 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 09:36:33,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:33" (1/1) ... [2021-11-09 09:36:33,651 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 09:36:33,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:36:33,695 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-09 09:36:33,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-09 09:36:33,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-09 09:36:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 09:36:33,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 09:36:33,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 09:36:33,990 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 09:36:33,991 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-11-09 09:36:33,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:36:33 BoogieIcfgContainer [2021-11-09 09:36:33,993 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 09:36:33,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-09 09:36:33,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-09 09:36:34,008 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-09 09:36:34,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:36:33" (1/3) ... [2021-11-09 09:36:34,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb8530e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:36:34, skipping insertion in model container [2021-11-09 09:36:34,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:33" (2/3) ... [2021-11-09 09:36:34,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cb8530e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:36:34, skipping insertion in model container [2021-11-09 09:36:34,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:36:33" (3/3) ... [2021-11-09 09:36:34,012 INFO L111 eAbstractionObserver]: Analyzing ICFG cos_polynomial.c [2021-11-09 09:36:34,020 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-09 09:36:34,020 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-09 09:36:34,135 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-09 09:36:34,159 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-09 09:36:34,160 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-09 09:36:34,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:34,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-09 09:36:34,199 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:34,199 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:34,200 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:34,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:34,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1236255304, now seen corresponding path program 1 times [2021-11-09 09:36:34,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:36:34,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869334379] [2021-11-09 09:36:34,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:34,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:36:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:36:34,510 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:36:34,511 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869334379] [2021-11-09 09:36:34,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869334379] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:36:34,513 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:36:34,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-09 09:36:34,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877560475] [2021-11-09 09:36:34,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-09 09:36:34,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:36:34,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-09 09:36:34,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-09 09:36:34,563 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2021-11-09 09:36:34,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:34,590 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2021-11-09 09:36:34,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-09 09:36:34,592 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) Word has length 10 [2021-11-09 09:36:34,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:34,605 INFO L225 Difference]: With dead ends: 31 [2021-11-09 09:36:34,606 INFO L226 Difference]: Without dead ends: 13 [2021-11-09 09:36:34,610 INFO L786 BasicCegarLoop]: 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 [2021-11-09 09:36:34,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-09 09:36:34,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-11-09 09:36:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-11-09 09:36:34,653 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2021-11-09 09:36:34,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:34,655 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-11-09 09:36:34,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2021-11-09 09:36:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-11-09 09:36:34,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-09 09:36:34,657 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:34,657 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:34,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-09 09:36:34,659 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:34,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:34,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2045601930, now seen corresponding path program 1 times [2021-11-09 09:36:34,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:36:34,665 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981018176] [2021-11-09 09:36:34,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:34,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:36:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:36:34,722 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-09 09:36:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-09 09:36:34,783 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-09 09:36:34,784 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-09 09:36:34,786 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 09:36:34,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-09 09:36:34,796 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-09 09:36:34,799 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-09 09:36:34,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 09:36:34 BoogieIcfgContainer [2021-11-09 09:36:34,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-09 09:36:34,839 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-09 09:36:34,839 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-09 09:36:34,839 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-09 09:36:34,840 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:36:33" (3/4) ... [2021-11-09 09:36:34,843 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-09 09:36:34,844 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-09 09:36:34,846 INFO L168 Benchmark]: Toolchain (without parser) took 1599.17 ms. Allocated memory is still 115.3 MB. Free memory was 76.0 MB in the beginning and 53.9 MB in the end (delta: 22.2 MB). Peak memory consumption was 20.8 MB. Max. memory is 16.1 GB. [2021-11-09 09:36:34,847 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 115.3 MB. Free memory was 92.5 MB in the beginning and 92.4 MB in the end (delta: 63.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 09:36:34,848 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.68 ms. Allocated memory is still 115.3 MB. Free memory was 75.9 MB in the beginning and 89.5 MB in the end (delta: -13.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-09 09:36:34,849 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.80 ms. Allocated memory is still 115.3 MB. Free memory was 89.5 MB in the beginning and 88.0 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 09:36:34,850 INFO L168 Benchmark]: Boogie Preprocessor took 27.45 ms. Allocated memory is still 115.3 MB. Free memory was 88.0 MB in the beginning and 87.1 MB in the end (delta: 913.5 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-09 09:36:34,851 INFO L168 Benchmark]: RCFGBuilder took 353.99 ms. Allocated memory is still 115.3 MB. Free memory was 87.1 MB in the beginning and 77.3 MB in the end (delta: 9.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-09 09:36:34,851 INFO L168 Benchmark]: TraceAbstraction took 842.68 ms. Allocated memory is still 115.3 MB. Free memory was 76.6 MB in the beginning and 54.2 MB in the end (delta: 22.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-11-09 09:36:34,852 INFO L168 Benchmark]: Witness Printer took 4.86 ms. Allocated memory is still 115.3 MB. Free memory was 54.2 MB in the beginning and 53.9 MB in the end (delta: 358.5 kB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-09 09:36:34,858 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.18 ms. Allocated memory is still 115.3 MB. Free memory was 92.5 MB in the beginning and 92.4 MB in the end (delta: 63.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 320.68 ms. Allocated memory is still 115.3 MB. Free memory was 75.9 MB in the beginning and 89.5 MB in the end (delta: -13.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.80 ms. Allocated memory is still 115.3 MB. Free memory was 89.5 MB in the beginning and 88.0 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.45 ms. Allocated memory is still 115.3 MB. Free memory was 88.0 MB in the beginning and 87.1 MB in the end (delta: 913.5 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 353.99 ms. Allocated memory is still 115.3 MB. Free memory was 87.1 MB in the beginning and 77.3 MB in the end (delta: 9.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 842.68 ms. Allocated memory is still 115.3 MB. Free memory was 76.6 MB in the beginning and 54.2 MB in the end (delta: 22.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Witness Printer took 4.86 ms. Allocated memory is still 115.3 MB. Free memory was 54.2 MB in the beginning and 53.9 MB in the end (delta: 358.5 kB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * 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: 14]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 56, overapproximation of someUnaryDOUBLEoperation at line 27, overapproximation of someBinaryArithmeticDOUBLEoperation at line 32. Possible FailurePath: [L16] double C1 = 4.16666666666666019037e-02; [L17] double C2 = -1.38888888888741095749e-03; [L18] double C3 = 2.48015872894767294178e-05; [L19] double C4 = -2.75573143513906633035e-07; [L20] double C5 = 2.08757232129817482790e-09; [L21] double C6 = -1.13596475577881948265e-11; VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] [L49] double a, r; [L51] a = __VERIFIER_nondet_double() [L12] COND FALSE !(!cond) VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] [L25] double a, hz, z, r, qx, zr; [L26] z = x*x VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] [L27] COND TRUE x < 0. [L27] x = -x VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] [L28] hz = 0.5 * z [L29] r = z*(C1+z*(C2+z*(C3+z*(C4+z*(C5+z*C6))))) [L30] zr = z*r VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] [L31] COND TRUE x < 0.3 [L32] return 1.-(hz-zr); VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] [L54] r = mcos(a) [L14] COND TRUE !(cond) VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] [L14] reach_error() VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 19 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 9 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 [2021-11-09 09:36:34,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/cos_polynomial.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX --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 c41c899e123885a0a5b4b47d325ecb3bae7fd8ace0e033e73eafae066c754dcb --- Real Ultimate output --- This is Ultimate 0.2.1-dev-f8e1c90 [2021-11-09 09:36:38,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 09:36:38,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 09:36:38,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 09:36:38,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 09:36:38,215 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 09:36:38,218 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 09:36:38,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 09:36:38,230 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 09:36:38,237 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 09:36:38,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 09:36:38,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 09:36:38,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 09:36:38,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 09:36:38,248 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 09:36:38,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 09:36:38,257 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 09:36:38,258 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 09:36:38,261 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 09:36:38,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 09:36:38,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 09:36:38,278 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 09:36:38,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 09:36:38,285 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 09:36:38,296 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 09:36:38,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 09:36:38,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 09:36:38,301 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 09:36:38,301 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 09:36:38,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 09:36:38,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 09:36:38,306 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 09:36:38,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 09:36:38,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 09:36:38,312 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 09:36:38,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 09:36:38,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 09:36:38,314 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 09:36:38,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 09:36:38,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 09:36:38,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 09:36:38,319 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-09 09:36:38,370 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 09:36:38,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 09:36:38,370 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 09:36:38,371 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 09:36:38,372 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 09:36:38,372 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 09:36:38,373 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 09:36:38,373 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 09:36:38,373 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-09 09:36:38,373 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-09 09:36:38,374 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 09:36:38,374 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-09 09:36:38,374 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-09 09:36:38,374 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-09 09:36:38,374 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-09 09:36:38,375 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-09 09:36:38,375 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-09 09:36:38,375 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-09 09:36:38,375 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 09:36:38,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-09 09:36:38,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 09:36:38,376 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 09:36:38,376 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-09 09:36:38,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 09:36:38,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 09:36:38,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-09 09:36:38,378 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-09 09:36:38,378 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-09 09:36:38,379 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-09 09:36:38,379 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-09 09:36:38,379 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-09 09:36:38,379 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-09 09:36:38,380 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 09:36:38,380 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-09 09:36:38,380 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_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/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_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX 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 -> c41c899e123885a0a5b4b47d325ecb3bae7fd8ace0e033e73eafae066c754dcb [2021-11-09 09:36:38,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 09:36:38,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 09:36:38,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 09:36:38,933 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 09:36:38,935 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 09:36:38,937 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/float-benchs/cos_polynomial.c [2021-11-09 09:36:39,031 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/data/ced28bf4c/7aa2631676404aeab65c97d7af7fc0c7/FLAG25c5078d4 [2021-11-09 09:36:39,763 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 09:36:39,764 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/sv-benchmarks/c/float-benchs/cos_polynomial.c [2021-11-09 09:36:39,774 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/data/ced28bf4c/7aa2631676404aeab65c97d7af7fc0c7/FLAG25c5078d4 [2021-11-09 09:36:40,084 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/data/ced28bf4c/7aa2631676404aeab65c97d7af7fc0c7 [2021-11-09 09:36:40,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 09:36:40,091 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-09 09:36:40,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 09:36:40,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 09:36:40,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 09:36:40,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:36:40" (1/1) ... [2021-11-09 09:36:40,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f4b9b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:40, skipping insertion in model container [2021-11-09 09:36:40,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:36:40" (1/1) ... [2021-11-09 09:36:40,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 09:36:40,141 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 09:36:40,304 WARN L228 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_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/sv-benchmarks/c/float-benchs/cos_polynomial.c[619,632] [2021-11-09 09:36:40,328 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:36:40,346 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 09:36:40,380 WARN L228 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_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/sv-benchmarks/c/float-benchs/cos_polynomial.c[619,632] [2021-11-09 09:36:40,392 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:36:40,435 INFO L208 MainTranslator]: Completed translation [2021-11-09 09:36:40,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:40 WrapperNode [2021-11-09 09:36:40,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 09:36:40,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-09 09:36:40,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-09 09:36:40,438 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-09 09:36:40,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:40" (1/1) ... [2021-11-09 09:36:40,480 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:40" (1/1) ... [2021-11-09 09:36:40,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-09 09:36:40,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 09:36:40,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 09:36:40,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 09:36:40,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:40" (1/1) ... [2021-11-09 09:36:40,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:40" (1/1) ... [2021-11-09 09:36:40,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:40" (1/1) ... [2021-11-09 09:36:40,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:40" (1/1) ... [2021-11-09 09:36:40,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:40" (1/1) ... [2021-11-09 09:36:40,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:40" (1/1) ... [2021-11-09 09:36:40,588 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:40" (1/1) ... [2021-11-09 09:36:40,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 09:36:40,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 09:36:40,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 09:36:40,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 09:36:40,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:40" (1/1) ... [2021-11-09 09:36:40,606 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 09:36:40,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:36:40,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-09 09:36:40,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-09 09:36:40,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-09 09:36:40,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 09:36:40,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 09:36:40,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 09:36:48,301 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 09:36:48,301 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-11-09 09:36:48,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:36:48 BoogieIcfgContainer [2021-11-09 09:36:48,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 09:36:48,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-09 09:36:48,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-09 09:36:48,310 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-09 09:36:48,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:36:40" (1/3) ... [2021-11-09 09:36:48,312 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53694584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:36:48, skipping insertion in model container [2021-11-09 09:36:48,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:36:40" (2/3) ... [2021-11-09 09:36:48,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53694584 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:36:48, skipping insertion in model container [2021-11-09 09:36:48,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:36:48" (3/3) ... [2021-11-09 09:36:48,315 INFO L111 eAbstractionObserver]: Analyzing ICFG cos_polynomial.c [2021-11-09 09:36:48,322 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-09 09:36:48,323 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-09 09:36:48,395 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-09 09:36:48,403 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-09 09:36:48,403 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-09 09:36:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:48,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-09 09:36:48,428 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:48,429 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:48,430 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:48,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:48,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1236255304, now seen corresponding path program 1 times [2021-11-09 09:36:48,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-09 09:36:48,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551728460] [2021-11-09 09:36:48,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:48,458 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-09 09:36:48,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/mathsat [2021-11-09 09:36:48,460 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-09 09:36:48,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-09 09:36:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:36:51,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-09 09:36:51,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:36:51,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:36:51,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-09 09:36:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:36:51,795 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-09 09:36:51,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551728460] [2021-11-09 09:36:51,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551728460] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-09 09:36:51,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:36:51,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-09 09:36:51,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602285057] [2021-11-09 09:36:51,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-09 09:36:51,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-09 09:36:51,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-09 09:36:51,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-09 09:36:51,857 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2021-11-09 09:36:51,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:36:51,875 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2021-11-09 09:36:51,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-09 09:36:51,877 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) Word has length 10 [2021-11-09 09:36:51,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:36:51,887 INFO L225 Difference]: With dead ends: 31 [2021-11-09 09:36:51,888 INFO L226 Difference]: Without dead ends: 13 [2021-11-09 09:36:51,891 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-09 09:36:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-09 09:36:51,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-11-09 09:36:51,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:36:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-11-09 09:36:51,928 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2021-11-09 09:36:51,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:36:51,929 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-11-09 09:36:51,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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) [2021-11-09 09:36:51,930 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-11-09 09:36:51,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-09 09:36:51,931 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:36:51,931 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:36:52,042 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-09 09:36:52,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 [2021-11-09 09:36:52,153 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:36:52,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:36:52,154 INFO L85 PathProgramCache]: Analyzing trace with hash -2045601930, now seen corresponding path program 1 times [2021-11-09 09:36:52,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-09 09:36:52,156 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [531231527] [2021-11-09 09:36:52,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:36:52,156 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-09 09:36:52,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/mathsat [2021-11-09 09:36:52,158 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-09 09:36:52,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-09 09:39:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:39:02,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-09 09:39:02,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:39:39,912 WARN L207 SmtUtils]: Spent 14.77 s on a formula simplification that was a NOOP. DAG size: 42 [2021-11-09 09:40:04,896 WARN L207 SmtUtils]: Spent 5.87 s on a formula simplification that was a NOOP. DAG size: 43 [2021-11-09 09:40:10,293 WARN L207 SmtUtils]: Spent 5.36 s on a formula simplification that was a NOOP. DAG size: 8 [2021-11-09 09:40:20,412 WARN L207 SmtUtils]: Spent 5.28 s on a formula simplification that was a NOOP. DAG size: 6 [2021-11-09 09:40:25,699 WARN L207 SmtUtils]: Spent 5.29 s on a formula simplification that was a NOOP. DAG size: 3 [2021-11-09 09:40:28,094 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_mcos_~x_12 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.mul c_currentRoundingMode v_ULTIMATE.start_mcos_~x_12 v_ULTIMATE.start_mcos_~x_12)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)))) (and (= (fp.mul c_currentRoundingMode .cse0 .cse1) c_ULTIMATE.start_mcos_~hz~0) (= c_ULTIMATE.start_mcos_~zr~0 (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))) (fp.geq v_ULTIMATE.start_mcos_~x_12 (fp.neg .cse0)) (fp.lt v_ULTIMATE.start_mcos_~x_12 (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-09 09:40:38,557 WARN L207 SmtUtils]: Spent 5.42 s on a formula simplification that was a NOOP. DAG size: 6 [2021-11-09 09:40:44,062 WARN L207 SmtUtils]: Spent 5.50 s on a formula simplification that was a NOOP. DAG size: 3 [2021-11-09 09:40:46,590 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_mcos_~x_12 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)))) (and (= |c_ULTIMATE.start_mcos_#res| (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (let ((.cse1 (fp.mul c_currentRoundingMode v_ULTIMATE.start_mcos_~x_12 v_ULTIMATE.start_mcos_~x_12))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 22719295115576389653.0 2000000000000000000000000000000.0))))))))))))))))))) (fp.geq v_ULTIMATE.start_mcos_~x_12 (fp.neg .cse0)) (fp.lt v_ULTIMATE.start_mcos_~x_12 (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-09 09:40:54,590 WARN L207 SmtUtils]: Spent 5.46 s on a formula simplification that was a NOOP. DAG size: 40 [2021-11-09 09:41:00,129 WARN L207 SmtUtils]: Spent 5.53 s on a formula simplification that was a NOOP. DAG size: 39 [2021-11-09 09:41:05,579 WARN L207 SmtUtils]: Spent 5.45 s on a formula simplification that was a NOOP. DAG size: 6 [2021-11-09 09:41:11,022 WARN L207 SmtUtils]: Spent 5.44 s on a formula simplification that was a NOOP. DAG size: 3 [2021-11-09 09:41:21,527 WARN L207 SmtUtils]: Spent 5.49 s on a formula simplification that was a NOOP. DAG size: 6 [2021-11-09 09:41:26,535 WARN L207 SmtUtils]: Spent 5.01 s on a formula simplification that was a NOOP. DAG size: 41 [2021-11-09 09:41:32,026 WARN L207 SmtUtils]: Spent 5.49 s on a formula simplification that was a NOOP. DAG size: 3 [2021-11-09 09:41:39,940 WARN L207 SmtUtils]: Spent 5.46 s on a formula simplification that was a NOOP. DAG size: 6 [2021-11-09 09:41:45,420 WARN L207 SmtUtils]: Spent 5.48 s on a formula simplification that was a NOOP. DAG size: 3 [2021-11-09 09:41:50,475 WARN L207 SmtUtils]: Spent 5.05 s on a formula simplification that was a NOOP. DAG size: 40 [2021-11-09 09:41:55,954 WARN L207 SmtUtils]: Spent 5.48 s on a formula simplification that was a NOOP. DAG size: 41 [2021-11-09 09:42:01,457 WARN L207 SmtUtils]: Spent 5.50 s on a formula simplification that was a NOOP. DAG size: 40 [2021-11-09 09:42:06,963 WARN L207 SmtUtils]: Spent 5.50 s on a formula simplification that was a NOOP. DAG size: 6 [2021-11-09 09:42:12,461 WARN L207 SmtUtils]: Spent 5.50 s on a formula simplification that was a NOOP. DAG size: 3 [2021-11-09 09:42:18,003 WARN L207 SmtUtils]: Spent 5.54 s on a formula simplification that was a NOOP. DAG size: 40 [2021-11-09 09:42:23,501 WARN L207 SmtUtils]: Spent 5.50 s on a formula simplification that was a NOOP. DAG size: 39 [2021-11-09 09:42:29,072 WARN L207 SmtUtils]: Spent 5.57 s on a formula simplification that was a NOOP. DAG size: 3 [2021-11-09 09:42:34,592 WARN L207 SmtUtils]: Spent 5.50 s on a formula simplification that was a NOOP. DAG size: 41 [2021-11-09 09:42:40,111 WARN L207 SmtUtils]: Spent 5.52 s on a formula simplification that was a NOOP. DAG size: 40 [2021-11-09 09:42:45,638 WARN L207 SmtUtils]: Spent 5.53 s on a formula simplification that was a NOOP. DAG size: 3 [2021-11-09 09:42:51,147 WARN L207 SmtUtils]: Spent 5.51 s on a formula simplification that was a NOOP. DAG size: 6 [2021-11-09 09:42:56,659 WARN L207 SmtUtils]: Spent 5.51 s on a formula simplification that was a NOOP. DAG size: 3 [2021-11-09 09:42:59,155 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_mcos_~x_12 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (let ((.cse2 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse4 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_12 v_ULTIMATE.start_mcos_~x_12))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))))) (let ((.cse0 (fp.leq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))) (.cse1 (fp.geq .cse2 (_ +zero 11 53)))) (or (and .cse0 .cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and (or (not .cse0) (not .cse1)) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))))) (fp.geq v_ULTIMATE.start_mcos_~x_12 (fp.neg .cse3)) (fp.lt v_ULTIMATE.start_mcos_~x_12 (_ +zero 11 53))))) is different from false [2021-11-09 09:43:01,388 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_mcos_~x_12 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (let ((.cse2 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse4 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_12 v_ULTIMATE.start_mcos_~x_12))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))))) (let ((.cse0 (fp.leq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))) (.cse1 (fp.geq .cse2 (_ +zero 11 53)))) (or (and .cse0 .cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and (or (not .cse0) (not .cse1)) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))))) (fp.geq v_ULTIMATE.start_mcos_~x_12 (fp.neg .cse3)) (fp.lt v_ULTIMATE.start_mcos_~x_12 (_ +zero 11 53))))) is different from true [2021-11-09 09:43:11,840 WARN L207 SmtUtils]: Spent 5.50 s on a formula simplification that was a NOOP. DAG size: 6 [2021-11-09 09:43:16,942 WARN L207 SmtUtils]: Spent 5.10 s on a formula simplification that was a NOOP. DAG size: 41 [2021-11-09 09:43:22,427 WARN L207 SmtUtils]: Spent 5.48 s on a formula simplification that was a NOOP. DAG size: 3 [2021-11-09 09:43:30,473 WARN L207 SmtUtils]: Spent 5.55 s on a formula simplification that was a NOOP. DAG size: 6 [2021-11-09 09:43:36,000 WARN L207 SmtUtils]: Spent 5.53 s on a formula simplification that was a NOOP. DAG size: 3 [2021-11-09 09:43:41,004 WARN L207 SmtUtils]: Spent 5.00 s on a formula simplification that was a NOOP. DAG size: 40 [2021-11-09 09:43:46,541 WARN L207 SmtUtils]: Spent 5.53 s on a formula simplification that was a NOOP. DAG size: 41 [2021-11-09 09:43:52,104 WARN L207 SmtUtils]: Spent 5.56 s on a formula simplification that was a NOOP. DAG size: 40 [2021-11-09 09:43:57,613 WARN L207 SmtUtils]: Spent 5.51 s on a formula simplification that was a NOOP. DAG size: 6 [2021-11-09 09:44:03,147 WARN L207 SmtUtils]: Spent 5.53 s on a formula simplification that was a NOOP. DAG size: 3 [2021-11-09 09:44:05,626 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_mcos_~x_12 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (let ((.cse0 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse2 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_12 v_ULTIMATE.start_mcos_~x_12))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))))) (or (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))) (not (fp.geq .cse0 (_ +zero 11 53))))) (fp.geq v_ULTIMATE.start_mcos_~x_12 (fp.neg .cse1)) (fp.lt v_ULTIMATE.start_mcos_~x_12 (_ +zero 11 53))))) is different from false [2021-11-09 09:44:07,870 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_mcos_~x_12 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (let ((.cse0 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse2 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_12 v_ULTIMATE.start_mcos_~x_12))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))))) (or (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))) (not (fp.geq .cse0 (_ +zero 11 53))))) (fp.geq v_ULTIMATE.start_mcos_~x_12 (fp.neg .cse1)) (fp.lt v_ULTIMATE.start_mcos_~x_12 (_ +zero 11 53))))) is different from true [2021-11-09 09:44:07,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:44:07,871 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-09 09:44:39,448 WARN L207 SmtUtils]: Spent 7.33 s on a formula simplification that was a NOOP. DAG size: 13 [2021-11-09 09:44:45,136 WARN L207 SmtUtils]: Spent 5.68 s on a formula simplification that was a NOOP. DAG size: 30 [2021-11-09 09:44:50,712 WARN L207 SmtUtils]: Spent 5.57 s on a formula simplification that was a NOOP. DAG size: 29 [2021-11-09 09:44:53,194 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) c_ULTIMATE.start_mcos_~z~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C1~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C2~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C3~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C4~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C5~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 c_~C6~0)))))))))))))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (fp.geq .cse0 (_ +zero 11 53)))) is different from false [2021-11-09 09:44:55,673 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) c_ULTIMATE.start_mcos_~z~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C1~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C2~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C3~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C4~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C5~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 c_~C6~0)))))))))))))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (fp.geq .cse0 (_ +zero 11 53)))) is different from true [2021-11-09 09:45:01,551 WARN L207 SmtUtils]: Spent 5.86 s on a formula simplification that was a NOOP. DAG size: 30 [2021-11-09 09:45:07,145 WARN L207 SmtUtils]: Spent 5.59 s on a formula simplification that was a NOOP. DAG size: 29 [2021-11-09 09:45:12,769 WARN L207 SmtUtils]: Spent 5.62 s on a formula simplification that was a NOOP. DAG size: 4 [2021-11-09 09:45:15,285 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) c_ULTIMATE.start_mcos_~z~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C1~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C2~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C3~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C4~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C5~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 c_~C6~0)))))))))))))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (fp.geq .cse0 (_ +zero 11 53)))) (not (fp.lt c_ULTIMATE.start_mcos_~x (_ +zero 11 53)))) is different from false [2021-11-09 09:45:17,790 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) c_ULTIMATE.start_mcos_~z~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C1~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C2~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C3~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C4~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C5~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 c_~C6~0)))))))))))))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (fp.geq .cse0 (_ +zero 11 53)))) (not (fp.lt c_ULTIMATE.start_mcos_~x (_ +zero 11 53)))) is different from true [2021-11-09 09:45:23,922 WARN L207 SmtUtils]: Spent 6.12 s on a formula simplification that was a NOOP. DAG size: 4 [2021-11-09 09:45:29,832 WARN L207 SmtUtils]: Spent 5.91 s on a formula simplification that was a NOOP. DAG size: 30 [2021-11-09 09:45:35,731 WARN L207 SmtUtils]: Spent 5.90 s on a formula simplification that was a NOOP. DAG size: 31 [2021-11-09 09:45:38,340 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.lt c_ULTIMATE.start_main_~a~1 (_ +zero 11 53))) (let ((.cse0 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~a~1 c_ULTIMATE.start_main_~a~1))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse1) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode c_~C1~0 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode c_~C2~0 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode c_~C3~0 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode c_~C4~0 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode c_~C5~0 (fp.mul c_currentRoundingMode .cse1 c_~C6~0))))))))))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))))) is different from false [2021-11-09 09:45:40,942 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.lt c_ULTIMATE.start_main_~a~1 (_ +zero 11 53))) (let ((.cse0 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~a~1 c_ULTIMATE.start_main_~a~1))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse1) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode c_~C1~0 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode c_~C2~0 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode c_~C3~0 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode c_~C4~0 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode c_~C5~0 (fp.mul c_currentRoundingMode .cse1 c_~C6~0))))))))))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))))) is different from true [2021-11-09 09:45:46,948 WARN L207 SmtUtils]: Spent 5.97 s on a formula simplification that was a NOOP. DAG size: 4 [2021-11-09 09:45:52,964 WARN L207 SmtUtils]: Spent 6.01 s on a formula simplification that was a NOOP. DAG size: 30 [2021-11-09 09:45:59,049 WARN L207 SmtUtils]: Spent 6.08 s on a formula simplification that was a NOOP. DAG size: 31 [2021-11-09 09:46:05,008 WARN L207 SmtUtils]: Spent 5.95 s on a formula simplification that was a NOOP. DAG size: 3 [2021-11-09 09:46:07,645 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.lt c_ULTIMATE.start_main_~a~1 (_ +zero 11 53))) (let ((.cse0 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~a~1 c_ULTIMATE.start_main_~a~1))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse1) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode c_~C1~0 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode c_~C2~0 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode c_~C3~0 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode c_~C4~0 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode c_~C5~0 (fp.mul c_currentRoundingMode .cse1 c_~C6~0))))))))))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) is different from false [2021-11-09 09:46:10,251 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.lt c_ULTIMATE.start_main_~a~1 (_ +zero 11 53))) (let ((.cse0 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~a~1 c_ULTIMATE.start_main_~a~1))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) .cse1) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode c_~C1~0 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode c_~C2~0 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode c_~C3~0 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode c_~C4~0 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode c_~C5~0 (fp.mul c_currentRoundingMode .cse1 c_~C6~0))))))))))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) is different from true [2021-11-09 09:46:15,607 WARN L207 SmtUtils]: Spent 5.32 s on a formula simplification that was a NOOP. DAG size: 31 [2021-11-09 09:46:21,569 WARN L207 SmtUtils]: Spent 5.96 s on a formula simplification that was a NOOP. DAG size: 7 [2021-11-09 09:46:31,449 WARN L207 SmtUtils]: Spent 5.95 s on a formula simplification that was a NOOP. DAG size: 4 [2021-11-09 09:46:36,782 WARN L207 SmtUtils]: Spent 5.33 s on a formula simplification that was a NOOP. DAG size: 30 [2021-11-09 09:46:42,778 WARN L207 SmtUtils]: Spent 6.00 s on a formula simplification that was a NOOP. DAG size: 7 [2021-11-09 09:46:52,748 WARN L207 SmtUtils]: Spent 5.99 s on a formula simplification that was a NOOP. DAG size: 4 [2021-11-09 09:46:58,739 WARN L207 SmtUtils]: Spent 5.99 s on a formula simplification that was a NOOP. DAG size: 30 [2021-11-09 09:47:04,744 WARN L207 SmtUtils]: Spent 6.00 s on a formula simplification that was a NOOP. DAG size: 31 [2021-11-09 09:47:10,805 WARN L207 SmtUtils]: Spent 6.06 s on a formula simplification that was a NOOP. DAG size: 7 [2021-11-09 09:47:20,868 WARN L207 SmtUtils]: Spent 6.03 s on a formula simplification that was a NOOP. DAG size: 4 [2021-11-09 09:47:23,114 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~1_7 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)))) (or (let ((.cse0 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (let ((.cse2 (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~a~1_7 v_ULTIMATE.start_main_~a~1_7))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C1~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C2~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C3~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C4~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C5~0 (fp.mul c_currentRoundingMode .cse2 c_~C6~0))))))))))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))))) (not (fp.geq v_ULTIMATE.start_main_~a~1_7 (fp.neg .cse1))) (not (fp.lt v_ULTIMATE.start_main_~a~1_7 (_ +zero 11 53)))))) is different from false [2021-11-09 09:47:25,808 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~1_7 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)))) (or (let ((.cse0 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (let ((.cse2 (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~a~1_7 v_ULTIMATE.start_main_~a~1_7))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C1~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C2~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C3~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C4~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C5~0 (fp.mul c_currentRoundingMode .cse2 c_~C6~0))))))))))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))))) (not (fp.geq v_ULTIMATE.start_main_~a~1_7 (fp.neg .cse1))) (not (fp.lt v_ULTIMATE.start_main_~a~1_7 (_ +zero 11 53)))))) is different from true [2021-11-09 09:47:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:47:25,810 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-09 09:47:25,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [531231527] [2021-11-09 09:47:25,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [531231527] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-09 09:47:25,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:47:25,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2021-11-09 09:47:25,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492091948] [2021-11-09 09:47:25,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-09 09:47:25,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-09 09:47:25,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-09 09:47:25,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=64, Unknown=23, NotChecked=216, Total=342 [2021-11-09 09:47:25,816 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 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) [2021-11-09 09:47:30,385 WARN L838 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 416666666666666019037.0 10000000000000000000000.0)) c_~C1~0) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 22719295115576389653.0 2000000000000000000000000000000.0))) c_~C6~0) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 55114628702781326607.0 200000000000000000000000000.0))) c_~C4~0) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 20875723212981748279.0 10000000000000000000000000000.0)) c_~C5~0) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 124007936447383647089.0 5000000000000000000000000.0)) c_~C3~0) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 138888888888741095749.0 100000000000000000000000.0))) c_~C2~0) (forall ((v_ULTIMATE.start_main_~a~1_7 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)))) (or (let ((.cse0 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (let ((.cse2 (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~a~1_7 v_ULTIMATE.start_main_~a~1_7))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C1~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C2~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C3~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C4~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C5~0 (fp.mul c_currentRoundingMode .cse2 c_~C6~0))))))))))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))))) (not (fp.geq v_ULTIMATE.start_main_~a~1_7 (fp.neg .cse1))) (not (fp.lt v_ULTIMATE.start_main_~a~1_7 (_ +zero 11 53)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-09 09:47:33,154 WARN L860 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 416666666666666019037.0 10000000000000000000000.0)) c_~C1~0) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 22719295115576389653.0 2000000000000000000000000000000.0))) c_~C6~0) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 55114628702781326607.0 200000000000000000000000000.0))) c_~C4~0) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 20875723212981748279.0 10000000000000000000000000000.0)) c_~C5~0) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 124007936447383647089.0 5000000000000000000000000.0)) c_~C3~0) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 138888888888741095749.0 100000000000000000000000.0))) c_~C2~0) (forall ((v_ULTIMATE.start_main_~a~1_7 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)))) (or (let ((.cse0 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (let ((.cse2 (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~a~1_7 v_ULTIMATE.start_main_~a~1_7))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C1~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C2~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C3~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C4~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C5~0 (fp.mul c_currentRoundingMode .cse2 c_~C6~0))))))))))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))))) (not (fp.geq v_ULTIMATE.start_main_~a~1_7 (fp.neg .cse1))) (not (fp.lt v_ULTIMATE.start_main_~a~1_7 (_ +zero 11 53)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-09 09:47:35,644 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0))) (.cse2 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 416666666666666019037.0 10000000000000000000000.0)) c_~C1~0) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 22719295115576389653.0 2000000000000000000000000000000.0))) c_~C6~0) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 55114628702781326607.0 200000000000000000000000000.0))) c_~C4~0) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 20875723212981748279.0 10000000000000000000000000000.0)) c_~C5~0) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 124007936447383647089.0 5000000000000000000000000.0)) c_~C3~0) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 138888888888741095749.0 100000000000000000000000.0))) c_~C2~0) (let ((.cse0 (fp.geq c_ULTIMATE.start_main_~a~1 (fp.neg .cse3))) (.cse1 (fp.leq c_ULTIMATE.start_main_~a~1 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 4.0))))) (or (and (or (not .cse0) (not .cse1)) .cse2) (and .cse0 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.lt c_ULTIMATE.start_main_~a~1 (_ +zero 11 53))) (let ((.cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (let ((.cse5 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~a~1 c_ULTIMATE.start_main_~a~1))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse5) (fp.mul c_currentRoundingMode .cse5 (fp.mul c_currentRoundingMode .cse5 (fp.add c_currentRoundingMode c_~C1~0 (fp.mul c_currentRoundingMode .cse5 (fp.add c_currentRoundingMode c_~C2~0 (fp.mul c_currentRoundingMode .cse5 (fp.add c_currentRoundingMode c_~C3~0 (fp.mul c_currentRoundingMode .cse5 (fp.add c_currentRoundingMode c_~C4~0 (fp.mul c_currentRoundingMode .cse5 (fp.add c_currentRoundingMode c_~C5~0 (fp.mul c_currentRoundingMode .cse5 c_~C6~0))))))))))))))))) (and (fp.geq .cse4 (_ +zero 11 53)) (fp.leq .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))))) .cse2))) is different from false [2021-11-09 09:47:38,229 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0))) (.cse2 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 416666666666666019037.0 10000000000000000000000.0)) c_~C1~0) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 22719295115576389653.0 2000000000000000000000000000000.0))) c_~C6~0) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 55114628702781326607.0 200000000000000000000000000.0))) c_~C4~0) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 20875723212981748279.0 10000000000000000000000000000.0)) c_~C5~0) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 124007936447383647089.0 5000000000000000000000000.0)) c_~C3~0) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 138888888888741095749.0 100000000000000000000000.0))) c_~C2~0) (let ((.cse0 (fp.geq c_ULTIMATE.start_main_~a~1 (fp.neg .cse3))) (.cse1 (fp.leq c_ULTIMATE.start_main_~a~1 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 4.0))))) (or (and (or (not .cse0) (not .cse1)) .cse2) (and .cse0 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.lt c_ULTIMATE.start_main_~a~1 (_ +zero 11 53))) (let ((.cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (let ((.cse5 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~a~1 c_ULTIMATE.start_main_~a~1))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 .cse5) (fp.mul c_currentRoundingMode .cse5 (fp.mul c_currentRoundingMode .cse5 (fp.add c_currentRoundingMode c_~C1~0 (fp.mul c_currentRoundingMode .cse5 (fp.add c_currentRoundingMode c_~C2~0 (fp.mul c_currentRoundingMode .cse5 (fp.add c_currentRoundingMode c_~C3~0 (fp.mul c_currentRoundingMode .cse5 (fp.add c_currentRoundingMode c_~C4~0 (fp.mul c_currentRoundingMode .cse5 (fp.add c_currentRoundingMode c_~C5~0 (fp.mul c_currentRoundingMode .cse5 c_~C6~0))))))))))))))))) (and (fp.geq .cse4 (_ +zero 11 53)) (fp.leq .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))))) .cse2))) is different from true [2021-11-09 09:47:40,756 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 416666666666666019037.0 10000000000000000000000.0)) c_~C1~0) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 22719295115576389653.0 2000000000000000000000000000000.0))) c_~C6~0) (fp.geq c_ULTIMATE.start_main_~a~1 (fp.neg .cse0)) (fp.leq c_ULTIMATE.start_main_~a~1 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 4.0))) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 55114628702781326607.0 200000000000000000000000000.0))) c_~C4~0) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 20875723212981748279.0 10000000000000000000000000000.0)) c_~C5~0) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 124007936447383647089.0 5000000000000000000000000.0)) c_~C3~0) (or (not (fp.lt c_ULTIMATE.start_main_~a~1 (_ +zero 11 53))) (let ((.cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (let ((.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~a~1 c_ULTIMATE.start_main_~a~1))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C1~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C2~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C3~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C4~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C5~0 (fp.mul c_currentRoundingMode .cse2 c_~C6~0))))))))))))))))) (and (fp.geq .cse1 (_ +zero 11 53)) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))))) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 138888888888741095749.0 100000000000000000000000.0))) c_~C2~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-09 09:47:43,343 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 416666666666666019037.0 10000000000000000000000.0)) c_~C1~0) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 22719295115576389653.0 2000000000000000000000000000000.0))) c_~C6~0) (fp.geq c_ULTIMATE.start_main_~a~1 (fp.neg .cse0)) (fp.leq c_ULTIMATE.start_main_~a~1 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 4.0))) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 55114628702781326607.0 200000000000000000000000000.0))) c_~C4~0) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 20875723212981748279.0 10000000000000000000000000000.0)) c_~C5~0) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 124007936447383647089.0 5000000000000000000000000.0)) c_~C3~0) (or (not (fp.lt c_ULTIMATE.start_main_~a~1 (_ +zero 11 53))) (let ((.cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (let ((.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~a~1 c_ULTIMATE.start_main_~a~1))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C1~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C2~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C3~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C4~0 (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode c_~C5~0 (fp.mul c_currentRoundingMode .cse2 c_~C6~0))))))))))))))))) (and (fp.geq .cse1 (_ +zero 11 53)) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))))) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 138888888888741095749.0 100000000000000000000000.0))) c_~C2~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-09 09:47:45,788 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)))) (and (fp.geq c_ULTIMATE.start_mcos_~x (fp.neg .cse0)) (or (let ((.cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_mcos_~z~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C1~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C2~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C3~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C4~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C5~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 c_~C6~0)))))))))))))))) (and (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (fp.geq .cse1 (_ +zero 11 53)))) (not (fp.lt c_ULTIMATE.start_mcos_~x (_ +zero 11 53)))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 416666666666666019037.0 10000000000000000000000.0)) c_~C1~0) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 22719295115576389653.0 2000000000000000000000000000000.0))) c_~C6~0) (fp.leq c_ULTIMATE.start_mcos_~x ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 4.0))) (= c_ULTIMATE.start_mcos_~z~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~x c_ULTIMATE.start_mcos_~x)) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 55114628702781326607.0 200000000000000000000000000.0))) c_~C4~0) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 20875723212981748279.0 10000000000000000000000000000.0)) c_~C5~0) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 124007936447383647089.0 5000000000000000000000000.0)) c_~C3~0) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 138888888888741095749.0 100000000000000000000000.0))) c_~C2~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-09 09:47:48,294 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)))) (and (fp.geq c_ULTIMATE.start_mcos_~x (fp.neg .cse0)) (or (let ((.cse1 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_mcos_~z~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C1~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C2~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C3~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C4~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C5~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 c_~C6~0)))))))))))))))) (and (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (fp.geq .cse1 (_ +zero 11 53)))) (not (fp.lt c_ULTIMATE.start_mcos_~x (_ +zero 11 53)))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 416666666666666019037.0 10000000000000000000000.0)) c_~C1~0) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 22719295115576389653.0 2000000000000000000000000000000.0))) c_~C6~0) (fp.leq c_ULTIMATE.start_mcos_~x ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 4.0))) (= c_ULTIMATE.start_mcos_~z~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~x c_ULTIMATE.start_mcos_~x)) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 55114628702781326607.0 200000000000000000000000000.0))) c_~C4~0) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 20875723212981748279.0 10000000000000000000000000000.0)) c_~C5~0) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 124007936447383647089.0 5000000000000000000000000.0)) c_~C3~0) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 138888888888741095749.0 100000000000000000000000.0))) c_~C2~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-09 09:47:50,731 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) c_ULTIMATE.start_mcos_~z~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C1~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C2~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C3~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C4~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C5~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 c_~C6~0)))))))))))))))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 416666666666666019037.0 10000000000000000000000.0)) c_~C1~0) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 22719295115576389653.0 2000000000000000000000000000000.0))) c_~C6~0) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (fp.geq .cse0 (_ +zero 11 53)) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 55114628702781326607.0 200000000000000000000000000.0))) c_~C4~0) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 20875723212981748279.0 10000000000000000000000000000.0)) c_~C5~0) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 124007936447383647089.0 5000000000000000000000000.0)) c_~C3~0) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 138888888888741095749.0 100000000000000000000000.0))) c_~C2~0) (exists ((v_ULTIMATE.start_mcos_~x_12 (_ FloatingPoint 11 53))) (and (= c_ULTIMATE.start_mcos_~z~0 (fp.mul c_currentRoundingMode v_ULTIMATE.start_mcos_~x_12 v_ULTIMATE.start_mcos_~x_12)) (fp.geq v_ULTIMATE.start_mcos_~x_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)))) (fp.lt v_ULTIMATE.start_mcos_~x_12 (_ +zero 11 53)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-09 09:47:53,228 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) c_ULTIMATE.start_mcos_~z~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C1~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C2~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C3~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C4~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 (fp.add c_currentRoundingMode c_~C5~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_mcos_~z~0 c_~C6~0)))))))))))))))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 416666666666666019037.0 10000000000000000000000.0)) c_~C1~0) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 22719295115576389653.0 2000000000000000000000000000000.0))) c_~C6~0) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (fp.geq .cse0 (_ +zero 11 53)) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 55114628702781326607.0 200000000000000000000000000.0))) c_~C4~0) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 20875723212981748279.0 10000000000000000000000000000.0)) c_~C5~0) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 124007936447383647089.0 5000000000000000000000000.0)) c_~C3~0) (= (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 138888888888741095749.0 100000000000000000000000.0))) c_~C2~0) (exists ((v_ULTIMATE.start_mcos_~x_12 (_ FloatingPoint 11 53))) (and (= c_ULTIMATE.start_mcos_~z~0 (fp.mul c_currentRoundingMode v_ULTIMATE.start_mcos_~x_12 v_ULTIMATE.start_mcos_~x_12)) (fp.geq v_ULTIMATE.start_mcos_~x_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)))) (fp.lt v_ULTIMATE.start_mcos_~x_12 (_ +zero 11 53)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-09 09:47:55,607 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (fp.sub c_currentRoundingMode c_ULTIMATE.start_mcos_~hz~0 c_ULTIMATE.start_mcos_~zr~0)))) (and (exists ((v_ULTIMATE.start_mcos_~x_12 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.mul c_currentRoundingMode v_ULTIMATE.start_mcos_~x_12 v_ULTIMATE.start_mcos_~x_12)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)))) (and (= (fp.mul c_currentRoundingMode .cse0 .cse1) c_ULTIMATE.start_mcos_~hz~0) (= c_ULTIMATE.start_mcos_~zr~0 (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))) (fp.geq v_ULTIMATE.start_mcos_~x_12 (fp.neg .cse0)) (fp.lt v_ULTIMATE.start_mcos_~x_12 (_ +zero 11 53))))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq .cse2 (_ +zero 11 53)))) is different from false [2021-11-09 09:47:57,920 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (fp.sub c_currentRoundingMode c_ULTIMATE.start_mcos_~hz~0 c_ULTIMATE.start_mcos_~zr~0)))) (and (exists ((v_ULTIMATE.start_mcos_~x_12 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.mul c_currentRoundingMode v_ULTIMATE.start_mcos_~x_12 v_ULTIMATE.start_mcos_~x_12)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)))) (and (= (fp.mul c_currentRoundingMode .cse0 .cse1) c_ULTIMATE.start_mcos_~hz~0) (= c_ULTIMATE.start_mcos_~zr~0 (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))) (fp.geq v_ULTIMATE.start_mcos_~x_12 (fp.neg .cse0)) (fp.lt v_ULTIMATE.start_mcos_~x_12 (_ +zero 11 53))))) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq .cse2 (_ +zero 11 53)))) is different from true [2021-11-09 09:48:07,807 WARN L838 $PredicateComparison]: unable to prove that (and (fp.leq |c_ULTIMATE.start_mcos_#res| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (fp.geq |c_ULTIMATE.start_mcos_#res| (_ +zero 11 53)) (exists ((v_ULTIMATE.start_mcos_~x_12 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)))) (and (= |c_ULTIMATE.start_mcos_#res| (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) (let ((.cse1 (fp.mul c_currentRoundingMode v_ULTIMATE.start_mcos_~x_12 v_ULTIMATE.start_mcos_~x_12))) (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul c_currentRoundingMode .cse1 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 22719295115576389653.0 2000000000000000000000000000000.0))))))))))))))))))) (fp.geq v_ULTIMATE.start_mcos_~x_12 (fp.neg .cse0)) (fp.lt v_ULTIMATE.start_mcos_~x_12 (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-09 09:48:13,595 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_mcos_~x_12 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (let ((.cse2 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse4 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_12 v_ULTIMATE.start_mcos_~x_12))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))))) (let ((.cse0 (fp.leq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))) (.cse1 (fp.geq .cse2 (_ +zero 11 53)))) (or (and .cse0 .cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))) (and (or (not .cse0) (not .cse1)) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))))) (fp.geq v_ULTIMATE.start_mcos_~x_12 (fp.neg .cse3)) (fp.lt v_ULTIMATE.start_mcos_~x_12 (_ +zero 11 53))))) (not (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) is different from false [2021-11-09 09:48:30,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:48:30,402 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2021-11-09 09:48:30,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-09 09:48:30,403 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-09 09:48:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:48:30,403 INFO L225 Difference]: With dead ends: 19 [2021-11-09 09:48:30,403 INFO L226 Difference]: Without dead ends: 15 [2021-11-09 09:48:30,405 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 137.3s TimeCoverageRelationStatistics Valid=55, Invalid=66, Unknown=37, NotChecked=544, Total=702 [2021-11-09 09:48:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-11-09 09:48:30,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-11-09 09:48:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:48:30,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-11-09 09:48:30,409 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2021-11-09 09:48:30,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:48:30,409 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-11-09 09:48:30,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 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) [2021-11-09 09:48:30,410 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2021-11-09 09:48:30,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-09 09:48:30,411 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:48:30,411 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:48:30,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-09 09:48:30,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 [2021-11-09 09:48:30,619 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:48:30,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:48:30,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1988343628, now seen corresponding path program 1 times [2021-11-09 09:48:30,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-09 09:48:30,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650761919] [2021-11-09 09:48:30,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:48:30,621 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-09 09:48:30,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/mathsat [2021-11-09 09:48:30,622 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-09 09:48:30,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a0c01c9-14a1-4b5f-bf5c-ea173b9dfd1f/bin/uautomizer-IVEQpCNsaX/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-09 09:49:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:49:30,476 WARN L261 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 23 conjunts are in the unsatisfiable core [2021-11-09 09:49:30,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:50:09,493 WARN L207 SmtUtils]: Spent 15.77 s on a formula simplification that was a NOOP. DAG size: 42 [2021-11-09 09:50:42,605 WARN L207 SmtUtils]: Spent 12.81 s on a formula simplification that was a NOOP. DAG size: 41 [2021-11-09 09:50:47,715 WARN L207 SmtUtils]: Spent 5.09 s on a formula simplification that was a NOOP. DAG size: 8 [2021-11-09 09:50:52,774 WARN L207 SmtUtils]: Spent 5.05 s on a formula simplification that was a NOOP. DAG size: 5