./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 aa6dc04e2032f85ae9f089e49cae5f055c266957 .......................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 aa6dc04e2032f85ae9f089e49cae5f055c266957 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-10-24 23:27:48,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 23:27:48,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 23:27:48,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 23:27:48,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 23:27:48,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 23:27:48,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 23:27:48,919 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 23:27:48,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 23:27:48,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 23:27:48,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 23:27:48,944 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 23:27:48,945 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 23:27:48,947 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 23:27:48,949 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 23:27:48,951 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 23:27:48,952 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 23:27:48,956 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 23:27:48,959 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 23:27:48,967 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 23:27:48,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 23:27:48,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 23:27:48,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 23:27:48,976 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 23:27:48,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 23:27:48,985 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 23:27:48,985 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 23:27:48,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 23:27:48,988 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 23:27:48,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 23:27:48,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 23:27:48,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 23:27:48,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 23:27:48,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 23:27:48,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 23:27:48,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 23:27:48,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 23:27:48,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 23:27:48,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 23:27:48,999 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 23:27:49,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 23:27:49,001 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-24 23:27:49,058 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 23:27:49,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 23:27:49,063 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 23:27:49,063 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 23:27:49,063 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 23:27:49,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 23:27:49,064 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 23:27:49,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 23:27:49,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 23:27:49,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 23:27:49,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 23:27:49,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 23:27:49,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 23:27:49,067 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 23:27:49,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 23:27:49,067 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 23:27:49,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 23:27:49,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 23:27:49,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 23:27:49,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 23:27:49,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 23:27:49,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 23:27:49,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 23:27:49,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 23:27:49,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 23:27:49,070 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-24 23:27:49,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-24 23:27:49,070 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 23:27:49,070 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 23:27:49,070 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> aa6dc04e2032f85ae9f089e49cae5f055c266957 [2020-10-24 23:27:49,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 23:27:49,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 23:27:49,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 23:27:49,625 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 23:27:49,626 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 23:27:49,628 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2020-10-24 23:27:49,708 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a4b5af9c/c53e260759064389bb230698dd58de50/FLAG7501f2861 [2020-10-24 23:27:50,403 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 23:27:50,404 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2020-10-24 23:27:50,413 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a4b5af9c/c53e260759064389bb230698dd58de50/FLAG7501f2861 [2020-10-24 23:27:50,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a4b5af9c/c53e260759064389bb230698dd58de50 [2020-10-24 23:27:50,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 23:27:50,754 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 23:27:50,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 23:27:50,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 23:27:50,763 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 23:27:50,764 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:27:50" (1/1) ... [2020-10-24 23:27:50,769 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d750e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:50, skipping insertion in model container [2020-10-24 23:27:50,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:27:50" (1/1) ... [2020-10-24 23:27:50,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 23:27:50,808 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 23:27:51,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 23:27:51,047 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 23:27:51,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 23:27:51,115 INFO L208 MainTranslator]: Completed translation [2020-10-24 23:27:51,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:51 WrapperNode [2020-10-24 23:27:51,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 23:27:51,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 23:27:51,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 23:27:51,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 23:27:51,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:51" (1/1) ... [2020-10-24 23:27:51,158 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:51" (1/1) ... [2020-10-24 23:27:51,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 23:27:51,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 23:27:51,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 23:27:51,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 23:27:51,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:51" (1/1) ... [2020-10-24 23:27:51,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:51" (1/1) ... [2020-10-24 23:27:51,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:51" (1/1) ... [2020-10-24 23:27:51,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:51" (1/1) ... [2020-10-24 23:27:51,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:51" (1/1) ... [2020-10-24 23:27:51,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:51" (1/1) ... [2020-10-24 23:27:51,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:51" (1/1) ... [2020-10-24 23:27:51,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 23:27:51,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 23:27:51,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 23:27:51,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 23:27:51,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 23:27:51,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 23:27:51,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 23:27:51,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 23:27:51,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 23:27:51,684 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 23:27:51,685 INFO L298 CfgBuilder]: Removed 11 assume(true) statements. [2020-10-24 23:27:51,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:27:51 BoogieIcfgContainer [2020-10-24 23:27:51,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 23:27:51,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 23:27:51,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 23:27:51,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 23:27:51,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:27:50" (1/3) ... [2020-10-24 23:27:51,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643a99cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:27:51, skipping insertion in model container [2020-10-24 23:27:51,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:51" (2/3) ... [2020-10-24 23:27:51,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643a99cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:27:51, skipping insertion in model container [2020-10-24 23:27:51,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:27:51" (3/3) ... [2020-10-24 23:27:51,713 INFO L111 eAbstractionObserver]: Analyzing ICFG loop3.c [2020-10-24 23:27:51,739 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 23:27:51,750 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 23:27:51,773 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 23:27:51,824 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 23:27:51,825 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 23:27:51,825 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 23:27:51,825 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 23:27:51,825 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 23:27:51,825 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 23:27:51,826 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 23:27:51,826 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 23:27:51,852 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-10-24 23:27:51,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-24 23:27:51,859 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 23:27:51,860 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 23:27:51,861 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 23:27:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 23:27:51,869 INFO L82 PathProgramCache]: Analyzing trace with hash 119997515, now seen corresponding path program 1 times [2020-10-24 23:27:51,880 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 23:27:51,881 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004943095] [2020-10-24 23:27:51,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 23:27:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 23:27:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 23:27:52,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004943095] [2020-10-24 23:27:52,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 23:27:52,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-24 23:27:52,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419560886] [2020-10-24 23:27:52,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-24 23:27:52,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 23:27:52,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-24 23:27:52,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 23:27:52,140 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2020-10-24 23:27:52,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 23:27:52,163 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2020-10-24 23:27:52,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-24 23:27:52,165 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2020-10-24 23:27:52,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 23:27:52,184 INFO L225 Difference]: With dead ends: 30 [2020-10-24 23:27:52,190 INFO L226 Difference]: Without dead ends: 12 [2020-10-24 23:27:52,196 INFO L677 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 [2020-10-24 23:27:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-10-24 23:27:52,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-10-24 23:27:52,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-24 23:27:52,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2020-10-24 23:27:52,238 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 8 [2020-10-24 23:27:52,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 23:27:52,239 INFO L481 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-10-24 23:27:52,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-24 23:27:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2020-10-24 23:27:52,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-24 23:27:52,242 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 23:27:52,243 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 23:27:52,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 23:27:52,243 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 23:27:52,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 23:27:52,247 INFO L82 PathProgramCache]: Analyzing trace with hash -2105434535, now seen corresponding path program 1 times [2020-10-24 23:27:52,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 23:27:52,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216074489] [2020-10-24 23:27:52,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 23:27:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 23:27:52,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 23:27:52,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216074489] [2020-10-24 23:27:52,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 23:27:52,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-24 23:27:52,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952333973] [2020-10-24 23:27:52,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-24 23:27:52,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 23:27:52,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-24 23:27:52,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 23:27:52,403 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2020-10-24 23:27:52,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 23:27:52,440 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-10-24 23:27:52,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-24 23:27:52,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-24 23:27:52,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 23:27:52,443 INFO L225 Difference]: With dead ends: 23 [2020-10-24 23:27:52,443 INFO L226 Difference]: Without dead ends: 15 [2020-10-24 23:27:52,444 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 23:27:52,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-10-24 23:27:52,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-10-24 23:27:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-24 23:27:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2020-10-24 23:27:52,450 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2020-10-24 23:27:52,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 23:27:52,450 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-10-24 23:27:52,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-24 23:27:52,450 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-10-24 23:27:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-24 23:27:52,451 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 23:27:52,451 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 23:27:52,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 23:27:52,452 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 23:27:52,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 23:27:52,453 INFO L82 PathProgramCache]: Analyzing trace with hash -2048176233, now seen corresponding path program 1 times [2020-10-24 23:27:52,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 23:27:52,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375543347] [2020-10-24 23:27:52,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 23:27:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 23:27:52,476 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 23:27:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 23:27:52,531 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 23:27:52,575 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-24 23:27:52,575 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 23:27:52,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 23:27:52,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:27:52 BoogieIcfgContainer [2020-10-24 23:27:52,621 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 23:27:52,623 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 23:27:52,624 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 23:27:52,627 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 23:27:52,627 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:27:51" (3/4) ... [2020-10-24 23:27:52,631 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-24 23:27:52,631 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 23:27:52,634 INFO L168 Benchmark]: Toolchain (without parser) took 1884.98 ms. Allocated memory was 39.8 MB in the beginning and 58.7 MB in the end (delta: 18.9 MB). Free memory was 18.1 MB in the beginning and 39.0 MB in the end (delta: -20.9 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 23:27:52,635 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 39.8 MB. Free memory was 26.6 MB in the beginning and 26.6 MB in the end (delta: 32.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 23:27:52,636 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.24 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 17.5 MB in the beginning and 25.3 MB in the end (delta: -7.8 MB). Peak memory consumption was 5.2 MB. Max. memory is 16.1 GB. [2020-10-24 23:27:52,637 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.18 ms. Allocated memory is still 48.2 MB. Free memory was 25.3 MB in the beginning and 23.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 23:27:52,638 INFO L168 Benchmark]: Boogie Preprocessor took 60.98 ms. Allocated memory is still 48.2 MB. Free memory was 23.8 MB in the beginning and 22.7 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 23:27:52,639 INFO L168 Benchmark]: RCFGBuilder took 438.13 ms. Allocated memory is still 48.2 MB. Free memory was 22.7 MB in the beginning and 32.0 MB in the end (delta: -9.3 MB). Peak memory consumption was 3.5 MB. Max. memory is 16.1 GB. [2020-10-24 23:27:52,640 INFO L168 Benchmark]: TraceAbstraction took 928.96 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 31.5 MB in the beginning and 39.4 MB in the end (delta: -7.8 MB). Peak memory consumption was 13.7 MB. Max. memory is 16.1 GB. [2020-10-24 23:27:52,641 INFO L168 Benchmark]: Witness Printer took 8.78 ms. Allocated memory is still 58.7 MB. Free memory was 39.4 MB in the beginning and 39.0 MB in the end (delta: 322.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 23:27:52,646 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.33 ms. Allocated memory is still 39.8 MB. Free memory was 26.6 MB in the beginning and 26.6 MB in the end (delta: 32.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 359.24 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 17.5 MB in the beginning and 25.3 MB in the end (delta: -7.8 MB). Peak memory consumption was 5.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 69.18 ms. Allocated memory is still 48.2 MB. Free memory was 25.3 MB in the beginning and 23.8 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 60.98 ms. Allocated memory is still 48.2 MB. Free memory was 23.8 MB in the beginning and 22.7 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 438.13 ms. Allocated memory is still 48.2 MB. Free memory was 22.7 MB in the beginning and 32.0 MB in the end (delta: -9.3 MB). Peak memory consumption was 3.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 928.96 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 31.5 MB in the beginning and 39.4 MB in the end (delta: -7.8 MB). Peak memory consumption was 13.7 MB. Max. memory is 16.1 GB. * Witness Printer took 8.78 ms. Allocated memory is still 58.7 MB. Free memory was 39.4 MB in the beginning and 39.0 MB in the end (delta: 322.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 8]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 51, overapproximation of to_real at line 22, overapproximation of someBinaryArithmeticFLOAToperation at line 37. Possible FailurePath: [L15] float pi = 3.14159 ; VAL [pi=314159/100000] [L21] float x = __VERIFIER_nondet_float() ; [L22] float octant1 = 0 ; [L23] float octant2 = pi/8 ; [L11] COND FALSE !(!cond) VAL [pi=314159/100000] [L25] float oddExp = x ; [L26] float evenExp = 1.0 ; [L27] float term = x ; [L28] unsigned int count = 2 ; [L29] int multFactor = 0 ; [L30] int temp ; VAL [pi=314159/100000] [L32] COND TRUE 1 [L34] term = term * (x/count) VAL [pi=314159/100000] [L35] EXPR (count>>1 % 2 == 0) ? 1 : -1 VAL [pi=314159/100000] [L35] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L37] evenExp = evenExp + multFactor*term [L39] count++ [L41] term = term * (x/count) [L43] oddExp = oddExp + multFactor*term [L45] count++ [L47] temp = __VERIFIER_nondet_int() [L48] COND TRUE temp == 0 VAL [pi=314159/100000] [L13] COND TRUE !(cond) VAL [pi=314159/100000] [L8] __assert_fail("0", "loop3.c", 8, "reach_error") VAL [pi=314159/100000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 28 SDtfs, 1 SDslu, 8 SDs, 0 SdLazy, 6 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, 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, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 189 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-10-24 23:27:55,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 23:27:55,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 23:27:55,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 23:27:55,371 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 23:27:55,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 23:27:55,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 23:27:55,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 23:27:55,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 23:27:55,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 23:27:55,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 23:27:55,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 23:27:55,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 23:27:55,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 23:27:55,405 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 23:27:55,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 23:27:55,407 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 23:27:55,408 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 23:27:55,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 23:27:55,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 23:27:55,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 23:27:55,416 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 23:27:55,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 23:27:55,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 23:27:55,422 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 23:27:55,423 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 23:27:55,423 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 23:27:55,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 23:27:55,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 23:27:55,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 23:27:55,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 23:27:55,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 23:27:55,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 23:27:55,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 23:27:55,431 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 23:27:55,431 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 23:27:55,432 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 23:27:55,433 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 23:27:55,433 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 23:27:55,434 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 23:27:55,435 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 23:27:55,438 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-24 23:27:55,490 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 23:27:55,491 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 23:27:55,495 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 23:27:55,502 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 23:27:55,502 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 23:27:55,503 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 23:27:55,503 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 23:27:55,503 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 23:27:55,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 23:27:55,504 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 23:27:55,504 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 23:27:55,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 23:27:55,508 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-24 23:27:55,508 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-24 23:27:55,509 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 23:27:55,509 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 23:27:55,509 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 23:27:55,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 23:27:55,510 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 23:27:55,510 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 23:27:55,510 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 23:27:55,510 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 23:27:55,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 23:27:55,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 23:27:55,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 23:27:55,512 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 23:27:55,512 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-24 23:27:55,513 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-24 23:27:55,513 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 23:27:55,514 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 23:27:55,514 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-24 23:27:55,514 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> aa6dc04e2032f85ae9f089e49cae5f055c266957 [2020-10-24 23:27:55,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 23:27:56,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 23:27:56,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 23:27:56,024 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 23:27:56,025 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 23:27:56,026 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2020-10-24 23:27:56,109 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59e8a4a62/e836567df2984da6a4e3664d9bc944bf/FLAGa1d1be86e [2020-10-24 23:27:56,700 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 23:27:56,701 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2020-10-24 23:27:56,708 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59e8a4a62/e836567df2984da6a4e3664d9bc944bf/FLAGa1d1be86e [2020-10-24 23:27:57,081 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59e8a4a62/e836567df2984da6a4e3664d9bc944bf [2020-10-24 23:27:57,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 23:27:57,095 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 23:27:57,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 23:27:57,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 23:27:57,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 23:27:57,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:27:57" (1/1) ... [2020-10-24 23:27:57,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b18250c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:57, skipping insertion in model container [2020-10-24 23:27:57,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:27:57" (1/1) ... [2020-10-24 23:27:57,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 23:27:57,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 23:27:57,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 23:27:57,349 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 23:27:57,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 23:27:57,400 INFO L208 MainTranslator]: Completed translation [2020-10-24 23:27:57,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:57 WrapperNode [2020-10-24 23:27:57,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 23:27:57,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 23:27:57,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 23:27:57,406 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 23:27:57,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:57" (1/1) ... [2020-10-24 23:27:57,444 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:57" (1/1) ... [2020-10-24 23:27:57,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 23:27:57,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 23:27:57,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 23:27:57,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 23:27:57,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:57" (1/1) ... [2020-10-24 23:27:57,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:57" (1/1) ... [2020-10-24 23:27:57,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:57" (1/1) ... [2020-10-24 23:27:57,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:57" (1/1) ... [2020-10-24 23:27:57,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:57" (1/1) ... [2020-10-24 23:27:57,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:57" (1/1) ... [2020-10-24 23:27:57,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:57" (1/1) ... [2020-10-24 23:27:57,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 23:27:57,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 23:27:57,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 23:27:57,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 23:27:57,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 23:27:57,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-24 23:27:57,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 23:27:57,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 23:27:57,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 23:28:01,969 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 23:28:01,970 INFO L298 CfgBuilder]: Removed 11 assume(true) statements. [2020-10-24 23:28:01,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:28:01 BoogieIcfgContainer [2020-10-24 23:28:01,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 23:28:01,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 23:28:01,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 23:28:01,977 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 23:28:01,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:27:57" (1/3) ... [2020-10-24 23:28:01,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de05d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:28:01, skipping insertion in model container [2020-10-24 23:28:01,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:57" (2/3) ... [2020-10-24 23:28:01,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de05d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:28:01, skipping insertion in model container [2020-10-24 23:28:01,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:28:01" (3/3) ... [2020-10-24 23:28:01,981 INFO L111 eAbstractionObserver]: Analyzing ICFG loop3.c [2020-10-24 23:28:01,993 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 23:28:01,998 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 23:28:02,012 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 23:28:02,039 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 23:28:02,039 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 23:28:02,039 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 23:28:02,039 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 23:28:02,040 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 23:28:02,040 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 23:28:02,040 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 23:28:02,040 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 23:28:02,053 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-10-24 23:28:02,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-24 23:28:02,059 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 23:28:02,060 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 23:28:02,061 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 23:28:02,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 23:28:02,067 INFO L82 PathProgramCache]: Analyzing trace with hash 119997515, now seen corresponding path program 1 times [2020-10-24 23:28:02,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 23:28:02,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873689081] [2020-10-24 23:28:02,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-24 23:28:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 23:28:02,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-24 23:28:02,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 23:28:02,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 23:28:02,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 23:28:02,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 23:28:02,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873689081] [2020-10-24 23:28:02,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 23:28:02,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-24 23:28:02,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528733058] [2020-10-24 23:28:02,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-24 23:28:02,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 23:28:02,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-24 23:28:02,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 23:28:02,291 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2020-10-24 23:28:02,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 23:28:02,310 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2020-10-24 23:28:02,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-24 23:28:02,312 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2020-10-24 23:28:02,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 23:28:02,321 INFO L225 Difference]: With dead ends: 30 [2020-10-24 23:28:02,322 INFO L226 Difference]: Without dead ends: 12 [2020-10-24 23:28:02,325 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 23:28:02,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-10-24 23:28:02,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-10-24 23:28:02,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-24 23:28:02,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2020-10-24 23:28:02,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 8 [2020-10-24 23:28:02,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 23:28:02,367 INFO L481 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-10-24 23:28:02,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-24 23:28:02,367 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2020-10-24 23:28:02,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-24 23:28:02,368 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 23:28:02,368 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 23:28:02,582 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-24 23:28:02,583 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 23:28:02,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 23:28:02,585 INFO L82 PathProgramCache]: Analyzing trace with hash -2105434535, now seen corresponding path program 1 times [2020-10-24 23:28:02,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 23:28:02,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346954364] [2020-10-24 23:28:02,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-24 23:28:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 23:28:03,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-24 23:28:03,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 23:28:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 23:28:03,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 23:28:03,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 23:28:03,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346954364] [2020-10-24 23:28:03,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 23:28:03,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-10-24 23:28:03,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562860706] [2020-10-24 23:28:03,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 23:28:03,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 23:28:03,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 23:28:03,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-24 23:28:03,389 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 4 states. [2020-10-24 23:28:09,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 23:28:09,742 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2020-10-24 23:28:09,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 23:28:09,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-24 23:28:09,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 23:28:09,743 INFO L225 Difference]: With dead ends: 24 [2020-10-24 23:28:09,743 INFO L226 Difference]: Without dead ends: 16 [2020-10-24 23:28:09,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-24 23:28:09,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-10-24 23:28:09,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2020-10-24 23:28:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-24 23:28:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2020-10-24 23:28:09,749 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2020-10-24 23:28:09,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 23:28:09,749 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-10-24 23:28:09,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 23:28:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-10-24 23:28:09,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-24 23:28:09,750 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 23:28:09,750 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 23:28:09,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-24 23:28:09,952 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 23:28:09,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 23:28:09,954 INFO L82 PathProgramCache]: Analyzing trace with hash -2048176233, now seen corresponding path program 1 times [2020-10-24 23:28:09,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 23:28:09,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425694748] [2020-10-24 23:28:09,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-24 23:28:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 23:28:12,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 21 conjunts are in the unsatisfiable core [2020-10-24 23:28:12,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 23:28:13,102 WARN L193 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-10-24 23:28:13,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 23:28:13,406 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-10-24 23:28:13,723 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2020-10-24 23:28:31,063 WARN L193 SmtUtils]: Spent 12.07 s on a formula simplification that was a NOOP. DAG size: 30 [2020-10-24 23:28:50,298 WARN L193 SmtUtils]: Spent 15.56 s on a formula simplification that was a NOOP. DAG size: 34 [2020-10-24 23:28:52,742 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24)) (ULTIMATE.start_main_~multFactor~0 (_ BitVec 32))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ULTIMATE.start_main_~multFactor~0)) (.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) c_ULTIMATE.start_main_~oddExp~0) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))) (= (_ bv4294967295 32) ULTIMATE.start_main_~multFactor~0)))) is different from false [2020-10-24 23:28:55,141 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24)) (ULTIMATE.start_main_~multFactor~0 (_ BitVec 32))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ULTIMATE.start_main_~multFactor~0)) (.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) c_ULTIMATE.start_main_~oddExp~0) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))) (= (_ bv4294967295 32) ULTIMATE.start_main_~multFactor~0)))) is different from true [2020-10-24 23:28:57,558 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) c_ULTIMATE.start_main_~evenExp~0) (= (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) c_ULTIMATE.start_main_~oddExp~0) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2020-10-24 23:28:59,922 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) c_ULTIMATE.start_main_~evenExp~0) (= (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) c_ULTIMATE.start_main_~oddExp~0) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2020-10-24 23:28:59,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-24 23:29:12,395 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse2 .cse3)) (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) is different from false [2020-10-24 23:29:19,654 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from false [2020-10-24 23:29:22,024 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from true [2020-10-24 23:29:22,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 23:29:22,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 23:29:26,092 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2020-10-24 23:29:28,194 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2020-10-24 23:29:30,273 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2020-10-24 23:29:32,357 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2020-10-24 23:29:34,496 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2020-10-24 23:29:36,638 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2020-10-24 23:29:39,045 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))))) is different from false [2020-10-24 23:29:41,449 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))))) is different from true [2020-10-24 23:29:43,866 WARN L838 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) is different from false [2020-10-24 23:29:46,269 WARN L860 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) is different from true [2020-10-24 23:29:46,286 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-24 23:29:46,287 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 23:29:49,388 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_7 (_ FloatingPoint 8 24))) (or (not (fp.lt v_ULTIMATE.start_main_~x~0_7 (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))) (not (fp.gt v_ULTIMATE.start_main_~x~0_7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))))))) is different from true [2020-10-24 23:29:49,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 23:29:49,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425694748] [2020-10-24 23:29:49,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 23:29:49,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 9] imperfect sequences [] total 19 [2020-10-24 23:29:49,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781327889] [2020-10-24 23:29:49,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-24 23:29:49,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 23:29:49,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-24 23:29:49,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=68, Unknown=18, NotChecked=250, Total=380 [2020-10-24 23:29:49,394 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 20 states. [2020-10-24 23:29:51,789 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) c_~pi~0) (forall ((v_ULTIMATE.start_main_~x~0_7 (_ FloatingPoint 8 24))) (or (not (fp.lt v_ULTIMATE.start_main_~x~0_7 (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))) (not (fp.gt v_ULTIMATE.start_main_~x~0_7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))))) is different from false [2020-10-24 23:29:54,187 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) c_~pi~0) (forall ((v_ULTIMATE.start_main_~x~0_7 (_ FloatingPoint 8 24))) (or (not (fp.lt v_ULTIMATE.start_main_~x~0_7 (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))) (not (fp.gt v_ULTIMATE.start_main_~x~0_7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))))) is different from true [2020-10-24 23:29:56,601 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (.cse1 (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))))) (or (and (or (not .cse0) (not .cse1)) .cse2) (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse0 .cse1))) (or .cse2 (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse4 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse3 .cse4)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))))) is different from false [2020-10-24 23:29:59,009 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (.cse1 (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))))) (or (and (or (not .cse0) (not .cse1)) .cse2) (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse0 .cse1))) (or .cse2 (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse4 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse3 .cse4)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))))) is different from true [2020-10-24 23:30:01,404 WARN L838 $PredicateComparison]: unable to prove that (and (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) is different from false [2020-10-24 23:30:03,805 WARN L860 $PredicateComparison]: unable to prove that (and (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) is different from true [2020-10-24 23:30:06,202 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) (= c_ULTIMATE.start_main_~term~0 c_ULTIMATE.start_main_~x~0) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2020-10-24 23:30:08,349 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) (= c_ULTIMATE.start_main_~term~0 c_ULTIMATE.start_main_~x~0) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2020-10-24 23:30:10,750 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))))) is different from false [2020-10-24 23:30:12,840 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))))) is different from true [2020-10-24 23:30:15,239 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvadd |c_ULTIMATE.start_main_#t~ite8| (_ bv1 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2020-10-24 23:30:17,347 WARN L860 $PredicateComparison]: unable to prove that (and (= (bvadd |c_ULTIMATE.start_main_#t~ite8| (_ bv1 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2020-10-24 23:30:19,787 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~evenExp~0 c_ULTIMATE.start_main_~oddExp~0) (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24)) (ULTIMATE.start_main_~multFactor~0 (_ BitVec 32))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ULTIMATE.start_main_~multFactor~0)) (.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) c_ULTIMATE.start_main_~oddExp~0) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))) (= (_ bv4294967295 32) ULTIMATE.start_main_~multFactor~0))))) is different from false [2020-10-24 23:30:22,194 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) c_ULTIMATE.start_main_~evenExp~0) (= (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) c_ULTIMATE.start_main_~oddExp~0) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) (fp.geq c_ULTIMATE.start_main_~evenExp~0 c_ULTIMATE.start_main_~oddExp~0)) is different from false [2020-10-24 23:30:24,619 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (not .cse0) (or (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse3 .cse4)) (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) .cse0)))) is different from false [2020-10-24 23:30:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 23:30:38,910 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-10-24 23:30:38,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 23:30:38,912 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 11 [2020-10-24 23:30:38,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 23:30:38,913 INFO L225 Difference]: With dead ends: 20 [2020-10-24 23:30:38,913 INFO L226 Difference]: Without dead ends: 16 [2020-10-24 23:30:38,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 117.4s TimeCoverageRelationStatistics Valid=62, Invalid=71, Unknown=33, NotChecked=646, Total=812 [2020-10-24 23:30:38,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-10-24 23:30:38,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-10-24 23:30:38,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-24 23:30:38,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2020-10-24 23:30:38,919 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2020-10-24 23:30:38,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 23:30:38,920 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2020-10-24 23:30:38,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-24 23:30:38,920 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2020-10-24 23:30:38,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-24 23:30:38,921 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 23:30:38,921 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 23:30:39,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-24 23:30:39,135 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 23:30:39,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 23:30:39,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1599389039, now seen corresponding path program 1 times [2020-10-24 23:30:39,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 23:30:39,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65444620] [2020-10-24 23:30:39,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-24 23:30:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 23:30:40,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-24 23:30:40,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 23:30:40,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 23:30:40,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 23:30:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 23:30:40,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65444620] [2020-10-24 23:30:40,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-24 23:30:40,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-10-24 23:30:40,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594762742] [2020-10-24 23:30:40,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 23:30:40,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 23:30:40,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 23:30:40,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-24 23:30:40,455 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 6 states. [2020-10-24 23:30:52,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 23:30:52,391 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-10-24 23:30:52,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 23:30:52,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-24 23:30:52,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 23:30:52,392 INFO L225 Difference]: With dead ends: 35 [2020-10-24 23:30:52,392 INFO L226 Difference]: Without dead ends: 27 [2020-10-24 23:30:52,393 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-24 23:30:52,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-10-24 23:30:52,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2020-10-24 23:30:52,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-24 23:30:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-10-24 23:30:52,401 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2020-10-24 23:30:52,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 23:30:52,402 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-10-24 23:30:52,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 23:30:52,403 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-10-24 23:30:52,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-24 23:30:52,406 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 23:30:52,406 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 23:30:52,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-24 23:30:52,608 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 23:30:52,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 23:30:52,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1656647341, now seen corresponding path program 1 times [2020-10-24 23:30:52,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 23:30:52,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174319913] [2020-10-24 23:30:52,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-24 23:31:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 23:31:09,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 28 conjunts are in the unsatisfiable core [2020-10-24 23:31:09,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 23:31:09,848 WARN L193 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-10-24 23:31:09,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 23:31:10,109 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-10-24 23:31:10,460 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2020-10-24 23:31:32,792 WARN L193 SmtUtils]: Spent 16.46 s on a formula simplification that was a NOOP. DAG size: 30 [2020-10-24 23:31:53,410 WARN L193 SmtUtils]: Spent 14.87 s on a formula simplification that was a NOOP. DAG size: 34 [2020-10-24 23:31:55,843 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((ULTIMATE.start_main_~multFactor~0 (_ BitVec 32))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ULTIMATE.start_main_~multFactor~0))) (and (= c_ULTIMATE.start_main_~oddExp~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0))) (= (_ bv4294967295 32) ULTIMATE.start_main_~multFactor~0) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) c_ULTIMATE.start_main_~evenExp~0)))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))) (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))) c_ULTIMATE.start_main_~term~0)) is different from false [2020-10-24 23:31:58,825 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (and (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) c_ULTIMATE.start_main_~oddExp~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) c_ULTIMATE.start_main_~evenExp~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))) c_ULTIMATE.start_main_~term~0))) is different from false [2020-10-24 23:32:01,389 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (and (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) c_ULTIMATE.start_main_~oddExp~0) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse2)) c_ULTIMATE.start_main_~evenExp~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))))) is different from false [2020-10-24 23:32:03,948 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (and (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd |c_ULTIMATE.start_main_#t~ite8| (_ bv1 32)) (_ bv0 32)) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) c_ULTIMATE.start_main_~oddExp~0) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse2)) c_ULTIMATE.start_main_~evenExp~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))))) is different from false [2020-10-24 23:32:06,954 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse3 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) c_ULTIMATE.start_main_~oddExp~0) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2)))))))) is different from false [2020-10-24 23:32:09,381 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse3 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) c_ULTIMATE.start_main_~oddExp~0) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2)))))))) is different from true [2020-10-24 23:32:09,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-24 23:32:22,137 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse5 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse6 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse4 .cse5)) (fp.mul roundNearestTiesToEven .cse4 .cse6)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse4 .cse7)) (fp.mul roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))))))) is different from false [2020-10-24 23:32:29,526 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from false [2020-10-24 23:32:31,946 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from true [2020-10-24 23:32:31,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2020-10-24 23:32:31,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 23:32:36,387 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2020-10-24 23:32:38,494 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2020-10-24 23:32:40,578 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2020-10-24 23:32:42,666 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2020-10-24 23:32:44,820 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2020-10-24 23:32:46,973 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2020-10-24 23:32:49,217 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from false [2020-10-24 23:32:51,467 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from true [2020-10-24 23:32:53,693 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from false [2020-10-24 23:32:55,915 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from true [2020-10-24 23:32:58,197 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) is different from false [2020-10-24 23:33:00,487 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) is different from true [2020-10-24 23:33:02,982 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) is different from false [2020-10-24 23:33:05,455 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) is different from true [2020-10-24 23:33:07,932 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from false [2020-10-24 23:33:10,407 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from true [2020-10-24 23:33:10,416 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-24 23:33:10,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 23:33:13,781 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_8 (_ FloatingPoint 8 24))) (or (let ((.cse1 (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) (not (fp.gt v_ULTIMATE.start_main_~x~0_8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (not (fp.lt v_ULTIMATE.start_main_~x~0_8 (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))))) is different from true [2020-10-24 23:33:13,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2020-10-24 23:33:13,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174319913] [2020-10-24 23:33:13,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-24 23:33:13,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 25 [2020-10-24 23:33:13,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959692908] [2020-10-24 23:33:13,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-10-24 23:33:13,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 23:33:13,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-24 23:33:13,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=72, Unknown=26, NotChecked=496, Total=650 [2020-10-24 23:33:13,786 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 26 states. [2020-10-24 23:33:16,231 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) c_~pi~0) (forall ((v_ULTIMATE.start_main_~x~0_8 (_ FloatingPoint 8 24))) (or (let ((.cse1 (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) (not (fp.gt v_ULTIMATE.start_main_~x~0_8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (not (fp.lt v_ULTIMATE.start_main_~x~0_8 (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))))))) is different from false [2020-10-24 23:33:18,706 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) c_~pi~0) (forall ((v_ULTIMATE.start_main_~x~0_8 (_ FloatingPoint 8 24))) (or (let ((.cse1 (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) (not (fp.gt v_ULTIMATE.start_main_~x~0_8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (not (fp.lt v_ULTIMATE.start_main_~x~0_8 (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))))))) is different from true [2020-10-24 23:33:21,172 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (or (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) .cse4) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (.cse6 (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))))) (or (and (or (not .cse5) (not .cse6)) .cse4) (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5 .cse6))))) is different from false [2020-10-24 23:33:23,634 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (or (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) .cse4) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (.cse6 (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))))) (or (and (or (not .cse5) (not .cse6)) .cse4) (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5 .cse6))))) is different from true [2020-10-24 23:33:26,095 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))) is different from false [2020-10-24 23:33:28,566 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))) is different from true [2020-10-24 23:33:31,040 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) (= c_ULTIMATE.start_main_~term~0 c_ULTIMATE.start_main_~x~0) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2020-10-24 23:33:33,325 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) (= c_ULTIMATE.start_main_~term~0 c_ULTIMATE.start_main_~x~0) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2020-10-24 23:33:35,783 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (let ((.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2020-10-24 23:33:38,023 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (let ((.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2020-10-24 23:33:40,485 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse3 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) (= (bvadd |c_ULTIMATE.start_main_#t~ite8| (_ bv1 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2020-10-24 23:33:42,747 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse3 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) (= (bvadd |c_ULTIMATE.start_main_#t~ite8| (_ bv1 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2020-10-24 23:33:45,230 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((ULTIMATE.start_main_~multFactor~0 (_ BitVec 32))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ULTIMATE.start_main_~multFactor~0))) (and (= c_ULTIMATE.start_main_~oddExp~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0))) (= (_ bv4294967295 32) ULTIMATE.start_main_~multFactor~0) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) c_ULTIMATE.start_main_~evenExp~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))) (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))) c_ULTIMATE.start_main_~term~0)) is different from false [2020-10-24 23:33:47,388 WARN L860 $PredicateComparison]: unable to prove that (and (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((ULTIMATE.start_main_~multFactor~0 (_ BitVec 32))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ULTIMATE.start_main_~multFactor~0))) (and (= c_ULTIMATE.start_main_~oddExp~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0))) (= (_ bv4294967295 32) ULTIMATE.start_main_~multFactor~0) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) c_ULTIMATE.start_main_~evenExp~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))) (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))) c_ULTIMATE.start_main_~term~0)) is different from true [2020-10-24 23:33:49,851 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (and (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) c_ULTIMATE.start_main_~oddExp~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse2)) c_ULTIMATE.start_main_~evenExp~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))) c_ULTIMATE.start_main_~term~0))) is different from false [2020-10-24 23:33:52,009 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (and (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) c_ULTIMATE.start_main_~oddExp~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse2)) c_ULTIMATE.start_main_~evenExp~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))) c_ULTIMATE.start_main_~term~0))) is different from true [2020-10-24 23:33:54,466 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (and (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) c_ULTIMATE.start_main_~oddExp~0) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse2)) c_ULTIMATE.start_main_~evenExp~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))))) is different from false [2020-10-24 23:33:56,562 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (and (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) c_ULTIMATE.start_main_~oddExp~0) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse2)) c_ULTIMATE.start_main_~evenExp~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))))) is different from true [2020-10-24 23:33:59,019 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (and (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd |c_ULTIMATE.start_main_#t~ite8| (_ bv1 32)) (_ bv0 32)) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) c_ULTIMATE.start_main_~oddExp~0) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse3)) c_ULTIMATE.start_main_~evenExp~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))))) is different from false [2020-10-24 23:34:01,162 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (and (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd |c_ULTIMATE.start_main_#t~ite8| (_ bv1 32)) (_ bv0 32)) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) c_ULTIMATE.start_main_~oddExp~0) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse3)) c_ULTIMATE.start_main_~evenExp~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))))) is different from true [2020-10-24 23:34:03,628 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~evenExp~0 c_ULTIMATE.start_main_~oddExp~0) (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse3 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) c_ULTIMATE.start_main_~oddExp~0) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2))))))))) is different from false [2020-10-24 23:34:06,118 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (not .cse0) (or (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse2 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse4)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) .cse0) (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse6 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse8 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse7 (fp.mul roundNearestTiesToEven .cse8 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse5 .cse6)) (fp.mul roundNearestTiesToEven .cse5 .cse7)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse5 .cse8)) (fp.mul roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))))))))) is different from false [2020-10-24 23:34:24,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 23:34:24,840 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-10-24 23:34:24,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-24 23:34:24,846 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 15 [2020-10-24 23:34:24,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 23:34:24,847 INFO L225 Difference]: With dead ends: 28 [2020-10-24 23:34:24,847 INFO L226 Difference]: Without dead ends: 24 [2020-10-24 23:34:24,848 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 28 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 161.9s TimeCoverageRelationStatistics Valid=80, Invalid=74, Unknown=48, NotChecked=1204, Total=1406 [2020-10-24 23:34:24,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-10-24 23:34:24,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-24 23:34:24,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-24 23:34:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-10-24 23:34:24,856 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 15 [2020-10-24 23:34:24,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 23:34:24,856 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-10-24 23:34:24,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-10-24 23:34:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-10-24 23:34:24,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-24 23:34:24,858 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 23:34:24,858 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 23:34:25,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-24 23:34:25,059 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 23:34:25,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 23:34:25,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1411388099, now seen corresponding path program 2 times [2020-10-24 23:34:25,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 23:34:25,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211542768] [2020-10-24 23:34:25,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-24 23:36:18,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-24 23:36:18,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-24 23:36:18,170 WARN L261 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 35 conjunts are in the unsatisfiable core [2020-10-24 23:36:18,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 23:36:18,754 WARN L193 SmtUtils]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-10-24 23:36:18,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 23:36:19,080 WARN L193 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-10-24 23:36:19,432 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2020-10-24 23:36:37,360 WARN L193 SmtUtils]: Spent 13.32 s on a formula simplification that was a NOOP. DAG size: 30 [2020-10-24 23:36:59,660 WARN L193 SmtUtils]: Spent 17.78 s on a formula simplification that was a NOOP. DAG size: 34 [2020-10-24 23:37:02,083 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((ULTIMATE.start_main_~multFactor~0 (_ BitVec 32))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ULTIMATE.start_main_~multFactor~0))) (and (= c_ULTIMATE.start_main_~oddExp~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0))) (= (_ bv4294967295 32) ULTIMATE.start_main_~multFactor~0) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) c_ULTIMATE.start_main_~evenExp~0)))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))) (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))) c_ULTIMATE.start_main_~term~0)) is different from false [2020-10-24 23:37:04,545 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (and (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) c_ULTIMATE.start_main_~oddExp~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) c_ULTIMATE.start_main_~evenExp~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))) c_ULTIMATE.start_main_~term~0))) is different from false [2020-10-24 23:37:07,116 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (and (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) c_ULTIMATE.start_main_~oddExp~0) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse2)) c_ULTIMATE.start_main_~evenExp~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))))) is different from false [2020-10-24 23:37:09,457 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (and (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) c_ULTIMATE.start_main_~oddExp~0) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse2)) c_ULTIMATE.start_main_~evenExp~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))))) is different from true [2020-10-24 23:37:11,870 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (and (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd |c_ULTIMATE.start_main_#t~ite8| (_ bv1 32)) (_ bv0 32)) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) c_ULTIMATE.start_main_~oddExp~0) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse2)) c_ULTIMATE.start_main_~evenExp~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))))) is different from false [2020-10-24 23:37:14,520 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))) (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967293 32))))) (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))) (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((ULTIMATE.start_main_~multFactor~0 (_ BitVec 32))) (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967293 32)))))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode ULTIMATE.start_main_~multFactor~0))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32)))))))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~term~0)) c_ULTIMATE.start_main_~oddExp~0) (= (_ bv4294967295 32) ULTIMATE.start_main_~multFactor~0))))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))) is different from false [2020-10-24 23:37:17,788 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967293 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (and (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) c_ULTIMATE.start_main_~oddExp~0) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2))))))) is different from false [2020-10-24 23:37:20,685 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967293 32))))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse0 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.mul c_currentRoundingMode .cse1 .cse3))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse1 .cse4)) (fp.mul c_currentRoundingMode .cse1 .cse0)) c_ULTIMATE.start_main_~oddExp~0)))))) is different from false [2020-10-24 23:37:23,817 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967293 32))))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse0 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= (bvadd |c_ULTIMATE.start_main_#t~ite8| (_ bv1 32)) (_ bv0 32)) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0)))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.mul c_currentRoundingMode .cse1 .cse3))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse1 .cse4)) (fp.mul c_currentRoundingMode .cse1 .cse0)) c_ULTIMATE.start_main_~oddExp~0)))))) is different from false [2020-10-24 23:37:27,523 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse4 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) c_ULTIMATE.start_main_~oddExp~0) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse3)))))))))) is different from false [2020-10-24 23:37:30,163 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse4 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) c_ULTIMATE.start_main_~oddExp~0) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse3)))))))))) is different from true [2020-10-24 23:37:30,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-24 23:37:44,282 WARN L838 $PredicateComparison]: unable to prove that (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (let ((.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (let ((.cse7 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse10 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse8 (fp.mul roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse11 (fp.mul roundNearestTiesToEven .cse8 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse9 (fp.mul roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse6 .cse7)) (fp.mul roundNearestTiesToEven .cse6 .cse8)) (fp.mul roundNearestTiesToEven .cse6 .cse9)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse6 .cse10)) (fp.mul roundNearestTiesToEven .cse6 .cse11)) (fp.mul roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse9 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))))))) is different from false [2020-10-24 23:37:52,702 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (let ((.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))))) is different from false [2020-10-24 23:37:55,323 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (let ((.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))))) is different from true [2020-10-24 23:37:55,331 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2020-10-24 23:37:55,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 23:37:59,039 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~count~0_29 (_ BitVec 32))) (or (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_29 (_ bv4294967295 32))))))))) (not (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32)) v_ULTIMATE.start_main_~count~0_29)))) is different from true [2020-10-24 23:38:01,125 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2020-10-24 23:38:03,206 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2020-10-24 23:38:05,358 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2020-10-24 23:38:07,502 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2020-10-24 23:38:09,750 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~count~0_30 (_ BitVec 32))) (or (let ((.cse3 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_30 (_ bv4294967295 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode v_ULTIMATE.start_main_~count~0_30))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_30 (_ bv1 32)))))))))) (not (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32)) v_ULTIMATE.start_main_~count~0_30)))) is different from true [2020-10-24 23:38:11,968 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from false [2020-10-24 23:38:14,191 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from true [2020-10-24 23:38:16,475 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) is different from false [2020-10-24 23:38:18,761 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) is different from true [2020-10-24 23:38:21,166 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse3 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.mul c_currentRoundingMode .cse1 .cse3)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse4)) (fp.mul c_currentRoundingMode .cse1 .cse5)) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32)))))))))))) is different from false [2020-10-24 23:38:23,554 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite8|)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse3 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.mul c_currentRoundingMode .cse1 .cse3)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse4)) (fp.mul c_currentRoundingMode .cse1 .cse5)) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32)))))))))))) is different from true [2020-10-24 23:38:25,924 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse4)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32)))))))))))) is different from false [2020-10-24 23:38:28,289 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse4)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32)))))))))))) is different from true [2020-10-24 23:38:30,740 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse3 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse4)) (fp.mul c_currentRoundingMode .cse0 .cse5)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32))))))))))))) is different from false [2020-10-24 23:38:33,171 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse3 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse4)) (fp.mul c_currentRoundingMode .cse0 .cse5)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32))))))))))))) is different from true [2020-10-24 23:38:35,878 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse3 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv6 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse4)) (fp.mul c_currentRoundingMode .cse0 .cse5)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv7 32)))))))))))) is different from false [2020-10-24 23:38:38,578 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse3 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv6 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse4)) (fp.mul c_currentRoundingMode .cse0 .cse5)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv7 32)))))))))))) is different from true [2020-10-24 23:38:41,281 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse3 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv6 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse4)) (fp.mul c_currentRoundingMode .cse0 .cse5)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv7 32)))))))))))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from false [2020-10-24 23:38:43,977 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse3 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv6 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse4)) (fp.mul c_currentRoundingMode .cse0 .cse5)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv7 32)))))))))))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from true [2020-10-24 23:38:43,988 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-10-24 23:38:43,989 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 23:38:48,141 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_9 (_ FloatingPoint 8 24))) (or (let ((.cse1 (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse3 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv6 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 (fp.mul c_currentRoundingMode .cse0 .cse4)) (fp.mul c_currentRoundingMode .cse0 .cse5)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv7 32)))))))))))) (not (fp.gt v_ULTIMATE.start_main_~x~0_9 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (not (fp.lt v_ULTIMATE.start_main_~x~0_9 (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))))) is different from true [2020-10-24 23:38:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2020-10-24 23:38:48,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211542768] [2020-10-24 23:38:48,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-24 23:38:48,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 32 [2020-10-24 23:38:48,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436867617] [2020-10-24 23:38:48,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-10-24 23:38:48,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 23:38:48,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-10-24 23:38:48,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=77, Unknown=35, NotChecked=874, Total=1056 [2020-10-24 23:38:48,147 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 33 states. [2020-10-24 23:38:50,802 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~x~0_9 (_ FloatingPoint 8 24))) (or (let ((.cse1 (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse3 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv6 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 (fp.mul c_currentRoundingMode .cse0 .cse4)) (fp.mul c_currentRoundingMode .cse0 .cse5)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv7 32)))))))))))) (not (fp.gt v_ULTIMATE.start_main_~x~0_9 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (not (fp.lt v_ULTIMATE.start_main_~x~0_9 (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))))) (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) c_~pi~0)) is different from false [2020-10-24 23:38:53,506 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~x~0_9 (_ FloatingPoint 8 24))) (or (let ((.cse1 (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse3 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv6 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 (fp.mul c_currentRoundingMode .cse0 .cse4)) (fp.mul c_currentRoundingMode .cse0 .cse5)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv7 32)))))))))))) (not (fp.gt v_ULTIMATE.start_main_~x~0_9 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (not (fp.lt v_ULTIMATE.start_main_~x~0_9 (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))))) (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) c_~pi~0)) is different from true [2020-10-24 23:38:56,208 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (or (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse3 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv6 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse4)) (fp.mul c_currentRoundingMode .cse0 .cse5)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv7 32)))))))))))) .cse6) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse7 (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (.cse8 (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))))) (or (and (or (not .cse7) (not .cse8)) .cse6) (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse7 .cse8))))) is different from false [2020-10-24 23:38:58,911 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse6 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (or (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse3 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv6 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse4)) (fp.mul c_currentRoundingMode .cse0 .cse5)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv7 32)))))))))))) .cse6) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse7 (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (.cse8 (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))))) (or (and (or (not .cse7) (not .cse8)) .cse6) (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse7 .cse8))))) is different from true [2020-10-24 23:39:01,598 WARN L838 $PredicateComparison]: unable to prove that (and (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse3 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv6 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse4)) (fp.mul c_currentRoundingMode .cse0 .cse5)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv7 32)))))))))))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))) is different from false [2020-10-24 23:39:04,296 WARN L860 $PredicateComparison]: unable to prove that (and (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse3 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv6 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~x~0 (fp.mul c_currentRoundingMode .cse0 .cse4)) (fp.mul c_currentRoundingMode .cse0 .cse5)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv7 32)))))))))))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))) is different from true [2020-10-24 23:39:06,998 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~term~0 c_ULTIMATE.start_main_~x~0) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse3 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~evenExp~0 (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~oddExp~0 (fp.mul c_currentRoundingMode .cse0 .cse4)) (fp.mul c_currentRoundingMode .cse0 .cse5)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32)))))))))))))) is different from false [2020-10-24 23:39:08,418 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-10-24 23:39:08,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 23:39:08,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-24 23:39:08,621 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:226) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:851) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1064) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:966) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:187) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:743) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:674) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) ... 45 more [2020-10-24 23:39:08,629 INFO L168 Benchmark]: Toolchain (without parser) took 671540.62 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 19.9 MB in the beginning and 18.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 16.1 GB. [2020-10-24 23:39:08,630 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 41.9 MB. Free memory was 27.3 MB in the beginning and 27.2 MB in the end (delta: 111.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 23:39:08,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.16 ms. Allocated memory is still 41.9 MB. Free memory was 19.2 MB in the beginning and 19.8 MB in the end (delta: -622.4 kB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-10-24 23:39:08,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.06 ms. Allocated memory is still 41.9 MB. Free memory was 19.8 MB in the beginning and 18.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 23:39:08,633 INFO L168 Benchmark]: Boogie Preprocessor took 84.25 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 18.2 MB in the beginning and 37.2 MB in the end (delta: -19.0 MB). Peak memory consumption was 2.8 MB. Max. memory is 16.1 GB. [2020-10-24 23:39:08,637 INFO L168 Benchmark]: RCFGBuilder took 4402.44 ms. Allocated memory is still 52.4 MB. Free memory was 37.2 MB in the beginning and 35.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 13.5 MB. Max. memory is 16.1 GB. [2020-10-24 23:39:08,638 INFO L168 Benchmark]: TraceAbstraction took 666654.42 ms. Allocated memory is still 52.4 MB. Free memory was 35.3 MB in the beginning and 18.4 MB in the end (delta: 16.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 16.1 GB. [2020-10-24 23:39:08,642 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.27 ms. Allocated memory is still 41.9 MB. Free memory was 27.3 MB in the beginning and 27.2 MB in the end (delta: 111.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 301.16 ms. Allocated memory is still 41.9 MB. Free memory was 19.2 MB in the beginning and 19.8 MB in the end (delta: -622.4 kB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 77.06 ms. Allocated memory is still 41.9 MB. Free memory was 19.8 MB in the beginning and 18.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 84.25 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 18.2 MB in the beginning and 37.2 MB in the end (delta: -19.0 MB). Peak memory consumption was 2.8 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4402.44 ms. Allocated memory is still 52.4 MB. Free memory was 37.2 MB in the beginning and 35.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 13.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 666654.42 ms. Allocated memory is still 52.4 MB. Free memory was 35.3 MB in the beginning and 18.4 MB in the end (delta: 16.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...