./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c -s /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16de9293a0e84e3b3a329f13e1e1507a400214f0 ..................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c -s /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16de9293a0e84e3b3a329f13e1e1507a400214f0 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.24-678e011 [2019-11-20 11:17:42,994 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:17:42,996 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:17:43,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:17:43,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:17:43,007 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:17:43,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:17:43,010 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:17:43,012 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:17:43,013 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:17:43,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:17:43,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:17:43,015 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:17:43,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:17:43,017 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:17:43,018 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:17:43,019 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:17:43,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:17:43,021 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:17:43,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:17:43,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:17:43,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:17:43,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:17:43,032 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:17:43,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:17:43,035 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:17:43,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:17:43,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:17:43,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:17:43,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:17:43,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:17:43,045 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:17:43,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:17:43,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:17:43,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:17:43,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:17:43,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:17:43,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:17:43,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:17:43,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:17:43,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:17:43,056 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 11:17:43,072 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:17:43,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:17:43,074 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:17:43,074 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:17:43,074 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:17:43,074 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:17:43,075 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 11:17:43,075 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 11:17:43,075 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 11:17:43,075 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:17:43,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 11:17:43,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 11:17:43,076 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 11:17:43,077 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 11:17:43,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 11:17:43,077 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:17:43,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 11:17:43,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:17:43,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:17:43,078 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 11:17:43,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 11:17:43,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:17:43,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:17:43,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 11:17:43,079 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 11:17:43,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 11:17:43,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 11:17:43,079 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 11:17:43,079 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer 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(__VERIFIER_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 -> 16de9293a0e84e3b3a329f13e1e1507a400214f0 [2019-11-20 11:17:43,242 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:17:43,252 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:17:43,263 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:17:43,264 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:17:43,265 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:17:43,265 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2019-11-20 11:17:43,324 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/data/9da9d4a92/99ed8a6d057f4c4aabb68862154bfa96/FLAG2e4959848 [2019-11-20 11:17:43,684 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:17:43,685 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2019-11-20 11:17:43,689 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/data/9da9d4a92/99ed8a6d057f4c4aabb68862154bfa96/FLAG2e4959848 [2019-11-20 11:17:43,702 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/data/9da9d4a92/99ed8a6d057f4c4aabb68862154bfa96 [2019-11-20 11:17:43,705 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:17:43,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 11:17:43,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:17:43,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:17:43,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:17:43,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:17:43" (1/1) ... [2019-11-20 11:17:43,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18fc67ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:43, skipping insertion in model container [2019-11-20 11:17:43,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:17:43" (1/1) ... [2019-11-20 11:17:43,721 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:17:43,736 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:17:43,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:17:43,993 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 11:17:44,008 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:17:44,021 INFO L192 MainTranslator]: Completed translation [2019-11-20 11:17:44,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:44 WrapperNode [2019-11-20 11:17:44,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 11:17:44,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 11:17:44,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 11:17:44,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 11:17:44,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:44" (1/1) ... [2019-11-20 11:17:44,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:44" (1/1) ... [2019-11-20 11:17:44,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 11:17:44,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 11:17:44,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 11:17:44,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 11:17:44,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:44" (1/1) ... [2019-11-20 11:17:44,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:44" (1/1) ... [2019-11-20 11:17:44,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:44" (1/1) ... [2019-11-20 11:17:44,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:44" (1/1) ... [2019-11-20 11:17:44,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:44" (1/1) ... [2019-11-20 11:17:44,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:44" (1/1) ... [2019-11-20 11:17:44,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:44" (1/1) ... [2019-11-20 11:17:44,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 11:17:44,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 11:17:44,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 11:17:44,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 11:17:44,076 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/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 [2019-11-20 11:17:44,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 11:17:44,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 11:17:44,322 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 11:17:44,323 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 11:17:44,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:17:44 BoogieIcfgContainer [2019-11-20 11:17:44,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 11:17:44,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 11:17:44,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 11:17:44,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 11:17:44,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:17:43" (1/3) ... [2019-11-20 11:17:44,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ead7f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:17:44, skipping insertion in model container [2019-11-20 11:17:44,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:44" (2/3) ... [2019-11-20 11:17:44,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ead7f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:17:44, skipping insertion in model container [2019-11-20 11:17:44,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:17:44" (3/3) ... [2019-11-20 11:17:44,335 INFO L109 eAbstractionObserver]: Analyzing ICFG loop3.c [2019-11-20 11:17:44,346 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 11:17:44,352 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 11:17:44,362 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 11:17:44,382 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 11:17:44,382 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 11:17:44,382 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 11:17:44,383 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 11:17:44,383 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 11:17:44,383 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 11:17:44,383 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 11:17:44,383 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 11:17:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-11-20 11:17:44,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-20 11:17:44,400 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:17:44,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-20 11:17:44,401 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:17:44,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:17:44,406 INFO L82 PathProgramCache]: Analyzing trace with hash 890122407, now seen corresponding path program 1 times [2019-11-20 11:17:44,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:17:44,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541177406] [2019-11-20 11:17:44,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:17:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:17:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:17:44,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541177406] [2019-11-20 11:17:44,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:17:44,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:17:44,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077600346] [2019-11-20 11:17:44,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 11:17:44,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:17:44,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 11:17:44,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 11:17:44,519 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-11-20 11:17:44,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:17:44,532 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2019-11-20 11:17:44,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 11:17:44,533 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-20 11:17:44,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:17:44,539 INFO L225 Difference]: With dead ends: 22 [2019-11-20 11:17:44,539 INFO L226 Difference]: Without dead ends: 10 [2019-11-20 11:17:44,542 INFO L630 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 [2019-11-20 11:17:44,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-11-20 11:17:44,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-20 11:17:44,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-20 11:17:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-11-20 11:17:44,565 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2019-11-20 11:17:44,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:17:44,566 INFO L462 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-20 11:17:44,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 11:17:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-11-20 11:17:44,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 11:17:44,566 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:17:44,566 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:17:44,567 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:17:44,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:17:44,567 INFO L82 PathProgramCache]: Analyzing trace with hash 642088082, now seen corresponding path program 1 times [2019-11-20 11:17:44,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:17:44,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061891364] [2019-11-20 11:17:44,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:17:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:17:44,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:17:44,617 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:17:44,617 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 11:17:44,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:17:44 BoogieIcfgContainer [2019-11-20 11:17:44,638 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 11:17:44,638 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 11:17:44,638 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 11:17:44,638 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 11:17:44,639 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:17:44" (3/4) ... [2019-11-20 11:17:44,642 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 11:17:44,642 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 11:17:44,644 INFO L168 Benchmark]: Toolchain (without parser) took 937.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 951.5 MB in the beginning and 1.1 GB in the end (delta: -121.5 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-11-20 11:17:44,644 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:17:44,645 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 951.5 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-20 11:17:44,645 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:17:44,646 INFO L168 Benchmark]: Boogie Preprocessor took 19.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 11:17:44,646 INFO L168 Benchmark]: RCFGBuilder took 249.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-11-20 11:17:44,647 INFO L168 Benchmark]: TraceAbstraction took 312.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-20 11:17:44,647 INFO L168 Benchmark]: Witness Printer took 3.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 11:17:44,650 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 315.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 951.5 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 249.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 312.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 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 46, overapproximation of to_real at line 17, overapproximation of someBinaryArithmeticFLOAToperation at line 32. Possible FailurePath: [L10] float pi = 3.14159 ; VAL [pi=314159/100000] [L16] float x = __VERIFIER_nondet_float() ; [L17] float octant1 = 0 ; [L18] float octant2 = pi/8 ; [L20] float oddExp = x ; [L21] float evenExp = 1.0 ; [L22] float term = x ; [L23] unsigned int count = 2 ; [L24] int multFactor = 0 ; [L25] int temp ; VAL [pi=314159/100000] [L27] COND TRUE 1 [L29] term = term * (x/count) VAL [pi=314159/100000] [L30] EXPR (count>>1 % 2 == 0) ? 1 : -1 VAL [pi=314159/100000] [L30] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L32] evenExp = evenExp + multFactor*term [L34] count++ [L36] term = term * (x/count) [L38] oddExp = oddExp + multFactor*term [L40] count++ [L42] temp = __VERIFIER_nondet_int() [L43] COND TRUE temp == 0 VAL [pi=314159/100000] [L8] COND TRUE !(cond) VAL [pi=314159/100000] [L8] __VERIFIER_error() VAL [pi=314159/100000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.2s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 15 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 25 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, 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.1.24-678e011 [2019-11-20 11:17:46,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:17:46,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:17:46,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:17:46,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:17:46,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:17:46,490 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:17:46,492 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:17:46,494 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:17:46,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:17:46,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:17:46,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:17:46,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:17:46,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:17:46,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:17:46,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:17:46,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:17:46,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:17:46,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:17:46,506 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:17:46,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:17:46,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:17:46,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:17:46,519 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:17:46,523 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:17:46,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:17:46,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:17:46,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:17:46,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:17:46,528 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:17:46,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:17:46,529 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:17:46,530 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:17:46,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:17:46,531 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:17:46,532 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:17:46,532 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:17:46,532 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:17:46,533 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:17:46,533 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:17:46,534 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:17:46,535 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 11:17:46,548 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:17:46,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:17:46,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:17:46,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:17:46,550 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:17:46,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:17:46,551 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 11:17:46,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 11:17:46,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:17:46,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 11:17:46,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 11:17:46,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 11:17:46,552 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 11:17:46,553 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 11:17:46,553 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 11:17:46,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 11:17:46,553 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:17:46,554 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 11:17:46,554 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:17:46,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:17:46,554 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 11:17:46,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 11:17:46,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:17:46,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:17:46,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 11:17:46,556 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 11:17:46,556 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 11:17:46,556 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 11:17:46,556 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 11:17:46,557 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 11:17:46,557 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer 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(__VERIFIER_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 -> 16de9293a0e84e3b3a329f13e1e1507a400214f0 [2019-11-20 11:17:46,891 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:17:46,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:17:46,909 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:17:46,913 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:17:46,913 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:17:46,914 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2019-11-20 11:17:46,972 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/data/380d20bf4/e2c9db6e42324792a6d9057752a3537e/FLAG47f0225e0 [2019-11-20 11:17:47,377 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:17:47,378 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2019-11-20 11:17:47,384 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/data/380d20bf4/e2c9db6e42324792a6d9057752a3537e/FLAG47f0225e0 [2019-11-20 11:17:47,794 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/data/380d20bf4/e2c9db6e42324792a6d9057752a3537e [2019-11-20 11:17:47,797 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:17:47,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 11:17:47,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:17:47,799 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:17:47,803 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:17:47,804 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:17:47" (1/1) ... [2019-11-20 11:17:47,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ca2890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:47, skipping insertion in model container [2019-11-20 11:17:47,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:17:47" (1/1) ... [2019-11-20 11:17:47,823 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:17:47,843 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:17:48,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:17:48,069 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 11:17:48,097 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:17:48,114 INFO L192 MainTranslator]: Completed translation [2019-11-20 11:17:48,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:48 WrapperNode [2019-11-20 11:17:48,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 11:17:48,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 11:17:48,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 11:17:48,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 11:17:48,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:48" (1/1) ... [2019-11-20 11:17:48,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:48" (1/1) ... [2019-11-20 11:17:48,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 11:17:48,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 11:17:48,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 11:17:48,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 11:17:48,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:48" (1/1) ... [2019-11-20 11:17:48,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:48" (1/1) ... [2019-11-20 11:17:48,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:48" (1/1) ... [2019-11-20 11:17:48,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:48" (1/1) ... [2019-11-20 11:17:48,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:48" (1/1) ... [2019-11-20 11:17:48,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:48" (1/1) ... [2019-11-20 11:17:48,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:48" (1/1) ... [2019-11-20 11:17:48,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 11:17:48,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 11:17:48,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 11:17:48,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 11:17:48,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/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 [2019-11-20 11:17:48,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 11:17:48,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 11:17:51,914 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 11:17:51,914 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 11:17:51,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:17:51 BoogieIcfgContainer [2019-11-20 11:17:51,915 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 11:17:51,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 11:17:51,916 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 11:17:51,919 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 11:17:51,919 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:17:47" (1/3) ... [2019-11-20 11:17:51,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229a35e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:17:51, skipping insertion in model container [2019-11-20 11:17:51,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:17:48" (2/3) ... [2019-11-20 11:17:51,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@229a35e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:17:51, skipping insertion in model container [2019-11-20 11:17:51,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:17:51" (3/3) ... [2019-11-20 11:17:51,922 INFO L109 eAbstractionObserver]: Analyzing ICFG loop3.c [2019-11-20 11:17:51,931 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 11:17:51,936 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 11:17:51,946 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 11:17:51,966 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 11:17:51,966 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 11:17:51,966 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 11:17:51,966 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 11:17:51,967 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 11:17:51,967 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 11:17:51,967 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 11:17:51,967 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 11:17:51,978 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-11-20 11:17:51,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-20 11:17:51,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:17:51,983 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-20 11:17:51,983 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:17:51,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:17:51,987 INFO L82 PathProgramCache]: Analyzing trace with hash 890122407, now seen corresponding path program 1 times [2019-11-20 11:17:51,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:17:51,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000344350] [2019-11-20 11:17:51,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/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 [2019-11-20 11:17:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:17:52,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 11:17:52,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:17:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:17:52,082 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:17:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:17:52,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000344350] [2019-11-20 11:17:52,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:17:52,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 11:17:52,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077768596] [2019-11-20 11:17:52,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 11:17:52,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:17:52,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 11:17:52,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 11:17:52,102 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-11-20 11:17:52,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:17:52,114 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2019-11-20 11:17:52,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 11:17:52,115 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-20 11:17:52,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:17:52,122 INFO L225 Difference]: With dead ends: 22 [2019-11-20 11:17:52,122 INFO L226 Difference]: Without dead ends: 10 [2019-11-20 11:17:52,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 11:17:52,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-11-20 11:17:52,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-20 11:17:52,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-20 11:17:52,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-11-20 11:17:52,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2019-11-20 11:17:52,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:17:52,151 INFO L462 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-20 11:17:52,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 11:17:52,151 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-11-20 11:17:52,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 11:17:52,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:17:52,152 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:17:52,366 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-20 11:17:52,366 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:17:52,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:17:52,367 INFO L82 PathProgramCache]: Analyzing trace with hash 642088082, now seen corresponding path program 1 times [2019-11-20 11:17:52,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:17:52,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624677497] [2019-11-20 11:17:52,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/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 [2019-11-20 11:17:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:17:54,663 WARN L253 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-20 11:17:54,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:18:09,909 WARN L191 SmtUtils]: Spent 10.94 s on a formula simplification that was a NOOP. DAG size: 28 [2019-11-20 11:18:32,207 WARN L191 SmtUtils]: Spent 18.27 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-20 11:18:34,582 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 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))) (= 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)))))) is different from false [2019-11-20 11:18:36,970 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 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))) (= 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)))))) is different from true [2019-11-20 11:18:36,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:18:48,984 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 ((.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)))))) (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))) (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))))))))))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) is different from false [2019-11-20 11:18:56,049 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 ((.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))))))))))) is different from false [2019-11-20 11:18:58,415 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 ((.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))))))))))) is different from true [2019-11-20 11:18:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:18:58,419 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:19:02,860 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2019-11-20 11:19:04,954 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2019-11-20 11:19:07,031 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2019-11-20 11:19:09,106 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2019-11-20 11:19:11,264 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2019-11-20 11:19:13,397 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2019-11-20 11:19:16,341 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~oddExp~0_9 (_ FloatingPoint 8 24))) (or (not (fp.lt v_ULTIMATE.start_main_~oddExp~0_9 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_9 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_9 ((_ 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 v_ULTIMATE.start_main_~oddExp~0_9 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_9 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))) (not (fp.gt v_ULTIMATE.start_main_~oddExp~0_9 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2019-11-20 11:19:16,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:19:16,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624677497] [2019-11-20 11:19:16,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:19:16,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 14 [2019-11-20 11:19:16,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943696105] [2019-11-20 11:19:16,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 11:19:16,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:19:16,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 11:19:16,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=12, NotChecked=126, Total=210 [2019-11-20 11:19:16,347 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 15 states. [2019-11-20 11:19:18,660 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~oddExp~0_9 (_ FloatingPoint 8 24))) (or (not (fp.lt v_ULTIMATE.start_main_~oddExp~0_9 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_9 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_9 ((_ 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 v_ULTIMATE.start_main_~oddExp~0_9 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_9 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))) (not (fp.gt v_ULTIMATE.start_main_~oddExp~0_9 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) (= c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) is different from false [2019-11-20 11:19:20,993 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~oddExp~0_9 (_ FloatingPoint 8 24))) (or (not (fp.lt v_ULTIMATE.start_main_~oddExp~0_9 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_9 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_9 ((_ 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 v_ULTIMATE.start_main_~oddExp~0_9 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_9 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))) (not (fp.gt v_ULTIMATE.start_main_~oddExp~0_9 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) (= c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) is different from true [2019-11-20 11:19:23,362 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~term~0) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_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)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))))) is different from false [2019-11-20 11:19:25,518 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~term~0) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_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)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))))) is different from true [2019-11-20 11:19:27,856 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_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)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))))) is different from false [2019-11-20 11:19:29,938 WARN L860 $PredicateComparison]: unable to prove that (and (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_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)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))))) is different from true [2019-11-20 11:19:32,272 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_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)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))))) is different from false [2019-11-20 11:19:34,369 WARN L860 $PredicateComparison]: unable to prove that (and (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_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)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))))) is different from true [2019-11-20 11:19:36,720 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 ((.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 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))) (= 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))))))) is different from false [2019-11-20 11:19:41,366 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (not .cse0) (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 ((_ 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)))))))) (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 (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 ((.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))))))))))) .cse0)))) is different from false [2019-11-20 11:19:41,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:41,381 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-11-20 11:19:41,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 11:19:41,382 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 9 [2019-11-20 11:19:41,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:41,382 INFO L225 Difference]: With dead ends: 18 [2019-11-20 11:19:41,382 INFO L226 Difference]: Without dead ends: 14 [2019-11-20 11:19:41,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 90.3s TimeCoverageRelationStatistics Valid=43, Invalid=43, Unknown=22, NotChecked=312, Total=420 [2019-11-20 11:19:41,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-20 11:19:41,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-20 11:19:41,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-20 11:19:41,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-20 11:19:41,386 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-11-20 11:19:41,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:41,387 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-20 11:19:41,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 11:19:41,387 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-11-20 11:19:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-20 11:19:41,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:41,387 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:19:41,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-20 11:19:41,588 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:41,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:41,588 INFO L82 PathProgramCache]: Analyzing trace with hash 584829780, now seen corresponding path program 1 times [2019-11-20 11:19:41,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:19:41,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818931310] [2019-11-20 11:19:41,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/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 [2019-11-20 11:19:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:19:42,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:19:42,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:19:42,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:19:42,390 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:19:42,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:19:42,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818931310] [2019-11-20 11:19:42,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:19:42,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 11:19:42,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576762884] [2019-11-20 11:19:42,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:19:42,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:19:42,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:19:42,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:19:42,399 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 4 states. [2019-11-20 11:19:46,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:19:46,867 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-11-20 11:19:46,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:19:46,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-20 11:19:46,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:19:46,882 INFO L225 Difference]: With dead ends: 23 [2019-11-20 11:19:46,883 INFO L226 Difference]: Without dead ends: 15 [2019-11-20 11:19:46,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:19:46,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-20 11:19:46,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-20 11:19:46,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-20 11:19:46,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-11-20 11:19:46,886 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-11-20 11:19:46,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:19:46,887 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-20 11:19:46,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:19:46,887 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-11-20 11:19:46,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 11:19:46,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:46,888 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:19:47,088 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-20 11:19:47,089 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:47,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:47,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1074766744, now seen corresponding path program 1 times [2019-11-20 11:19:47,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:19:47,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554547028] [2019-11-20 11:19:47,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/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 [2019-11-20 11:20:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:20:00,900 WARN L253 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-20 11:20:00,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:20:14,549 WARN L191 SmtUtils]: Spent 11.09 s on a formula simplification that was a NOOP. DAG size: 28 [2019-11-20 11:20:43,455 WARN L191 SmtUtils]: Spent 26.16 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-20 11:20:45,799 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ 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 .cse1 .cse0))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 c_ULTIMATE.start_main_~term~0))))) is different from false [2019-11-20 11:20:47,824 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ 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 .cse1 .cse0))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 c_ULTIMATE.start_main_~term~0))))) is different from true [2019-11-20 11:20:50,179 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0)) c_ULTIMATE.start_main_~oddExp~0) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ 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 .cse1 .cse2)))))) is different from false [2019-11-20 11:20:52,544 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0)) c_ULTIMATE.start_main_~oddExp~0) (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ 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 .cse1 .cse2)))))) is different from false [2019-11-20 11:20:54,965 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (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)))))) (and (= 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 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (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 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)))))) c_ULTIMATE.start_main_~oddExp~0)))))) is different from false [2019-11-20 11:20:57,333 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (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)))))) (and (= 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 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (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 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)))))) c_ULTIMATE.start_main_~oddExp~0)))))) is different from true [2019-11-20 11:20:57,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:21:09,690 WARN L838 $PredicateComparison]: unable to prove that (or (and (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 ((.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))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (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))) (not (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))))))))))))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) is different from false [2019-11-20 11:21:16,863 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 ((.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))))))))))))) is different from false [2019-11-20 11:21:19,215 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 ((.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))))))))))))) is different from true [2019-11-20 11:21:19,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2019-11-20 11:21:19,221 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:21:23,294 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2019-11-20 11:21:25,409 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2019-11-20 11:21:27,498 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2019-11-20 11:21:29,592 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2019-11-20 11:21:31,759 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2019-11-20 11:21:33,900 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2019-11-20 11:21:36,159 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from false [2019-11-20 11:21:38,390 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from true [2019-11-20 11:21:40,634 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from false [2019-11-20 11:21:42,875 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from true [2019-11-20 11:21:45,149 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) is different from false [2019-11-20 11:21:47,429 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) is different from true [2019-11-20 11:21:50,623 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~oddExp~0_16 (_ FloatingPoint 8 24))) (or (let ((.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 ((_ 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 v_ULTIMATE.start_main_~oddExp~0_16 ((_ 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 v_ULTIMATE.start_main_~oddExp~0_16 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))) (not (fp.gt v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (not (fp.lt v_ULTIMATE.start_main_~oddExp~0_16 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))))) is different from true [2019-11-20 11:21:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2019-11-20 11:21:50,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554547028] [2019-11-20 11:21:50,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:21:50,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2019-11-20 11:21:50,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275125629] [2019-11-20 11:21:50,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-20 11:21:50,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:21:50,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-20 11:21:50,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=43, Unknown=22, NotChecked=312, Total=420 [2019-11-20 11:21:50,629 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 21 states. [2019-11-20 11:21:52,994 WARN L838 $PredicateComparison]: unable to prove that (and (= c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0)))) (forall ((v_ULTIMATE.start_main_~oddExp~0_16 (_ FloatingPoint 8 24))) (or (let ((.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 ((_ 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 v_ULTIMATE.start_main_~oddExp~0_16 ((_ 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 v_ULTIMATE.start_main_~oddExp~0_16 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))) (not (fp.gt v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (not (fp.lt v_ULTIMATE.start_main_~oddExp~0_16 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))))))) is different from false [2019-11-20 11:21:55,399 WARN L860 $PredicateComparison]: unable to prove that (and (= c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0)))) (forall ((v_ULTIMATE.start_main_~oddExp~0_16 (_ FloatingPoint 8 24))) (or (let ((.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 ((_ 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 v_ULTIMATE.start_main_~oddExp~0_16 ((_ 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 v_ULTIMATE.start_main_~oddExp~0_16 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))) (not (fp.gt v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (not (fp.lt v_ULTIMATE.start_main_~oddExp~0_16 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))))))) is different from true [2019-11-20 11:21:57,805 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~term~0) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_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)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0)) is different from false [2019-11-20 11:22:00,078 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~term~0) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_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)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0)) is different from true [2019-11-20 11:22:02,477 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_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)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) is different from false [2019-11-20 11:22:04,698 WARN L860 $PredicateComparison]: unable to prove that (and (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_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)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) is different from true [2019-11-20 11:22:07,132 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_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)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) is different from false [2019-11-20 11:22:09,380 WARN L860 $PredicateComparison]: unable to prove that (and (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_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)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) is different from true [2019-11-20 11:22:11,776 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ 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 .cse1 .cse0))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 c_ULTIMATE.start_main_~term~0))) (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))))) is different from false [2019-11-20 11:22:13,920 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ 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 .cse1 .cse0))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 c_ULTIMATE.start_main_~term~0))) (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))))) is different from true [2019-11-20 11:22:16,318 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0)) c_ULTIMATE.start_main_~oddExp~0) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ 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 .cse1 .cse2))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse1 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))))) is different from false [2019-11-20 11:22:18,403 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0)) c_ULTIMATE.start_main_~oddExp~0) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ 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 .cse1 .cse2))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse1 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))))) is different from true [2019-11-20 11:22:20,810 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0)) c_ULTIMATE.start_main_~oddExp~0) (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse2 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ 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 .cse1 .cse3)))))) is different from false [2019-11-20 11:22:22,919 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0)) c_ULTIMATE.start_main_~oddExp~0) (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse2 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ 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 .cse1 .cse3)))))) is different from true [2019-11-20 11:22:25,339 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 ((.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)))))) (and (= 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 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (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 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)))))) c_ULTIMATE.start_main_~oddExp~0))))))) is different from false [2019-11-20 11:22:32,489 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 (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))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (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))) (not (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))))))))))))) .cse0)))) is different from false [2019-11-20 11:22:34,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:22:34,182 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-11-20 11:22:34,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 11:22:34,182 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 13 [2019-11-20 11:22:34,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:22:34,183 INFO L225 Difference]: With dead ends: 22 [2019-11-20 11:22:34,183 INFO L226 Difference]: Without dead ends: 18 [2019-11-20 11:22:34,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 132.5s TimeCoverageRelationStatistics Valid=61, Invalid=45, Unknown=38, NotChecked=726, Total=870 [2019-11-20 11:22:34,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-20 11:22:34,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-20 11:22:34,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-20 11:22:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-11-20 11:22:34,187 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-11-20 11:22:34,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:22:34,188 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-20 11:22:34,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-20 11:22:34,188 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-11-20 11:22:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-20 11:22:34,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:22:34,188 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:22:34,389 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-20 11:22:34,389 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:22:34,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:22:34,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1132025046, now seen corresponding path program 1 times [2019-11-20 11:22:34,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:22:34,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668979692] [2019-11-20 11:22:34,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/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 [2019-11-20 11:22:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:22:36,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 11:22:36,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:22:36,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:22:36,061 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:22:36,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:22:36,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668979692] [2019-11-20 11:22:36,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:22:36,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-20 11:22:36,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509822306] [2019-11-20 11:22:36,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 11:22:36,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:22:36,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 11:22:36,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:22:36,087 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 6 states. [2019-11-20 11:22:48,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:22:48,036 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-11-20 11:22:48,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 11:22:48,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-20 11:22:48,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:22:48,037 INFO L225 Difference]: With dead ends: 34 [2019-11-20 11:22:48,037 INFO L226 Difference]: Without dead ends: 26 [2019-11-20 11:22:48,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:22:48,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-20 11:22:48,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2019-11-20 11:22:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-20 11:22:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-20 11:22:48,042 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 13 [2019-11-20 11:22:48,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:22:48,043 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-20 11:22:48,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 11:22:48,043 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-11-20 11:22:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 11:22:48,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:22:48,044 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-20 11:22:48,244 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-20 11:22:48,245 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:22:48,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:22:48,245 INFO L82 PathProgramCache]: Analyzing trace with hash -958701250, now seen corresponding path program 2 times [2019-11-20 11:22:48,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:22:48,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399038213] [2019-11-20 11:22:48,246 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/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 [2019-11-20 11:24:03,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 11:24:03,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 11:24:03,712 WARN L253 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-20 11:24:03,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:24:21,841 WARN L191 SmtUtils]: Spent 13.59 s on a formula simplification that was a NOOP. DAG size: 28 [2019-11-20 11:24:45,814 WARN L191 SmtUtils]: Spent 20.58 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-20 11:24:48,178 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= 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))) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))) c_ULTIMATE.start_main_~term~0) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0))))) is different from false [2019-11-20 11:24:51,939 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= 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))) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from false [2019-11-20 11:24:54,331 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= 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))) (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from false [2019-11-20 11:24:56,774 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= 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 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))) c_ULTIMATE.start_main_~term~0) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) c_ULTIMATE.start_main_~oddExp~0) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)))))) is different from false [2019-11-20 11:24:59,275 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= 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 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) c_ULTIMATE.start_main_~oddExp~0)))))) is different from false [2019-11-20 11:25:01,754 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= 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 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) c_ULTIMATE.start_main_~oddExp~0)))))) is different from false [2019-11-20 11:25:04,196 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= 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 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) c_ULTIMATE.start_main_~oddExp~0)))))) is different from true [2019-11-20 11:25:06,840 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)))) (= c_ULTIMATE.start_main_~oddExp~0 (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))))))) (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 (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 [2019-11-20 11:25:09,418 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)))) (= c_ULTIMATE.start_main_~oddExp~0 (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))))))) (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 (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 [2019-11-20 11:25:09,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:25:23,254 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))) (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))))))))))))))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (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 ((.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)))))))))))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)))) is different from false [2019-11-20 11:25:31,178 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 [2019-11-20 11:25:33,755 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 [2019-11-20 11:25:33,762 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2019-11-20 11:25:33,762 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:25:38,874 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2019-11-20 11:25:40,977 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2019-11-20 11:25:43,067 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2019-11-20 11:25:45,151 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2019-11-20 11:25:47,296 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2019-11-20 11:25:49,446 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2019-11-20 11:25:51,695 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from false [2019-11-20 11:25:53,939 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from true [2019-11-20 11:25:56,170 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from false [2019-11-20 11:25:58,407 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from true [2019-11-20 11:26:00,685 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) is different from false [2019-11-20 11:26:02,971 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) is different from true [2019-11-20 11:26:05,358 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32)))))))))))) is different from false [2019-11-20 11:26:07,727 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32)))))))))))) is different from true [2019-11-20 11:26:10,087 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32)))))))))))) is different from false [2019-11-20 11:26:12,473 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32)))))))))))) is different from true [2019-11-20 11:26:14,909 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~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 c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32))))))))))))) is different from false [2019-11-20 11:26:17,336 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~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 c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32))))))))))))) is different from true [2019-11-20 11:26:21,380 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~term~0_42 (_ FloatingPoint 8 24))) (or (not (fp.gt v_ULTIMATE.start_main_~term~0_42 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ 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 v_ULTIMATE.start_main_~term~0_42 ((_ 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 v_ULTIMATE.start_main_~term~0_42 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))) (not (fp.lt v_ULTIMATE.start_main_~term~0_42 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))))) is different from true [2019-11-20 11:26:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2019-11-20 11:26:21,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399038213] [2019-11-20 11:26:21,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:26:21,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2019-11-20 11:26:21,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934512351] [2019-11-20 11:26:21,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-20 11:26:21,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:26:21,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-20 11:26:21,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=46, Unknown=31, NotChecked=570, Total=702 [2019-11-20 11:26:21,389 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 27 states. [2019-11-20 11:26:23,987 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~term~0_42 (_ FloatingPoint 8 24))) (or (not (fp.gt v_ULTIMATE.start_main_~term~0_42 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ 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 v_ULTIMATE.start_main_~term~0_42 ((_ 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 v_ULTIMATE.start_main_~term~0_42 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))) (not (fp.lt v_ULTIMATE.start_main_~term~0_42 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))))) (= c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) is different from false [2019-11-20 11:26:26,648 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~term~0_42 (_ FloatingPoint 8 24))) (or (not (fp.gt v_ULTIMATE.start_main_~term~0_42 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ 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 v_ULTIMATE.start_main_~term~0_42 ((_ 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 v_ULTIMATE.start_main_~term~0_42 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))) (not (fp.lt v_ULTIMATE.start_main_~term~0_42 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))))) (= c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) is different from true [2019-11-20 11:26:29,285 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~term~0) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_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)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~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 c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32))))))))))))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0)) is different from false [2019-11-20 11:26:31,709 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~term~0) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_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)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~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 c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32))))))))))))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0)) is different from true [2019-11-20 11:26:34,385 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32)))))))))))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_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)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0)) is different from false [2019-11-20 11:26:36,756 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32)))))))))))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_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)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0)) is different from true [2019-11-20 11:26:39,409 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (let ((.cse4 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32)))))))))))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_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)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0)) is different from false [2019-11-20 11:26:41,808 WARN L860 $PredicateComparison]: unable to prove that (and (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (let ((.cse4 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32)))))))))))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_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)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0)) is different from true [2019-11-20 11:26:44,442 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= 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))) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) (= (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))) c_ULTIMATE.start_main_~term~0) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0))))) is different from false [2019-11-20 11:26:46,735 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= 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))) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) (= (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))) c_ULTIMATE.start_main_~term~0) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0))))) is different from true [2019-11-20 11:26:49,351 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= 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))) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse2))) (let ((.cse4 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from false [2019-11-20 11:26:51,585 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= 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))) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse2))) (let ((.cse4 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from true [2019-11-20 11:26:54,207 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= 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))) (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse2))) (let ((.cse5 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse4 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse3 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse3 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from false [2019-11-20 11:26:56,479 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= 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))) (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse2))) (let ((.cse5 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse4 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse3 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse3 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from true [2019-11-20 11:26:59,109 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= 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 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))) c_ULTIMATE.start_main_~term~0) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) c_ULTIMATE.start_main_~oddExp~0) (let ((.cse4 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)))))) is different from false [2019-11-20 11:27:01,266 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= 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 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))) c_ULTIMATE.start_main_~term~0) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) c_ULTIMATE.start_main_~oddExp~0) (let ((.cse4 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)))))) is different from true [2019-11-20 11:27:03,935 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= 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 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) c_ULTIMATE.start_main_~oddExp~0)))))) is different from false [2019-11-20 11:27:06,030 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= 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 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) c_ULTIMATE.start_main_~oddExp~0)))))) is different from true [2019-11-20 11:27:08,717 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= 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 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse3 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) (= (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) c_ULTIMATE.start_main_~oddExp~0)))))) is different from false [2019-11-20 11:27:10,832 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= 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 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse3 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) (= (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) c_ULTIMATE.start_main_~oddExp~0)))))) is different from true [2019-11-20 11:27:13,513 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 ((.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)))) (= c_ULTIMATE.start_main_~oddExp~0 (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))))))) (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 (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 [2019-11-20 11:27:16,209 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (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))) (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))))))))))))))) .cse6) (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 ((.cse8 (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 ((.cse11 (fp.mul roundNearestTiesToEven .cse8 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse9 (fp.mul roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse12 (fp.mul roundNearestTiesToEven .cse9 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse10 (fp.mul roundNearestTiesToEven .cse12 (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 .cse7 .cse8)) (fp.mul roundNearestTiesToEven .cse7 .cse9)) (fp.mul roundNearestTiesToEven .cse7 .cse10)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse7 .cse11)) (fp.mul roundNearestTiesToEven .cse7 .cse12)) (fp.mul roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)))) (not .cse6))) is different from false [2019-11-20 11:27:22,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:27:22,154 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-11-20 11:27:22,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 11:27:22,156 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 17 [2019-11-20 11:27:22,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:27:22,157 INFO L225 Difference]: With dead ends: 30 [2019-11-20 11:27:22,157 INFO L226 Difference]: Without dead ends: 26 [2019-11-20 11:27:22,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 31 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 176.5s TimeCoverageRelationStatistics Valid=79, Invalid=48, Unknown=53, NotChecked=1302, Total=1482 [2019-11-20 11:27:22,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-20 11:27:22,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-20 11:27:22,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-20 11:27:22,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-11-20 11:27:22,163 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 17 [2019-11-20 11:27:22,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:27:22,164 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-20 11:27:22,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-20 11:27:22,164 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-11-20 11:27:22,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 11:27:22,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:27:22,165 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2019-11-20 11:27:22,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-20 11:27:22,366 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:27:22,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:27:22,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1536423148, now seen corresponding path program 3 times [2019-11-20 11:27:22,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:27:22,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024125001] [2019-11-20 11:27:22,367 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_985bd1e7-3068-492c-b390-76801800d39a/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-20 11:30:25,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-20 11:30:25,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 11:30:25,744 WARN L253 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-20 11:30:25,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:30:27,812 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_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)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0)) is different from false [2019-11-20 11:30:55,681 WARN L191 SmtUtils]: Spent 24.69 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-20 11:30:58,150 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= 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))) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))) c_ULTIMATE.start_main_~term~0) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0))))) is different from false [2019-11-20 11:31:00,601 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= 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))) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from false [2019-11-20 11:31:03,066 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= 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))) (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from false [2019-11-20 11:31:05,324 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32))))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967293 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= 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 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (fp.lt c_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 c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))) c_ULTIMATE.start_main_~term~0) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) c_ULTIMATE.start_main_~oddExp~0))))) is different from false [2019-11-20 11:31:06,344 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-20 11:31:06,545 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-20 11:31:06,546 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:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) 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.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:829) 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.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:576) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) 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:205) ... 41 more [2019-11-20 11:31:06,549 INFO L168 Benchmark]: Toolchain (without parser) took 798751.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 957.8 MB in the beginning and 895.1 MB in the end (delta: 62.6 MB). Peak memory consumption was 215.7 MB. Max. memory is 11.5 GB. [2019-11-20 11:31:06,550 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:31:06,551 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.45 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 947.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 11:31:06,552 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -202.9 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-11-20 11:31:06,552 INFO L168 Benchmark]: Boogie Preprocessor took 45.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-20 11:31:06,553 INFO L168 Benchmark]: RCFGBuilder took 3664.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-11-20 11:31:06,553 INFO L168 Benchmark]: TraceAbstraction took 794632.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 895.1 MB in the end (delta: 224.9 MB). Peak memory consumption was 224.9 MB. Max. memory is 11.5 GB. [2019-11-20 11:31:06,557 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.52 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 316.45 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 947.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 89.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -202.9 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3664.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 794632.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 895.1 MB in the end (delta: 224.9 MB). Peak memory consumption was 224.9 MB. Max. memory is 11.5 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:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...