./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/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 0fd0e678ea36c7b474907750a18ff4e57877f684 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/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 0fd0e678ea36c7b474907750a18ff4e57877f684 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-aa41828 [2018-11-23 00:52:44,269 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:52:44,270 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:52:44,280 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:52:44,280 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:52:44,281 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:52:44,282 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:52:44,283 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:52:44,285 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:52:44,286 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:52:44,286 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:52:44,287 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:52:44,287 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:52:44,288 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:52:44,289 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:52:44,289 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:52:44,291 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:52:44,292 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:52:44,294 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:52:44,295 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:52:44,296 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:52:44,297 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:52:44,299 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:52:44,299 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:52:44,299 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:52:44,300 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:52:44,301 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:52:44,302 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:52:44,303 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:52:44,304 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:52:44,304 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:52:44,304 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:52:44,305 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:52:44,305 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:52:44,305 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:52:44,307 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:52:44,307 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 00:52:44,318 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:52:44,318 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:52:44,319 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:52:44,319 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:52:44,320 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:52:44,320 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:52:44,320 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:52:44,320 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:52:44,320 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:52:44,320 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:52:44,321 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:52:44,321 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:52:44,321 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:52:44,321 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:52:44,321 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:52:44,321 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:52:44,322 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:52:44,323 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:52:44,324 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:52:44,324 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:52:44,324 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:52:44,324 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:52:44,324 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:52:44,324 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:52:44,325 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:52:44,325 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:52:44,325 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:52:44,325 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 00:52:44,325 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:52:44,325 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 00:52:44,326 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/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 -> 0fd0e678ea36c7b474907750a18ff4e57877f684 [2018-11-23 00:52:44,358 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:52:44,366 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:52:44,368 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:52:44,369 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:52:44,369 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:52:44,370 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-11-23 00:52:44,409 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/data/80bd61caf/7e2c3293a00f4634b58b2f8045b9f202/FLAG1236b6ada [2018-11-23 00:52:44,752 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:52:44,752 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-11-23 00:52:44,757 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/data/80bd61caf/7e2c3293a00f4634b58b2f8045b9f202/FLAG1236b6ada [2018-11-23 00:52:45,183 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/data/80bd61caf/7e2c3293a00f4634b58b2f8045b9f202 [2018-11-23 00:52:45,186 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:52:45,187 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:52:45,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:52:45,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:52:45,191 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:52:45,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:52:45" (1/1) ... [2018-11-23 00:52:45,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@342d28a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:45, skipping insertion in model container [2018-11-23 00:52:45,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:52:45" (1/1) ... [2018-11-23 00:52:45,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:52:45,215 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:52:45,342 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:52:45,345 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:52:45,358 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:52:45,369 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:52:45,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:45 WrapperNode [2018-11-23 00:52:45,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:52:45,370 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:52:45,371 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:52:45,371 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:52:45,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:45" (1/1) ... [2018-11-23 00:52:45,381 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:45" (1/1) ... [2018-11-23 00:52:45,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:52:45,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:52:45,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:52:45,388 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:52:45,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:45" (1/1) ... [2018-11-23 00:52:45,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:45" (1/1) ... [2018-11-23 00:52:45,395 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:45" (1/1) ... [2018-11-23 00:52:45,395 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:45" (1/1) ... [2018-11-23 00:52:45,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:45" (1/1) ... [2018-11-23 00:52:45,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:45" (1/1) ... [2018-11-23 00:52:45,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:45" (1/1) ... [2018-11-23 00:52:45,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:52:45,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:52:45,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:52:45,449 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:52:45,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/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 [2018-11-23 00:52:45,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:52:45,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:52:45,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:52:45,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:52:45,495 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:52:45,495 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:52:45,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 00:52:45,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 00:52:45,633 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:52:45,633 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 00:52:45,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:52:45 BoogieIcfgContainer [2018-11-23 00:52:45,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:52:45,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:52:45,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:52:45,638 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:52:45,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:52:45" (1/3) ... [2018-11-23 00:52:45,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c3d0cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:52:45, skipping insertion in model container [2018-11-23 00:52:45,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:45" (2/3) ... [2018-11-23 00:52:45,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19c3d0cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:52:45, skipping insertion in model container [2018-11-23 00:52:45,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:52:45" (3/3) ... [2018-11-23 00:52:45,642 INFO L112 eAbstractionObserver]: Analyzing ICFG loop3_true-unreach-call.c.i [2018-11-23 00:52:45,652 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:52:45,660 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 00:52:45,677 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 00:52:45,707 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:52:45,708 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:52:45,708 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:52:45,708 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:52:45,709 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:52:45,709 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:52:45,709 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:52:45,709 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:52:45,709 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:52:45,726 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 00:52:45,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 00:52:45,732 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:52:45,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:45,735 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:52:45,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:45,742 INFO L82 PathProgramCache]: Analyzing trace with hash 23164375, now seen corresponding path program 1 times [2018-11-23 00:52:45,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:45,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:45,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:45,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:45,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:52:45,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:52:45,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:52:45,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:52:45,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 00:52:45,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 00:52:45,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 00:52:45,868 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-23 00:52:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:52:45,886 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 00:52:45,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 00:52:45,888 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 00:52:45,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:52:45,896 INFO L225 Difference]: With dead ends: 34 [2018-11-23 00:52:45,896 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 00:52:45,899 INFO L631 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 [2018-11-23 00:52:45,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 00:52:45,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 00:52:45,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 00:52:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 00:52:45,928 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2018-11-23 00:52:45,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:52:45,928 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 00:52:45,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 00:52:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 00:52:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 00:52:45,929 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:52:45,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:45,929 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:52:45,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:45,930 INFO L82 PathProgramCache]: Analyzing trace with hash -2126491567, now seen corresponding path program 1 times [2018-11-23 00:52:45,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:45,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:45,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:45,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:45,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:52:46,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:52:46,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:52:46,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:52:46,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:52:46,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:52:46,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:52:46,015 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 3 states. [2018-11-23 00:52:46,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:52:46,034 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 00:52:46,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:52:46,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 00:52:46,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:52:46,035 INFO L225 Difference]: With dead ends: 27 [2018-11-23 00:52:46,035 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 00:52:46,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:52:46,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 00:52:46,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-23 00:52:46,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 00:52:46,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-23 00:52:46,039 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-11-23 00:52:46,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:52:46,040 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 00:52:46,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:52:46,040 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 00:52:46,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 00:52:46,040 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:52:46,041 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:46,041 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:52:46,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:46,041 INFO L82 PathProgramCache]: Analyzing trace with hash -351484205, now seen corresponding path program 1 times [2018-11-23 00:52:46,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:52:46,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:52:46,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:46,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:46,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:52:46,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:52:46,080 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|old(~pi~0)|=2.0, ~pi~0=2.0] [?] ~pi~0 := 3.14159; VAL [|old(~pi~0)|=2.0, ~pi~0=(/ 314159.0 100000.0)] [?] assume true; VAL [|old(~pi~0)|=2.0, ~pi~0=(/ 314159.0 100000.0)] [?] RET #45#return; VAL [~pi~0=(/ 314159.0 100000.0)] [?] CALL call #t~ret6 := main(); VAL [~pi~0=(/ 314159.0 100000.0)] [?] ~x~0 := #t~nondet1;havoc #t~nondet1;~octant1~0 := ~convertINTToFLOAT(0);~octant2~0 := ~someBinaryArithmeticFLOAToperation(~pi~0, ~convertINTToFLOAT(8));assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~octant1~0) && ~someBinaryFLOATComparisonOperation(~x~0, ~octant2~0) then 1 else 0);~oddExp~0 := ~x~0;~evenExp~0 := 1.0;~term~0 := ~x~0;~count~0 := 2;~multFactor~0 := 0;havoc ~temp~0; VAL [main_~count~0=2, main_~evenExp~0=1.0, main_~multFactor~0=0, main_~oddExp~0=3.0, main_~term~0=3.0, main_~x~0=3.0, ~pi~0=(/ 314159.0 100000.0)] [?] assume !false;~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); VAL [main_~count~0=2, main_~evenExp~0=1.0, main_~multFactor~0=0, main_~oddExp~0=3.0, main_~x~0=3.0, ~pi~0=(/ 314159.0 100000.0)] [?] assume !(0 == ~count~0 / 2 % 4294967296);#t~ite2 := -1; VAL [main_~count~0=2, main_~evenExp~0=1.0, main_~multFactor~0=0, main_~oddExp~0=3.0, main_~x~0=3.0, |main_#t~ite2|=(- 1), ~pi~0=(/ 314159.0 100000.0)] [?] ~multFactor~0 := #t~ite2;havoc #t~ite2;~evenExp~0 := ~someBinaryArithmeticFLOAToperation(~evenExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0));#t~post3 := ~count~0;~count~0 := 1 + #t~post3;havoc #t~post3;~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0)));~oddExp~0 := ~someBinaryArithmeticFLOAToperation(~oddExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0));#t~post4 := ~count~0;~count~0 := 1 + #t~post4;havoc #t~post4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~temp~0 := #t~nondet5;havoc #t~nondet5; VAL [main_~count~0=4, main_~multFactor~0=(- 1), main_~temp~0=0, main_~x~0=3.0, ~pi~0=(/ 314159.0 100000.0)] [?] assume 0 == ~temp~0; VAL [main_~count~0=4, main_~multFactor~0=(- 1), main_~temp~0=0, main_~x~0=3.0, ~pi~0=(/ 314159.0 100000.0)] [?] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~evenExp~0, ~oddExp~0) then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0, ~pi~0=(/ 314159.0 100000.0)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~pi~0=(/ 314159.0 100000.0)] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~pi~0=(/ 314159.0 100000.0)] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0, ~pi~0=(/ 314159.0 100000.0)] [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=2.0, ~pi~0=2.0] [L5] ~pi~0 := 3.14159; VAL [old(~pi~0)=2.0, ~pi~0=314159/100000] [?] ensures true; VAL [old(~pi~0)=2.0, ~pi~0=314159/100000] [?] RET call ULTIMATE.init(); VAL [~pi~0=314159/100000] [?] CALL call #t~ret6 := main(); VAL [~pi~0=314159/100000] [L11] ~x~0 := #t~nondet1; [L11] havoc #t~nondet1; [L12] ~octant1~0 := ~convertINTToFLOAT(0); [L13] ~octant2~0 := ~someBinaryArithmeticFLOAToperation(~pi~0, ~convertINTToFLOAT(8)); [L14] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~octant1~0) && ~someBinaryFLOATComparisonOperation(~x~0, ~octant2~0) then 1 else 0); [L15] ~oddExp~0 := ~x~0; [L16] ~evenExp~0 := 1.0; [L17] ~term~0 := ~x~0; [L18] ~count~0 := 2; [L19] ~multFactor~0 := 0; [L20] havoc ~temp~0; VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~term~0=3.0, ~x~0=3.0] [L22-L39] assume !false; [L24] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L25] assume !(0 == ~count~0 / 2 % 4294967296); [L25] #t~ite2 := -1; VAL [#t~ite2=-1, ~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L25] ~multFactor~0 := #t~ite2; [L25] havoc #t~ite2; [L27] ~evenExp~0 := ~someBinaryArithmeticFLOAToperation(~evenExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L29] #t~post3 := ~count~0; [L29] ~count~0 := 1 + #t~post3; [L29] havoc #t~post3; [L31] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L33] ~oddExp~0 := ~someBinaryArithmeticFLOAToperation(~oddExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L35] #t~post4 := ~count~0; [L35] ~count~0 := 1 + #t~post4; [L35] havoc #t~post4; [L37] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L37] ~temp~0 := #t~nondet5; [L37] havoc #t~nondet5; VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L38] assume 0 == ~temp~0; VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L41] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~evenExp~0, ~oddExp~0) then 1 else 0)); VAL [#in~cond=0, ~pi~0=314159/100000] [L3] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L3] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L3] assert false; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=2.0, ~pi~0=2.0] [L5] ~pi~0 := 3.14159; VAL [old(~pi~0)=2.0, ~pi~0=314159/100000] [?] ensures true; VAL [old(~pi~0)=2.0, ~pi~0=314159/100000] [?] RET call ULTIMATE.init(); VAL [~pi~0=314159/100000] [?] CALL call #t~ret6 := main(); VAL [~pi~0=314159/100000] [L11] ~x~0 := #t~nondet1; [L11] havoc #t~nondet1; [L12] ~octant1~0 := ~convertINTToFLOAT(0); [L13] ~octant2~0 := ~someBinaryArithmeticFLOAToperation(~pi~0, ~convertINTToFLOAT(8)); [L14] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~octant1~0) && ~someBinaryFLOATComparisonOperation(~x~0, ~octant2~0) then 1 else 0); [L15] ~oddExp~0 := ~x~0; [L16] ~evenExp~0 := 1.0; [L17] ~term~0 := ~x~0; [L18] ~count~0 := 2; [L19] ~multFactor~0 := 0; [L20] havoc ~temp~0; VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~term~0=3.0, ~x~0=3.0] [L22-L39] assume !false; [L24] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L25] assume !(0 == ~count~0 / 2 % 4294967296); [L25] #t~ite2 := -1; VAL [#t~ite2=-1, ~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L25] ~multFactor~0 := #t~ite2; [L25] havoc #t~ite2; [L27] ~evenExp~0 := ~someBinaryArithmeticFLOAToperation(~evenExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L29] #t~post3 := ~count~0; [L29] ~count~0 := 1 + #t~post3; [L29] havoc #t~post3; [L31] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L33] ~oddExp~0 := ~someBinaryArithmeticFLOAToperation(~oddExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L35] #t~post4 := ~count~0; [L35] ~count~0 := 1 + #t~post4; [L35] havoc #t~post4; [L37] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L37] ~temp~0 := #t~nondet5; [L37] havoc #t~nondet5; VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L38] assume 0 == ~temp~0; VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L41] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~evenExp~0, ~oddExp~0) then 1 else 0)); VAL [#in~cond=0, ~pi~0=314159/100000] [L3] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L3] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L3] assert false; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=2.0, ~pi~0=2.0] [L5] ~pi~0 := 3.14159; VAL [old(~pi~0)=2.0, ~pi~0=314159/100000] [?] RET call ULTIMATE.init(); VAL [~pi~0=314159/100000] [?] CALL call #t~ret6 := main(); VAL [~pi~0=314159/100000] [L11] ~x~0 := #t~nondet1; [L11] havoc #t~nondet1; [L12] ~octant1~0 := ~convertINTToFLOAT(0); [L13] ~octant2~0 := ~someBinaryArithmeticFLOAToperation(~pi~0, ~convertINTToFLOAT(8)); [L14] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~octant1~0) && ~someBinaryFLOATComparisonOperation(~x~0, ~octant2~0) then 1 else 0); [L15] ~oddExp~0 := ~x~0; [L16] ~evenExp~0 := 1.0; [L17] ~term~0 := ~x~0; [L18] ~count~0 := 2; [L19] ~multFactor~0 := 0; [L20] havoc ~temp~0; VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~term~0=3.0, ~x~0=3.0] [L22-L39] COND FALSE !(false) [L24] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L25] COND FALSE !(0 == ~count~0 / 2 % 4294967296) [L25] #t~ite2 := -1; VAL [#t~ite2=-1, ~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L25] ~multFactor~0 := #t~ite2; [L25] havoc #t~ite2; [L27] ~evenExp~0 := ~someBinaryArithmeticFLOAToperation(~evenExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L29] #t~post3 := ~count~0; [L29] ~count~0 := 1 + #t~post3; [L29] havoc #t~post3; [L31] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L33] ~oddExp~0 := ~someBinaryArithmeticFLOAToperation(~oddExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L35] #t~post4 := ~count~0; [L35] ~count~0 := 1 + #t~post4; [L35] havoc #t~post4; [L37] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L37] ~temp~0 := #t~nondet5; [L37] havoc #t~nondet5; VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L38] COND TRUE 0 == ~temp~0 VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L41] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~evenExp~0, ~oddExp~0) then 1 else 0)); VAL [#in~cond=0, ~pi~0=314159/100000] [L3] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L3] assert false; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=2.0, ~pi~0=2.0] [L5] ~pi~0 := 3.14159; VAL [old(~pi~0)=2.0, ~pi~0=314159/100000] [?] RET call ULTIMATE.init(); VAL [~pi~0=314159/100000] [?] CALL call #t~ret6 := main(); VAL [~pi~0=314159/100000] [L11] ~x~0 := #t~nondet1; [L11] havoc #t~nondet1; [L12] ~octant1~0 := ~convertINTToFLOAT(0); [L13] ~octant2~0 := ~someBinaryArithmeticFLOAToperation(~pi~0, ~convertINTToFLOAT(8)); [L14] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~octant1~0) && ~someBinaryFLOATComparisonOperation(~x~0, ~octant2~0) then 1 else 0); [L15] ~oddExp~0 := ~x~0; [L16] ~evenExp~0 := 1.0; [L17] ~term~0 := ~x~0; [L18] ~count~0 := 2; [L19] ~multFactor~0 := 0; [L20] havoc ~temp~0; VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~term~0=3.0, ~x~0=3.0] [L22-L39] COND FALSE !(false) [L24] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L25] COND FALSE !(0 == ~count~0 / 2 % 4294967296) [L25] #t~ite2 := -1; VAL [#t~ite2=-1, ~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L25] ~multFactor~0 := #t~ite2; [L25] havoc #t~ite2; [L27] ~evenExp~0 := ~someBinaryArithmeticFLOAToperation(~evenExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L29] #t~post3 := ~count~0; [L29] ~count~0 := 1 + #t~post3; [L29] havoc #t~post3; [L31] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L33] ~oddExp~0 := ~someBinaryArithmeticFLOAToperation(~oddExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L35] #t~post4 := ~count~0; [L35] ~count~0 := 1 + #t~post4; [L35] havoc #t~post4; [L37] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L37] ~temp~0 := #t~nondet5; [L37] havoc #t~nondet5; VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L38] COND TRUE 0 == ~temp~0 VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L41] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~evenExp~0, ~oddExp~0) then 1 else 0)); VAL [#in~cond=0, ~pi~0=314159/100000] [L3] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L3] assert false; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=2.0, ~pi~0=2.0] [L5] ~pi~0 := 3.14159; VAL [old(~pi~0)=2.0, ~pi~0=314159/100000] [?] RET call ULTIMATE.init(); VAL [~pi~0=314159/100000] [?] CALL call #t~ret6 := main(); VAL [~pi~0=314159/100000] [L11] ~x~0 := #t~nondet1; [L11] havoc #t~nondet1; [L12] ~octant1~0 := ~convertINTToFLOAT(0); [L13] ~octant2~0 := ~someBinaryArithmeticFLOAToperation(~pi~0, ~convertINTToFLOAT(8)); [L14] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~octant1~0) && ~someBinaryFLOATComparisonOperation(~x~0, ~octant2~0) then 1 else 0); [L15] ~oddExp~0 := ~x~0; [L16] ~evenExp~0 := 1.0; [L17] ~term~0 := ~x~0; [L18] ~count~0 := 2; [L19] ~multFactor~0 := 0; [L20] havoc ~temp~0; VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~term~0=3.0, ~x~0=3.0] [L22-L39] COND FALSE !(false) [L24] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L25] COND FALSE !(0 == ~count~0 / 2 % 4294967296) [L25] #t~ite2 := -1; VAL [#t~ite2=-1, ~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L25] ~multFactor~0 := #t~ite2; [L25] havoc #t~ite2; [L27] ~evenExp~0 := ~someBinaryArithmeticFLOAToperation(~evenExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L29] #t~post3 := ~count~0; [L29] ~count~0 := 1 + #t~post3; [L29] havoc #t~post3; [L31] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L33] ~oddExp~0 := ~someBinaryArithmeticFLOAToperation(~oddExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L35] #t~post4 := ~count~0; [L35] ~count~0 := 1 + #t~post4; [L35] havoc #t~post4; [L37] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L37] ~temp~0 := #t~nondet5; [L37] havoc #t~nondet5; VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L38] COND TRUE 0 == ~temp~0 VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L41] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~evenExp~0, ~oddExp~0) then 1 else 0)); VAL [#in~cond=0, ~pi~0=314159/100000] [L3] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L3] assert false; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [old(~pi~0)=2.0, ~pi~0=2.0] [L5] ~pi~0 := 3.14159; VAL [old(~pi~0)=2.0, ~pi~0=314159/100000] [?] RET call ULTIMATE.init(); VAL [~pi~0=314159/100000] [?] CALL call #t~ret6 := main(); VAL [~pi~0=314159/100000] [L11] ~x~0 := #t~nondet1; [L11] havoc #t~nondet1; [L12] ~octant1~0 := ~convertINTToFLOAT(0); [L13] ~octant2~0 := ~someBinaryArithmeticFLOAToperation(~pi~0, ~convertINTToFLOAT(8)); [L14] assume 0 != (if ~someBinaryFLOATComparisonOperation(~x~0, ~octant1~0) && ~someBinaryFLOATComparisonOperation(~x~0, ~octant2~0) then 1 else 0); [L15] ~oddExp~0 := ~x~0; [L16] ~evenExp~0 := 1.0; [L17] ~term~0 := ~x~0; [L18] ~count~0 := 2; [L19] ~multFactor~0 := 0; [L20] havoc ~temp~0; VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~term~0=3.0, ~x~0=3.0] [L22-L39] COND FALSE !(false) [L24] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); VAL [~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L25] COND FALSE !(0 == ~count~0 / 2 % 4294967296) [L25] #t~ite2 := -1; VAL [#t~ite2=-1, ~count~0=2, ~evenExp~0=1.0, ~multFactor~0=0, ~oddExp~0=3.0, ~pi~0=314159/100000, ~x~0=3.0] [L25] ~multFactor~0 := #t~ite2; [L25] havoc #t~ite2; [L27] ~evenExp~0 := ~someBinaryArithmeticFLOAToperation(~evenExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L29] #t~post3 := ~count~0; [L29] ~count~0 := 1 + #t~post3; [L29] havoc #t~post3; [L31] ~term~0 := ~someBinaryArithmeticFLOAToperation(~term~0, ~someBinaryArithmeticFLOAToperation(~x~0, ~convertUINTToFLOAT(~count~0))); [L33] ~oddExp~0 := ~someBinaryArithmeticFLOAToperation(~oddExp~0, ~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(~multFactor~0), ~term~0)); [L35] #t~post4 := ~count~0; [L35] ~count~0 := 1 + #t~post4; [L35] havoc #t~post4; [L37] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L37] ~temp~0 := #t~nondet5; [L37] havoc #t~nondet5; VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L38] COND TRUE 0 == ~temp~0 VAL [~count~0=4, ~multFactor~0=-1, ~pi~0=314159/100000, ~temp~0=0, ~x~0=3.0] [L41] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~evenExp~0, ~oddExp~0) then 1 else 0)); VAL [#in~cond=0, ~pi~0=314159/100000] [L3] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L3] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L3] assert false; VAL [#in~cond=0, ~cond=0, ~pi~0=314159/100000] [L5] float pi = 3.14159 ; VAL [\old(pi)=2, pi=314159/100000] [L11] float x = __VERIFIER_nondet_float() ; [L12] float octant1 = 0 ; [L13] float octant2 = pi/8 ; [L15] float oddExp = x ; [L16] float evenExp = 1.0 ; [L17] float term = x ; [L18] unsigned int count = 2 ; [L19] int multFactor = 0 ; [L20] int temp ; VAL [count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, term=3, x=3] [L22] COND TRUE 1 [L24] term = term * (x/count) VAL [count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, x=3] [L25] EXPR (count>>1 % 2 == 0) ? 1 : -1 VAL [(count>>1 % 2 == 0) ? 1 : -1=-1, count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, x=3] [L25] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L27] evenExp = evenExp + multFactor*term [L29] count++ [L31] term = term * (x/count) [L33] oddExp = oddExp + multFactor*term [L35] count++ [L37] temp = __VERIFIER_nondet_int() [L38] COND TRUE temp == 0 VAL [count=4, multFactor=-1, pi=314159/100000, temp=0, x=3] [L41] CALL __VERIFIER_assert( evenExp >= oddExp ) VAL [\old(cond)=0, pi=314159/100000] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, pi=314159/100000] [L3] __VERIFIER_error() VAL [\old(cond)=0, cond=0, pi=314159/100000] ----- [2018-11-23 00:52:46,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:52:46 BoogieIcfgContainer [2018-11-23 00:52:46,110 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:52:46,110 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:52:46,110 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:52:46,110 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:52:46,111 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:52:45" (3/4) ... [2018-11-23 00:52:46,113 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 00:52:46,113 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:52:46,114 INFO L168 Benchmark]: Toolchain (without parser) took 927.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -112.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:52:46,116 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:52:46,116 INFO L168 Benchmark]: CACSL2BoogieTranslator took 182.59 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:52:46,117 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.83 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:52:46,117 INFO L168 Benchmark]: Boogie Preprocessor took 61.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-23 00:52:46,118 INFO L168 Benchmark]: RCFGBuilder took 184.77 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-23 00:52:46,119 INFO L168 Benchmark]: TraceAbstraction took 475.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: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2018-11-23 00:52:46,119 INFO L168 Benchmark]: Witness Printer took 3.35 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. [2018-11-23 00:52:46,123 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 182.59 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 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 16.83 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -180.3 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 184.77 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: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 475.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: 30.1 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.35 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 14, overapproximation of to_real at line 12, overapproximation of someBinaryArithmeticFLOAToperation at line 27. Possible FailurePath: [L5] float pi = 3.14159 ; VAL [\old(pi)=2, pi=314159/100000] [L11] float x = __VERIFIER_nondet_float() ; [L12] float octant1 = 0 ; [L13] float octant2 = pi/8 ; [L15] float oddExp = x ; [L16] float evenExp = 1.0 ; [L17] float term = x ; [L18] unsigned int count = 2 ; [L19] int multFactor = 0 ; [L20] int temp ; VAL [count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, term=3, x=3] [L22] COND TRUE 1 [L24] term = term * (x/count) VAL [count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, x=3] [L25] EXPR (count>>1 % 2 == 0) ? 1 : -1 VAL [(count>>1 % 2 == 0) ? 1 : -1=-1, count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, x=3] [L25] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L27] evenExp = evenExp + multFactor*term [L29] count++ [L31] term = term * (x/count) [L33] oddExp = oddExp + multFactor*term [L35] count++ [L37] temp = __VERIFIER_nondet_int() [L38] COND TRUE temp == 0 VAL [count=4, multFactor=-1, pi=314159/100000, temp=0, x=3] [L41] CALL __VERIFIER_assert( evenExp >= oddExp ) VAL [\old(cond)=0, pi=314159/100000] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, pi=314159/100000] [L3] __VERIFIER_error() VAL [\old(cond)=0, cond=0, pi=314159/100000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 37 SDtfs, 1 SDslu, 12 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: 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.23-aa41828 [2018-11-23 00:52:47,782 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:52:47,783 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:52:47,793 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:52:47,794 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:52:47,794 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:52:47,795 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:52:47,797 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:52:47,799 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:52:47,799 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:52:47,800 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:52:47,800 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:52:47,801 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:52:47,802 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:52:47,803 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:52:47,804 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:52:47,805 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:52:47,806 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:52:47,808 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:52:47,809 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:52:47,810 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:52:47,811 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:52:47,813 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:52:47,813 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:52:47,814 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:52:47,814 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:52:47,815 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:52:47,816 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:52:47,816 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:52:47,817 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:52:47,817 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:52:47,819 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:52:47,819 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:52:47,819 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:52:47,820 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:52:47,821 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:52:47,821 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 00:52:47,833 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:52:47,833 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:52:47,834 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:52:47,834 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:52:47,835 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:52:47,835 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:52:47,835 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:52:47,835 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:52:47,835 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:52:47,836 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:52:47,836 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:52:47,836 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:52:47,836 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:52:47,836 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:52:47,836 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 00:52:47,836 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 00:52:47,836 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:52:47,837 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:52:47,837 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:52:47,837 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:52:47,837 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:52:47,837 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:52:47,837 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:52:47,838 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:52:47,840 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:52:47,840 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:52:47,841 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:52:47,841 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:52:47,841 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 00:52:47,841 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:52:47,841 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 00:52:47,841 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 00:52:47,841 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/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 -> 0fd0e678ea36c7b474907750a18ff4e57877f684 [2018-11-23 00:52:47,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:52:47,888 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:52:47,891 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:52:47,893 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:52:47,893 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:52:47,894 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-11-23 00:52:47,942 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/data/5ae4ce765/2a5bdab506034b70ac6e6ca307c4303b/FLAG767f5b204 [2018-11-23 00:52:48,306 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:52:48,306 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-11-23 00:52:48,311 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/data/5ae4ce765/2a5bdab506034b70ac6e6ca307c4303b/FLAG767f5b204 [2018-11-23 00:52:48,323 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/data/5ae4ce765/2a5bdab506034b70ac6e6ca307c4303b [2018-11-23 00:52:48,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:52:48,327 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:52:48,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:52:48,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:52:48,331 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:52:48,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:52:48" (1/1) ... [2018-11-23 00:52:48,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@82defbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:48, skipping insertion in model container [2018-11-23 00:52:48,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:52:48" (1/1) ... [2018-11-23 00:52:48,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:52:48,358 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:52:48,516 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:52:48,520 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:52:48,536 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:52:48,550 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:52:48,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:48 WrapperNode [2018-11-23 00:52:48,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:52:48,552 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:52:48,552 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:52:48,552 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:52:48,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:48" (1/1) ... [2018-11-23 00:52:48,565 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:48" (1/1) ... [2018-11-23 00:52:48,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:52:48,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:52:48,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:52:48,571 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:52:48,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:48" (1/1) ... [2018-11-23 00:52:48,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:48" (1/1) ... [2018-11-23 00:52:48,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:48" (1/1) ... [2018-11-23 00:52:48,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:48" (1/1) ... [2018-11-23 00:52:48,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:48" (1/1) ... [2018-11-23 00:52:48,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:48" (1/1) ... [2018-11-23 00:52:48,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:48" (1/1) ... [2018-11-23 00:52:48,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:52:48,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:52:48,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:52:48,594 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:52:48,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/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 [2018-11-23 00:52:48,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:52:48,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:52:48,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:52:48,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:52:48,692 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:52:48,693 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:52:48,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 00:52:48,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 00:52:53,046 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:52:53,046 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 00:52:53,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:52:53 BoogieIcfgContainer [2018-11-23 00:52:53,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:52:53,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:52:53,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:52:53,051 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:52:53,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:52:48" (1/3) ... [2018-11-23 00:52:53,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597da3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:52:53, skipping insertion in model container [2018-11-23 00:52:53,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:48" (2/3) ... [2018-11-23 00:52:53,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597da3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:52:53, skipping insertion in model container [2018-11-23 00:52:53,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:52:53" (3/3) ... [2018-11-23 00:52:53,055 INFO L112 eAbstractionObserver]: Analyzing ICFG loop3_true-unreach-call.c.i [2018-11-23 00:52:53,062 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:52:53,068 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 00:52:53,086 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 00:52:53,107 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:52:53,108 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:52:53,108 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:52:53,108 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:52:53,109 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:52:53,109 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:52:53,109 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:52:53,109 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:52:53,109 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:52:53,122 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 00:52:53,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 00:52:53,126 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:52:53,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:53,128 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:52:53,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:53,132 INFO L82 PathProgramCache]: Analyzing trace with hash 23164375, now seen corresponding path program 1 times [2018-11-23 00:52:53,135 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:52:53,135 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/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 [2018-11-23 00:52:53,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:52:53,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:52:53,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:52:53,213 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:52:53,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:52:53,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:52:53,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 00:52:53,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 00:52:53,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 00:52:53,248 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-23 00:52:53,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:52:53,262 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 00:52:53,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 00:52:53,263 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 00:52:53,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:52:53,269 INFO L225 Difference]: With dead ends: 34 [2018-11-23 00:52:53,269 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 00:52:53,271 INFO L631 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 [2018-11-23 00:52:53,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 00:52:53,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 00:52:53,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 00:52:53,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 00:52:53,298 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2018-11-23 00:52:53,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:52:53,298 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 00:52:53,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 00:52:53,298 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 00:52:53,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 00:52:53,299 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:52:53,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:53,300 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:52:53,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:53,300 INFO L82 PathProgramCache]: Analyzing trace with hash -2126491567, now seen corresponding path program 1 times [2018-11-23 00:52:53,300 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:52:53,301 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/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 [2018-11-23 00:52:53,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:52:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:52:54,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:52:54,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:52:54,096 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:52:54,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:52:54,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:52:54,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 00:52:54,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:52:54,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:52:54,113 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 3 states. [2018-11-23 00:52:58,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:52:58,546 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 00:52:58,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:52:58,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 00:52:58,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:52:58,547 INFO L225 Difference]: With dead ends: 27 [2018-11-23 00:52:58,547 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 00:52:58,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:52:58,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 00:52:58,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-23 00:52:58,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 00:52:58,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-23 00:52:58,552 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-11-23 00:52:58,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:52:58,552 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 00:52:58,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 00:52:58,552 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 00:52:58,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 00:52:58,553 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:52:58,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:52:58,553 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:52:58,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:52:58,553 INFO L82 PathProgramCache]: Analyzing trace with hash -351484205, now seen corresponding path program 1 times [2018-11-23 00:52:58,554 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:52:58,554 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/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 [2018-11-23 00:52:58,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:53:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:53:00,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:53:19,027 WARN L180 SmtUtils]: Spent 13.58 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 00:53:44,876 WARN L180 SmtUtils]: Spent 19.27 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-23 00:53:47,236 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) c_main_~oddExp~0) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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_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 [2018-11-23 00:53:49,549 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) c_main_~oddExp~0) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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_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 [2018-11-23 00:54:01,607 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven 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 main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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___VERIFIER_assert_#in~cond| (_ bv0 32))) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (and (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven v_prenex_2 (fp.div roundNearestTiesToEven v_prenex_2 ((_ 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 v_prenex_2 (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_2 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))) (fp.lt v_prenex_2 (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 v_prenex_2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))))) is different from false [2018-11-23 00:54:13,682 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven v_prenex_2 (fp.div roundNearestTiesToEven v_prenex_2 ((_ 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_prenex_2 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_2 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))) (fp.lt v_prenex_2 (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 v_prenex_2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and (= (_ bv0 32) c___VERIFIER_assert_~cond) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven 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 main_~x~0 (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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)))))))) is different from false [2018-11-23 00:54:20,713 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven 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 main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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)))))) is different from false [2018-11-23 00:54:23,034 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven 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 main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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)))))) is different from true [2018-11-23 00:54:23,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:54:23,039 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 00:54:23,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:54:23,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 00:54:23,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 00:54:23,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 00:54:23,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=21, Unknown=7, NotChecked=44, Total=90 [2018-11-23 00:54:23,063 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2018-11-23 00:54:31,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:54:31,513 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 00:54:31,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 00:54:31,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2018-11-23 00:54:31,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:54:31,514 INFO L225 Difference]: With dead ends: 24 [2018-11-23 00:54:31,514 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 00:54:31,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 59.2s TimeCoverageRelationStatistics Valid=22, Invalid=29, Unknown=7, NotChecked=52, Total=110 [2018-11-23 00:54:31,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 00:54:31,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 00:54:31,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 00:54:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 00:54:31,518 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-11-23 00:54:31,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:54:31,518 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 00:54:31,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 00:54:31,519 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 00:54:31,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 00:54:31,519 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:54:31,519 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:54:31,519 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:54:31,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:54:31,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1791799675, now seen corresponding path program 1 times [2018-11-23 00:54:31,520 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:54:31,520 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/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 [2018-11-23 00:54:31,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:54:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:54:33,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:54:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:54:33,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:54:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:54:33,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:54:33,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 00:54:33,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 00:54:33,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 00:54:33,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:54:33,082 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 6 states. [2018-11-23 00:54:45,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:54:45,061 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-11-23 00:54:45,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 00:54:45,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 00:54:45,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:54:45,064 INFO L225 Difference]: With dead ends: 36 [2018-11-23 00:54:45,064 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 00:54:45,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:54:45,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 00:54:45,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-23 00:54:45,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 00:54:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-23 00:54:45,072 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2018-11-23 00:54:45,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:54:45,073 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-23 00:54:45,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 00:54:45,073 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 00:54:45,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 00:54:45,075 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:54:45,075 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:54:45,075 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:54:45,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:54:45,075 INFO L82 PathProgramCache]: Analyzing trace with hash -728160259, now seen corresponding path program 1 times [2018-11-23 00:54:45,076 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:54:45,076 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/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 [2018-11-23 00:54:45,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:55:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:55:03,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:55:22,865 WARN L180 SmtUtils]: Spent 15.08 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 00:55:24,884 WARN L832 $PredicateComparison]: unable to prove that (and (= c_main_~x~0 c_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= (bvadd c_main_~count~0 (_ bv4294967294 32)) (_ bv0 32)) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.lt c_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)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32))) is different from false [2018-11-23 00:55:27,236 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))) (= (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32))))) c_main_~term~0) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) c_main_~oddExp~0))) is different from false [2018-11-23 00:55:29,606 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from false [2018-11-23 00:55:31,977 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from false [2018-11-23 00:55:34,397 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse3 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) c_main_~oddExp~0) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2)))))))) is different from false [2018-11-23 00:55:36,764 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse3 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) c_main_~oddExp~0) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2)))))))) is different from true [2018-11-23 00:55:49,157 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_5 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_5 ((_ 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_prenex_5 ((_ 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_prenex_5 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt v_prenex_5 (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 v_prenex_5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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)))) (let ((.cse5 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven 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 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 main_~x~0 (fp.mul roundNearestTiesToEven .cse4 .cse7)) (fp.mul roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))))))) is different from false [2018-11-23 00:56:01,621 WARN L832 $PredicateComparison]: unable to prove that (or (and (= (_ bv0 32) c___VERIFIER_assert_~cond) (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_5 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_5 ((_ 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_prenex_5 ((_ 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_prenex_5 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt v_prenex_5 (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 v_prenex_5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) (and (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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)))) (let ((.cse5 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven 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 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 main_~x~0 (fp.mul roundNearestTiesToEven .cse4 .cse7)) (fp.mul roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)))) is different from false [2018-11-23 00:56:08,843 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_5 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_5 ((_ 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_prenex_5 ((_ 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_prenex_5 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt v_prenex_5 (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 v_prenex_5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from false [2018-11-23 00:56:11,244 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_5 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_5 ((_ 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_prenex_5 ((_ 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_prenex_5 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt v_prenex_5 (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 v_prenex_5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from true [2018-11-23 00:56:11,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-11-23 00:56:11,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:56:16,118 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-23 00:56:18,211 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-23 00:56:20,289 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-23 00:56:22,366 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-23 00:56:24,502 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-23 00:56:26,632 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-23 00:56:28,850 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-11-23 00:56:31,070 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-11-23 00:56:33,279 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-11-23 00:56:35,489 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-11-23 00:56:37,758 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))))))) is different from false [2018-11-23 00:56:40,014 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))))))) is different from true [2018-11-23 00:56:43,153 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~oddExp~0_14 (_ FloatingPoint 8 24))) (or (not (fp.lt v_main_~oddExp~0_14 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_main_~oddExp~0_14 (fp.div roundNearestTiesToEven v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~oddExp~0_14 ((_ 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_main_~oddExp~0_14 ((_ 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_main_~oddExp~0_14 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))) (not (fp.gt v_main_~oddExp~0_14 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-11-23 00:56:50,391 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_main_~oddExp~0_14 (_ FloatingPoint 8 24))) (or (not (fp.lt v_main_~oddExp~0_14 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_main_~oddExp~0_14 (fp.div roundNearestTiesToEven v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~oddExp~0_14 ((_ 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_main_~oddExp~0_14 ((_ 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_main_~oddExp~0_14 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))) (not (fp.gt v_main_~oddExp~0_14 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-11-23 00:56:52,805 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~oddExp~0_14 (_ FloatingPoint 8 24))) (or (not (fp.lt v_main_~oddExp~0_14 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_main_~oddExp~0_14 (fp.div roundNearestTiesToEven v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~oddExp~0_14 ((_ 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_main_~oddExp~0_14 ((_ 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_main_~oddExp~0_14 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))) (not (fp.gt v_main_~oddExp~0_14 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-11-23 00:56:52,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:56:52,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:56:52,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:57:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-23 00:57:05,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 00:57:05,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-23 00:57:05,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 00:57:05,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 00:57:05,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=48, Unknown=25, NotChecked=432, Total=552 [2018-11-23 00:57:05,964 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 13 states. [2018-11-23 00:57:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:57:18,161 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-23 00:57:18,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 00:57:18,162 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-11-23 00:57:18,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:57:18,163 INFO L225 Difference]: With dead ends: 32 [2018-11-23 00:57:18,163 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 00:57:18,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 82.2s TimeCoverageRelationStatistics Valid=52, Invalid=59, Unknown=25, NotChecked=464, Total=600 [2018-11-23 00:57:18,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 00:57:18,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 00:57:18,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 00:57:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 00:57:18,169 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-11-23 00:57:18,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:57:18,170 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 00:57:18,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 00:57:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 00:57:18,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 00:57:18,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:57:18,171 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:57:18,171 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:57:18,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:57:18,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1901913127, now seen corresponding path program 2 times [2018-11-23 00:57:18,172 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 00:57:18,172 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/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 [2018-11-23 00:57:18,175 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 00:58:03,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 00:58:03,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:58:03,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:58:25,955 WARN L180 SmtUtils]: Spent 16.81 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 00:58:47,503 WARN L180 SmtUtils]: Spent 14.36 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-23 00:58:49,859 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))) (= (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32))))) c_main_~term~0) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) c_main_~oddExp~0))) is different from false [2018-11-23 00:58:52,233 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from false [2018-11-23 00:58:54,606 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from false [2018-11-23 00:58:57,032 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)))))) is different from false [2018-11-23 00:58:59,380 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)))))) is different from true [2018-11-23 00:59:01,832 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse0)) c_main_~oddExp~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.mul roundNearestTiesToEven .cse1 .cse4))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32))))))) is different from false [2018-11-23 00:59:04,273 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse0)) c_main_~oddExp~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.mul roundNearestTiesToEven .cse1 .cse4))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32))))))) is different from false [2018-11-23 00:59:06,918 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven 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 main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (and (= c_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 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) c_main_~oddExp~0) (fp.lt 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))))))))))) is different from false [2018-11-23 00:59:09,484 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven 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 main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (and (= c_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 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) c_main_~oddExp~0) (fp.lt 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))))))))))) is different from true [2018-11-23 00:59:23,232 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_7 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_7 ((_ 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_prenex_7 ((_ 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_prenex_7 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))) (fp.lt v_prenex_7 (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 v_prenex_7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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)))) (let ((.cse7 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse10 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse8 (fp.mul roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse11 (fp.mul roundNearestTiesToEven .cse8 (fp.div roundNearestTiesToEven 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 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 main_~x~0 (fp.mul roundNearestTiesToEven .cse6 .cse10)) (fp.mul roundNearestTiesToEven .cse6 .cse11)) (fp.mul roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse9 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))))))) is different from false [2018-11-23 00:59:36,964 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_7 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_7 ((_ 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_prenex_7 ((_ 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_prenex_7 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))) (fp.lt v_prenex_7 (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 v_prenex_7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= (_ bv0 32) c___VERIFIER_assert_~cond)) (and (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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)))) (let ((.cse7 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse10 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse8 (fp.mul roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse11 (fp.mul roundNearestTiesToEven .cse8 (fp.div roundNearestTiesToEven 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 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 main_~x~0 (fp.mul roundNearestTiesToEven .cse6 .cse10)) (fp.mul roundNearestTiesToEven .cse6 .cse11)) (fp.mul roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse9 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))))))) is different from false [2018-11-23 00:59:44,846 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_7 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_7 ((_ 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_prenex_7 ((_ 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_prenex_7 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))) (fp.lt v_prenex_7 (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 v_prenex_7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from false [2018-11-23 00:59:47,399 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_7 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_7 ((_ 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_prenex_7 ((_ 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_prenex_7 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))) (fp.lt v_prenex_7 (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 v_prenex_7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from true [2018-11-23 00:59:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2018-11-23 00:59:47,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 00:59:56,539 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-23 00:59:58,637 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-23 01:00:00,718 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-23 01:00:02,802 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-23 01:00:04,947 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-23 01:00:07,091 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-23 01:00:09,321 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-11-23 01:00:11,550 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-11-23 01:00:13,769 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-11-23 01:00:15,982 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-11-23 01:00:18,262 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))))))) is different from false [2018-11-23 01:00:20,545 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))))))) is different from true [2018-11-23 01:00:22,911 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_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_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32)))))))))))) is different from false [2018-11-23 01:00:25,275 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_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_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32)))))))))))) is different from true [2018-11-23 01:00:27,634 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_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_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32)))))))))))) is different from false [2018-11-23 01:00:29,995 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_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_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32)))))))))))) is different from true [2018-11-23 01:00:32,414 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_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_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_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32))))))))))))) is different from false [2018-11-23 01:00:34,837 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_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_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_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32))))))))))))) is different from true [2018-11-23 01:00:38,662 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~term~0_34 (_ FloatingPoint 8 24))) (or (not (fp.lt v_main_~term~0_34 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) (not (fp.gt v_main_~term~0_34 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_main_~term~0_34 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ 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_main_~term~0_34 ((_ 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_main_~term~0_34 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))))) is different from true [2018-11-23 01:00:46,551 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_main_~term~0_34 (_ FloatingPoint 8 24))) (or (not (fp.gt v_main_~term~0_34 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_main_~term~0_34 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ 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_main_~term~0_34 ((_ 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_main_~term~0_34 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))) (not (fp.lt v_main_~term~0_34 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))))) is different from false [2018-11-23 01:00:49,083 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~term~0_34 (_ FloatingPoint 8 24))) (or (not (fp.gt v_main_~term~0_34 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_main_~term~0_34 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ 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_main_~term~0_34 ((_ 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_main_~term~0_34 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))) (not (fp.lt v_main_~term~0_34 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))))) is different from true [2018-11-23 01:00:49,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 01:00:49,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 01:00:49,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 01:01:13,514 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 01:01:13,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-11-23 01:01:14,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 01:01:14,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-11-23 01:01:14,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 01:01:14,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 01:01:14,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=58, Unknown=37, NotChecked=714, Total=870 [2018-11-23 01:01:14,387 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 16 states. [2018-11-23 01:01:33,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:01:33,334 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 01:01:33,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 01:01:33,453 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-11-23 01:01:33,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:01:33,454 INFO L225 Difference]: With dead ends: 36 [2018-11-23 01:01:33,454 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 01:01:33,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 135.6s TimeCoverageRelationStatistics Valid=66, Invalid=71, Unknown=37, NotChecked=756, Total=930 [2018-11-23 01:01:33,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 01:01:33,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 01:01:33,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 01:01:33,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-23 01:01:33,460 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 22 [2018-11-23 01:01:33,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:01:33,460 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-23 01:01:33,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 01:01:33,461 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 01:01:33,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 01:01:33,461 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:01:33,462 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:01:33,462 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:01:33,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:01:33,462 INFO L82 PathProgramCache]: Analyzing trace with hash -429521713, now seen corresponding path program 2 times [2018-11-23 01:01:33,462 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 01:01:33,463 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-11-23 01:01:33,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 01:01:36,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 01:01:36,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:01:36,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:01:36,703 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:01:36,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:01:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:01:36,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 01:01:36,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 01:01:36,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 01:01:36,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 01:01:36,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-23 01:01:36,798 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 10 states. [2018-11-23 01:01:57,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:01:57,539 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-11-23 01:01:57,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 01:01:57,540 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-11-23 01:01:57,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:01:57,541 INFO L225 Difference]: With dead ends: 61 [2018-11-23 01:01:57,541 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 01:01:57,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:01:57,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 01:01:57,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2018-11-23 01:01:57,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 01:01:57,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-23 01:01:57,547 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 26 [2018-11-23 01:01:57,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:01:57,548 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-23 01:01:57,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 01:01:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-23 01:01:57,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 01:01:57,548 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:01:57,548 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 01:01:57,548 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:01:57,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:01:57,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1345485649, now seen corresponding path program 3 times [2018-11-23 01:01:57,549 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 01:01:57,549 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f48a50ef-df79-421c-885f-a9fee48131f9/bin-2019/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-11-23 01:01:57,553 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 01:04:04,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 01:04:04,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 01:04:04,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:04:26,748 WARN L180 SmtUtils]: Spent 17.04 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 01:04:53,546 WARN L180 SmtUtils]: Spent 19.44 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-23 01:04:55,916 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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)))) (= (_ bv4 32) c_main_~count~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse0))) (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 c_main_~term~0)) c_main_~oddExp~0))) is different from false [2018-11-23 01:04:59,328 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= c_main_~oddExp~0 (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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)))) (= (_ bv4 32) c_main_~count~0) (= c_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 [2018-11-23 01:05:01,410 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= c_main_~oddExp~0 (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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)))) (= (_ bv4 32) c_main_~count~0) (= c_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 true [2018-11-23 01:05:03,786 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= c_main_~oddExp~0 (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (_ bv4 32) c_main_~count~0) (= c_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 [2018-11-23 01:05:05,971 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= c_main_~oddExp~0 (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (_ bv4 32) c_main_~count~0) (= c_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 true [2018-11-23 01:05:08,339 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)))))) is different from false [2018-11-23 01:05:10,646 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)))))) is different from true [2018-11-23 01:05:13,060 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse0)) c_main_~oddExp~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.mul roundNearestTiesToEven .cse1 .cse4))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32))))))) is different from false [2018-11-23 01:05:15,477 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0)))) (not (= (_ bv0 32) (bvlshr c_main_~count~0 (_ bv1 32)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse0)) c_main_~oddExp~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.mul roundNearestTiesToEven .cse1 .cse4))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32))))))) is different from false [2018-11-23 01:05:18,057 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967293 32)))))) (.cse1 (bvadd c_main_~count~0 (_ bv4294967294 32)))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven .cse1)))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (_ bv8 32) c_main_~count~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (not (= (_ bv0 32) (bvlshr .cse1 (_ bv1 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_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 .cse2 .cse3)) (fp.mul roundNearestTiesToEven .cse2 .cse4)) (fp.mul roundNearestTiesToEven .cse2 .cse0))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse2 .cse5)) (fp.mul roundNearestTiesToEven .cse2 .cse6)) (fp.mul roundNearestTiesToEven .cse2 c_main_~term~0)) c_main_~oddExp~0))))))) is different from false [2018-11-23 01:05:20,629 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967293 32)))))) (.cse1 (bvadd c_main_~count~0 (_ bv4294967294 32)))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven .cse1)))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (_ bv8 32) c_main_~count~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (not (= (_ bv0 32) (bvlshr .cse1 (_ bv1 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_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 .cse2 .cse3)) (fp.mul roundNearestTiesToEven .cse2 .cse4)) (fp.mul roundNearestTiesToEven .cse2 .cse0))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse2 .cse5)) (fp.mul roundNearestTiesToEven .cse2 .cse6)) (fp.mul roundNearestTiesToEven .cse2 c_main_~term~0)) c_main_~oddExp~0))))))) is different from true [2018-11-23 01:05:23,185 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967293 32)))))) (.cse1 (bvadd c_main_~count~0 (_ bv4294967294 32)))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven .cse1))))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse0 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32))))))) (and (= (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= (_ bv8 32) c_main_~count~0) (not (= (_ bv0 32) (bvlshr .cse1 (_ bv1 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_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 .cse2 .cse3)) (fp.mul roundNearestTiesToEven .cse2 .cse4)) (fp.mul roundNearestTiesToEven .cse2 .cse5))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse2 .cse6)) (fp.mul roundNearestTiesToEven .cse2 .cse7)) (fp.mul roundNearestTiesToEven .cse2 .cse0)) c_main_~oddExp~0)))))))) is different from false [2018-11-23 01:05:25,766 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967293 32)))))) (.cse1 (bvadd c_main_~count~0 (_ bv4294967294 32)))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven .cse1))))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse0 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32))))))) (and (= (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= (_ bv8 32) c_main_~count~0) (not (= (_ bv0 32) (bvlshr .cse1 (_ bv1 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_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 .cse2 .cse3)) (fp.mul roundNearestTiesToEven .cse2 .cse4)) (fp.mul roundNearestTiesToEven .cse2 .cse5))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse2 .cse6)) (fp.mul roundNearestTiesToEven .cse2 .cse7)) (fp.mul roundNearestTiesToEven .cse2 .cse0)) c_main_~oddExp~0)))))))) is different from true [2018-11-23 01:05:28,322 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967293 32)))))) (.cse1 (bvadd c_main_~count~0 (_ bv4294967294 32)))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven .cse1))))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse0 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32))))))) (and (= (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= (_ bv8 32) c_main_~count~0) (not (= (_ bv0 32) (bvlshr .cse1 (_ bv1 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= c_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 .cse2 .cse3)) (fp.mul roundNearestTiesToEven .cse2 .cse4)) (fp.mul roundNearestTiesToEven .cse2 .cse5))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse2 .cse6)) (fp.mul roundNearestTiesToEven .cse2 .cse7)) (fp.mul roundNearestTiesToEven .cse2 .cse0)) c_main_~oddExp~0)))))))) is different from false [2018-11-23 01:05:30,853 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967293 32)))))) (.cse1 (bvadd c_main_~count~0 (_ bv4294967294 32)))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven .cse1))))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse0 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32))))))) (and (= (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= (_ bv8 32) c_main_~count~0) (not (= (_ bv0 32) (bvlshr .cse1 (_ bv1 32)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= c_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 .cse2 .cse3)) (fp.mul roundNearestTiesToEven .cse2 .cse4)) (fp.mul roundNearestTiesToEven .cse2 .cse5))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse2 .cse6)) (fp.mul roundNearestTiesToEven .cse2 .cse7)) (fp.mul roundNearestTiesToEven .cse2 .cse0)) c_main_~oddExp~0)))))))) is different from true [2018-11-23 01:05:33,492 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse5 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv8 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv9 32)))))) c_main_~oddExp~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (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 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse6)) (fp.mul roundNearestTiesToEven .cse0 .cse7)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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))))))))))))) is different from false [2018-11-23 01:05:36,102 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse5 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv8 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv9 32)))))) c_main_~oddExp~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (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 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse6)) (fp.mul roundNearestTiesToEven .cse0 .cse7)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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))))))))))))) is different from true [2018-11-23 01:05:49,775 WARN L832 $PredicateComparison]: unable to prove that (or (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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)))) (not (let ((.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv8 32)))))) (fp.geq (fp.add roundNearestTiesToEven (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.mul roundNearestTiesToEven .cse0 .cse4)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse6)) (fp.mul roundNearestTiesToEven .cse0 .cse7)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv9 32)))))))))))))))))) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_11 (_ FloatingPoint 8 24))) (and (fp.gt v_prenex_11 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse9 (fp.mul roundNearestTiesToEven v_prenex_11 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse13 (fp.mul roundNearestTiesToEven .cse9 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse10 (fp.mul roundNearestTiesToEven .cse13 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse14 (fp.mul roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse11 (fp.mul roundNearestTiesToEven .cse14 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (let ((.cse15 (fp.mul roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) (let ((.cse8 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse12 (fp.mul roundNearestTiesToEven .cse15 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv8 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse8 .cse9)) (fp.mul roundNearestTiesToEven .cse8 .cse10)) (fp.mul roundNearestTiesToEven .cse8 .cse11)) (fp.mul roundNearestTiesToEven .cse8 .cse12)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_11 (fp.mul roundNearestTiesToEven .cse8 .cse13)) (fp.mul roundNearestTiesToEven .cse8 .cse14)) (fp.mul roundNearestTiesToEven .cse8 .cse15)) (fp.mul roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven .cse12 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv9 32)))))))))))))) (fp.lt v_prenex_11 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))))))) is different from false [2018-11-23 01:06:03,446 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_11 (_ FloatingPoint 8 24))) (and (fp.gt v_prenex_11 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_11 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv8 32)))))) (fp.geq (fp.add roundNearestTiesToEven (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.mul roundNearestTiesToEven .cse0 .cse4)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_11 (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse6)) (fp.mul roundNearestTiesToEven .cse0 .cse7)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv9 32)))))))))))))) (fp.lt v_prenex_11 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and (= (_ bv0 32) c___VERIFIER_assert_~cond) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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)))) (not (let ((.cse9 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse13 (fp.mul roundNearestTiesToEven .cse9 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse10 (fp.mul roundNearestTiesToEven .cse13 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse14 (fp.mul roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse11 (fp.mul roundNearestTiesToEven .cse14 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (let ((.cse15 (fp.mul roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) (let ((.cse8 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse12 (fp.mul roundNearestTiesToEven .cse15 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv8 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse8 .cse9)) (fp.mul roundNearestTiesToEven .cse8 .cse10)) (fp.mul roundNearestTiesToEven .cse8 .cse11)) (fp.mul roundNearestTiesToEven .cse8 .cse12)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse8 .cse13)) (fp.mul roundNearestTiesToEven .cse8 .cse14)) (fp.mul roundNearestTiesToEven .cse8 .cse15)) (fp.mul roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven .cse12 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv9 32))))))))))))))))))) is different from false [2018-11-23 01:06:11,429 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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)))) (not (let ((.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv8 32)))))) (fp.geq (fp.add roundNearestTiesToEven (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.mul roundNearestTiesToEven .cse0 .cse4)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse6)) (fp.mul roundNearestTiesToEven .cse0 .cse7)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv9 32))))))))))))))))) is different from false [2018-11-23 01:06:14,043 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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)))) (not (let ((.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv8 32)))))) (fp.geq (fp.add roundNearestTiesToEven (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.mul roundNearestTiesToEven .cse0 .cse4)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse6)) (fp.mul roundNearestTiesToEven .cse0 .cse7)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv9 32))))))))))))))))) is different from true [2018-11-23 01:06:14,058 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 24 not checked. [2018-11-23 01:06:14,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 01:06:23,344 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-23 01:06:25,451 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-23 01:06:27,541 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-23 01:06:29,631 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-23 01:06:31,788 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-23 01:06:33,947 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-23 01:06:36,200 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-11-23 01:06:38,455 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-11-23 01:06:40,691 WARN L832 $PredicateComparison]: unable to prove that (or (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) (= (_ bv0 32) (bvlshr c_main_~count~0 (_ bv1 32)))) is different from false [2018-11-23 01:06:42,926 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) (= (_ bv0 32) (bvlshr c_main_~count~0 (_ bv1 32)))) is different from true [2018-11-23 01:06:45,236 WARN L832 $PredicateComparison]: unable to prove that (or (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))))))) (= (_ bv0 32) (bvlshr c_main_~count~0 (_ bv1 32)))) is different from false [2018-11-23 01:06:47,540 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))))))) (= (_ bv0 32) (bvlshr c_main_~count~0 (_ bv1 32)))) is different from true [2018-11-23 01:06:49,926 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_main_~count~0 (_ bv2 32)))) (or (= (bvlshr .cse0 (_ bv1 32)) (_ bv0 32)) (let ((.cse5 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven .cse0))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse1 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse2 .cse3)) (fp.mul roundNearestTiesToEven .cse2 .cse4)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse2 .cse6)) (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32)))))))))))))) is different from false [2018-11-23 01:06:52,326 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_main_~count~0 (_ bv2 32)))) (or (= (bvlshr .cse0 (_ bv1 32)) (_ bv0 32)) (let ((.cse5 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven .cse0))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse1 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse2 .cse3)) (fp.mul roundNearestTiesToEven .cse2 .cse4)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse2 .cse6)) (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32)))))))))))))) is different from true [2018-11-23 01:06:54,707 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd c_main_~count~0 (_ bv2 32)))) (or (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven .cse5))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_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_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32)))))))))))) (= (bvlshr .cse5 (_ bv1 32)) (_ bv0 32)))) is different from false [2018-11-23 01:06:57,083 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd c_main_~count~0 (_ bv2 32)))) (or (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven .cse5))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_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_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32)))))))))))) (= (bvlshr .cse5 (_ bv1 32)) (_ bv0 32)))) is different from true [2018-11-23 01:06:57,803 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-23 01:06:58,004 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2018-11-23 01:06:58,004 FATAL L265 ToolchainWalker]: 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:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:823) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-11-23 01:06:58,006 INFO L168 Benchmark]: Toolchain (without parser) took 849679.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -134.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:06:58,007 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:06:58,007 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.92 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 01:06:58,008 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.87 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:06:58,008 INFO L168 Benchmark]: Boogie Preprocessor took 22.67 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:06:58,008 INFO L168 Benchmark]: RCFGBuilder took 4453.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2018-11-23 01:06:58,009 INFO L168 Benchmark]: TraceAbstraction took 844958.30 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -5.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.6 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:06:58,011 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 222.92 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.87 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.67 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 4453.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -161.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 844958.30 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -5.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.6 MB). Peak memory consumption was 6.4 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...