./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan --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 Taipan --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_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan --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 Taipan --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-635dfa2 [2018-12-02 14:55:59,641 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:55:59,642 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:55:59,649 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:55:59,650 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:55:59,650 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:55:59,651 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:55:59,651 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:55:59,652 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:55:59,653 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:55:59,653 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:55:59,653 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:55:59,654 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:55:59,654 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:55:59,655 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:55:59,655 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:55:59,655 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:55:59,656 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:55:59,657 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:55:59,658 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:55:59,658 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:55:59,659 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:55:59,661 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:55:59,661 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:55:59,661 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:55:59,662 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:55:59,662 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:55:59,663 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:55:59,663 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:55:59,663 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:55:59,664 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:55:59,664 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:55:59,664 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:55:59,664 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:55:59,665 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:55:59,665 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:55:59,665 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 14:55:59,672 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:55:59,672 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:55:59,673 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 14:55:59,673 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 14:55:59,673 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 14:55:59,673 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 14:55:59,674 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 14:55:59,674 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 14:55:59,674 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 14:55:59,674 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 14:55:59,674 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 14:55:59,674 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 14:55:59,675 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 14:55:59,675 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:55:59,675 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 14:55:59,675 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:55:59,676 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 14:55:59,676 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:55:59,676 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 14:55:59,676 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 14:55:59,676 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 14:55:59,676 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 14:55:59,676 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 14:55:59,677 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 14:55:59,677 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:55:59,677 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:55:59,677 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 14:55:59,677 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 14:55:59,677 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:55:59,678 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:55:59,678 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 14:55:59,678 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 14:55:59,678 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 14:55:59,678 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 14:55:59,678 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 14:55:59,678 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 14:55:59,679 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan 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 -> Taipan 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-12-02 14:55:59,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:55:59,708 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:55:59,710 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:55:59,711 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:55:59,711 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:55:59,711 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-12-02 14:55:59,752 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/data/b6df365c9/0b6dde48e79948dfbdf53ddc4ea97639/FLAG267726770 [2018-12-02 14:56:00,042 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:56:00,042 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-12-02 14:56:00,046 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/data/b6df365c9/0b6dde48e79948dfbdf53ddc4ea97639/FLAG267726770 [2018-12-02 14:56:00,484 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/data/b6df365c9/0b6dde48e79948dfbdf53ddc4ea97639 [2018-12-02 14:56:00,487 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:56:00,488 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:56:00,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:56:00,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:56:00,492 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:56:00,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:56:00" (1/1) ... [2018-12-02 14:56:00,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@707ef703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:00, skipping insertion in model container [2018-12-02 14:56:00,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:56:00" (1/1) ... [2018-12-02 14:56:00,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:56:00,513 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:56:00,603 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:56:00,605 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:56:00,616 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:56:00,624 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:56:00,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:00 WrapperNode [2018-12-02 14:56:00,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:56:00,624 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:56:00,624 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:56:00,624 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:56:00,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:00" (1/1) ... [2018-12-02 14:56:00,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:00" (1/1) ... [2018-12-02 14:56:00,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:56:00,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:56:00,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:56:00,637 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:56:00,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:00" (1/1) ... [2018-12-02 14:56:00,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:00" (1/1) ... [2018-12-02 14:56:00,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:00" (1/1) ... [2018-12-02 14:56:00,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:00" (1/1) ... [2018-12-02 14:56:00,645 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:00" (1/1) ... [2018-12-02 14:56:00,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:00" (1/1) ... [2018-12-02 14:56:00,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:00" (1/1) ... [2018-12-02 14:56:00,650 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:56:00,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:56:00,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:56:00,650 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:56:00,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/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-12-02 14:56:00,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 14:56:00,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 14:56:00,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:56:00,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:56:00,712 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 14:56:00,712 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 14:56:00,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 14:56:00,712 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 14:56:00,801 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:56:00,801 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 14:56:00,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:56:00 BoogieIcfgContainer [2018-12-02 14:56:00,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:56:00,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 14:56:00,802 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 14:56:00,804 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 14:56:00,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:56:00" (1/3) ... [2018-12-02 14:56:00,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77799fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:56:00, skipping insertion in model container [2018-12-02 14:56:00,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:00" (2/3) ... [2018-12-02 14:56:00,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77799fea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:56:00, skipping insertion in model container [2018-12-02 14:56:00,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:56:00" (3/3) ... [2018-12-02 14:56:00,806 INFO L112 eAbstractionObserver]: Analyzing ICFG loop3_true-unreach-call.c.i [2018-12-02 14:56:00,812 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 14:56:00,816 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 14:56:00,826 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 14:56:00,845 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 14:56:00,845 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 14:56:00,845 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 14:56:00,845 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:56:00,845 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:56:00,845 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 14:56:00,845 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:56:00,845 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 14:56:00,855 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-12-02 14:56:00,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 14:56:00,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:56:00,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:56:00,860 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:56:00,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:56:00,863 INFO L82 PathProgramCache]: Analyzing trace with hash 23164375, now seen corresponding path program 1 times [2018-12-02 14:56:00,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:56:00,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:56:00,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:56:00,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:56:00,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:56:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:56:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:56:00,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:56:00,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 14:56:00,933 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:56:00,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 14:56:00,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 14:56:00,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 14:56:00,944 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-12-02 14:56:00,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:56:00,955 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-12-02 14:56:00,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 14:56:00,956 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-12-02 14:56:00,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:56:00,960 INFO L225 Difference]: With dead ends: 34 [2018-12-02 14:56:00,961 INFO L226 Difference]: Without dead ends: 15 [2018-12-02 14:56:00,962 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-12-02 14:56:00,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-02 14:56:00,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-02 14:56:00,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-02 14:56:00,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-02 14:56:00,983 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2018-12-02 14:56:00,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:56:00,983 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-02 14:56:00,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 14:56:00,983 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-02 14:56:00,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 14:56:00,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:56:00,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:56:00,984 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:56:00,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:56:00,984 INFO L82 PathProgramCache]: Analyzing trace with hash -2126491567, now seen corresponding path program 1 times [2018-12-02 14:56:00,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:56:00,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:56:00,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:56:00,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:56:00,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:56:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:56:01,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:56:01,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:56:01,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:56:01,039 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:56:01,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:56:01,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:56:01,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:56:01,040 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 3 states. [2018-12-02 14:56:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:56:01,052 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-12-02 14:56:01,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:56:01,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-02 14:56:01,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:56:01,053 INFO L225 Difference]: With dead ends: 27 [2018-12-02 14:56:01,053 INFO L226 Difference]: Without dead ends: 18 [2018-12-02 14:56:01,054 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-12-02 14:56:01,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-02 14:56:01,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-12-02 14:56:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-02 14:56:01,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-02 14:56:01,056 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-12-02 14:56:01,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:56:01,057 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-02 14:56:01,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:56:01,057 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-12-02 14:56:01,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 14:56:01,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:56:01,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:56:01,057 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:56:01,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:56:01,058 INFO L82 PathProgramCache]: Analyzing trace with hash -351484205, now seen corresponding path program 1 times [2018-12-02 14:56:01,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:56:01,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:56:01,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:56:01,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:56:01,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:56:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:56:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:56:01,081 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 14:56:01,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:56:01 BoogieIcfgContainer [2018-12-02 14:56:01,095 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 14:56:01,096 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 14:56:01,096 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 14:56:01,096 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 14:56:01,096 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:56:00" (3/4) ... [2018-12-02 14:56:01,098 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 14:56:01,098 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 14:56:01,099 INFO L168 Benchmark]: Toolchain (without parser) took 611.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -125.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. [2018-12-02 14:56:01,100 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:56:01,100 INFO L168 Benchmark]: CACSL2BoogieTranslator took 135.42 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:56:01,101 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.05 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:56:01,101 INFO L168 Benchmark]: Boogie Preprocessor took 13.35 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 936.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:56:01,102 INFO L168 Benchmark]: RCFGBuilder took 151.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2018-12-02 14:56:01,102 INFO L168 Benchmark]: TraceAbstraction took 293.38 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: 36.5 MB). Peak memory consumption was 36.5 MB. Max. memory is 11.5 GB. [2018-12-02 14:56:01,103 INFO L168 Benchmark]: Witness Printer took 2.78 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: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-12-02 14:56:01,106 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 135.42 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.05 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.35 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 936.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 151.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -178.5 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 293.38 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: 36.5 MB). Peak memory consumption was 36.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.78 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: 3.3 MB). Peak memory consumption was 3.3 MB. 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 41, 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.2s 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-635dfa2 [2018-12-02 14:56:02,489 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:56:02,490 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:56:02,497 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:56:02,497 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:56:02,497 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:56:02,498 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:56:02,499 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:56:02,499 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:56:02,500 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:56:02,500 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:56:02,500 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:56:02,501 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:56:02,501 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:56:02,502 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:56:02,502 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:56:02,503 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:56:02,503 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:56:02,504 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:56:02,505 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:56:02,505 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:56:02,506 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:56:02,507 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:56:02,507 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:56:02,507 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:56:02,508 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:56:02,508 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:56:02,509 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:56:02,509 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:56:02,509 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:56:02,510 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:56:02,510 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:56:02,510 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:56:02,510 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:56:02,511 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:56:02,511 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:56:02,511 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-02 14:56:02,518 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:56:02,518 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:56:02,519 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 14:56:02,519 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 14:56:02,519 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 14:56:02,519 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 14:56:02,519 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 14:56:02,519 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 14:56:02,519 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 14:56:02,519 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 14:56:02,520 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:56:02,520 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 14:56:02,520 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 14:56:02,520 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:56:02,520 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 14:56:02,520 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 14:56:02,520 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 14:56:02,521 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 14:56:02,521 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 14:56:02,521 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 14:56:02,521 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 14:56:02,521 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 14:56:02,521 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 14:56:02,521 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:56:02,521 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:56:02,522 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 14:56:02,522 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 14:56:02,522 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:56:02,522 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:56:02,522 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 14:56:02,522 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 14:56:02,522 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 14:56:02,522 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 14:56:02,522 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 14:56:02,523 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-02 14:56:02,523 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_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan 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 -> Taipan 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-12-02 14:56:02,542 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:56:02,552 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:56:02,554 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:56:02,555 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:56:02,556 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:56:02,556 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-12-02 14:56:02,601 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/data/4505b2522/2b79f0055f1b43e9b0182bf9dacb86c8/FLAGdfdf83561 [2018-12-02 14:56:02,937 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:56:02,937 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-12-02 14:56:02,942 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/data/4505b2522/2b79f0055f1b43e9b0182bf9dacb86c8/FLAGdfdf83561 [2018-12-02 14:56:03,347 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/data/4505b2522/2b79f0055f1b43e9b0182bf9dacb86c8 [2018-12-02 14:56:03,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:56:03,355 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:56:03,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:56:03,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:56:03,363 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:56:03,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:56:03" (1/1) ... [2018-12-02 14:56:03,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fe18e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:03, skipping insertion in model container [2018-12-02 14:56:03,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:56:03" (1/1) ... [2018-12-02 14:56:03,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:56:03,388 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:56:03,484 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:56:03,488 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:56:03,500 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:56:03,513 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:56:03,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:03 WrapperNode [2018-12-02 14:56:03,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:56:03,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:56:03,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:56:03,514 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:56:03,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:03" (1/1) ... [2018-12-02 14:56:03,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:03" (1/1) ... [2018-12-02 14:56:03,528 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:56:03,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:56:03,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:56:03,529 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:56:03,534 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:03" (1/1) ... [2018-12-02 14:56:03,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:03" (1/1) ... [2018-12-02 14:56:03,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:03" (1/1) ... [2018-12-02 14:56:03,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:03" (1/1) ... [2018-12-02 14:56:03,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:03" (1/1) ... [2018-12-02 14:56:03,542 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:03" (1/1) ... [2018-12-02 14:56:03,543 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:03" (1/1) ... [2018-12-02 14:56:03,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:56:03,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:56:03,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:56:03,545 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:56:03,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/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-12-02 14:56:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 14:56:03,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 14:56:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:56:03,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:56:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 14:56:03,606 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 14:56:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 14:56:03,606 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 14:56:06,699 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:56:06,699 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 14:56:06,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:56:06 BoogieIcfgContainer [2018-12-02 14:56:06,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:56:06,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 14:56:06,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 14:56:06,702 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 14:56:06,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:56:03" (1/3) ... [2018-12-02 14:56:06,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8275da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:56:06, skipping insertion in model container [2018-12-02 14:56:06,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:03" (2/3) ... [2018-12-02 14:56:06,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d8275da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:56:06, skipping insertion in model container [2018-12-02 14:56:06,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:56:06" (3/3) ... [2018-12-02 14:56:06,705 INFO L112 eAbstractionObserver]: Analyzing ICFG loop3_true-unreach-call.c.i [2018-12-02 14:56:06,711 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 14:56:06,717 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 14:56:06,727 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 14:56:06,743 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 14:56:06,744 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 14:56:06,744 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 14:56:06,744 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 14:56:06,744 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:56:06,744 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:56:06,744 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 14:56:06,744 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:56:06,744 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 14:56:06,753 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-12-02 14:56:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 14:56:06,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:56:06,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:56:06,758 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:56:06,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:56:06,761 INFO L82 PathProgramCache]: Analyzing trace with hash 23164375, now seen corresponding path program 1 times [2018-12-02 14:56:06,764 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 14:56:06,764 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/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-12-02 14:56:06,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:56:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:56:06,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:56:06,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:56:06,819 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 14:56:06,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:56:06,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 14:56:06,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 14:56:06,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 14:56:06,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 14:56:06,840 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-12-02 14:56:06,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:56:06,851 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-12-02 14:56:06,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 14:56:06,852 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-12-02 14:56:06,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:56:06,857 INFO L225 Difference]: With dead ends: 34 [2018-12-02 14:56:06,857 INFO L226 Difference]: Without dead ends: 15 [2018-12-02 14:56:06,858 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-12-02 14:56:06,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-02 14:56:06,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-02 14:56:06,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-02 14:56:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-02 14:56:06,878 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2018-12-02 14:56:06,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:56:06,879 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-02 14:56:06,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 14:56:06,879 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-02 14:56:06,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 14:56:06,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:56:06,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:56:06,879 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:56:06,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:56:06,880 INFO L82 PathProgramCache]: Analyzing trace with hash -2126491567, now seen corresponding path program 1 times [2018-12-02 14:56:06,880 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 14:56:06,880 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/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-12-02 14:56:06,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:56:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:56:07,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:56:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:56:07,523 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 14:56:07,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:56:07,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:56:07,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:56:07,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:56:07,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:56:07,539 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 3 states. [2018-12-02 14:56:11,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:56:11,100 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-12-02 14:56:11,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:56:11,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-02 14:56:11,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:56:11,101 INFO L225 Difference]: With dead ends: 27 [2018-12-02 14:56:11,101 INFO L226 Difference]: Without dead ends: 18 [2018-12-02 14:56:11,102 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-12-02 14:56:11,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-02 14:56:11,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-12-02 14:56:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-02 14:56:11,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-02 14:56:11,105 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-12-02 14:56:11,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:56:11,105 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-02 14:56:11,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:56:11,106 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-12-02 14:56:11,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 14:56:11,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:56:11,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:56:11,106 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:56:11,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:56:11,106 INFO L82 PathProgramCache]: Analyzing trace with hash -351484205, now seen corresponding path program 1 times [2018-12-02 14:56:11,107 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 14:56:11,107 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/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-12-02 14:56:11,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:56:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:56:12,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:56:27,201 WARN L180 SmtUtils]: Spent 9.72 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-02 14:56:46,324 WARN L180 SmtUtils]: Spent 13.84 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-02 14:56:48,609 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-12-02 14:56:50,861 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-12-02 14:57:02,533 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-12-02 14:57:14,240 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-12-02 14:57:21,094 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-12-02 14:57:23,352 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-12-02 14:57:23,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:57:23,356 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 14:57:23,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:57:23,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 14:57:23,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 14:57:23,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 14:57:23,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=21, Unknown=7, NotChecked=44, Total=90 [2018-12-02 14:57:23,373 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2018-12-02 14:57:32,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:57:32,362 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-12-02 14:57:32,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 14:57:32,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2018-12-02 14:57:32,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:57:32,363 INFO L225 Difference]: With dead ends: 24 [2018-12-02 14:57:32,364 INFO L226 Difference]: Without dead ends: 19 [2018-12-02 14:57:32,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 48.7s TimeCoverageRelationStatistics Valid=22, Invalid=29, Unknown=7, NotChecked=52, Total=110 [2018-12-02 14:57:32,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-02 14:57:32,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-02 14:57:32,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 14:57:32,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-02 14:57:32,367 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-12-02 14:57:32,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:57:32,367 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-02 14:57:32,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 14:57:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-02 14:57:32,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 14:57:32,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:57:32,368 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:57:32,368 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:57:32,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:32,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1791799675, now seen corresponding path program 1 times [2018-12-02 14:57:32,369 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 14:57:32,369 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/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-12-02 14:57:32,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:33,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:57:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:57:33,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:57:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:57:33,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:57:33,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:57:33,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:57:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:57:34,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:57:34,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:57:34,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:57:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:57:34,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 14:57:34,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4] total 6 [2018-12-02 14:57:34,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:57:34,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:57:34,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:57:34,685 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 6 states. [2018-12-02 14:57:43,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:57:43,158 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-12-02 14:57:43,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:57:43,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-02 14:57:43,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:57:43,160 INFO L225 Difference]: With dead ends: 36 [2018-12-02 14:57:43,160 INFO L226 Difference]: Without dead ends: 27 [2018-12-02 14:57:43,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:57:43,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-02 14:57:43,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-12-02 14:57:43,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 14:57:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-12-02 14:57:43,164 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2018-12-02 14:57:43,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:57:43,165 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-12-02 14:57:43,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:57:43,165 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-12-02 14:57:43,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 14:57:43,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:57:43,165 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:57:43,165 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:57:43,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:57:43,166 INFO L82 PathProgramCache]: Analyzing trace with hash -728160259, now seen corresponding path program 1 times [2018-12-02 14:57:43,166 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 14:57:43,166 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-12-02 14:57:43,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:58:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:58:04,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:58:19,639 WARN L180 SmtUtils]: Spent 10.11 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-02 14:58:40,320 WARN L180 SmtUtils]: Spent 14.15 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-02 14:58:42,651 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-12-02 14:58:44,918 WARN L854 $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 true [2018-12-02 14:58:47,266 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-12-02 14:58:49,380 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-12-02 14:58:51,722 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-12-02 14:58:54,074 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-12-02 14:58:56,418 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-12-02 14:58:58,727 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-12-02 14:59:10,760 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-12-02 14:59:22,765 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-12-02 14:59:29,798 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-12-02 14:59:32,118 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-12-02 14:59:32,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-12-02 14:59:32,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:59:41,172 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-12-02 14:59:43,262 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-12-02 14:59:45,341 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-12-02 14:59:47,418 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-12-02 14:59:49,546 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-12-02 14:59:51,680 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-12-02 14:59:53,894 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-12-02 14:59:56,104 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-12-02 14:59:58,314 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-12-02 15:00:00,517 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-12-02 15:00:02,777 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-12-02 15:00:05,054 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-12-02 15:00:08,029 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~term~0_26 (_ FloatingPoint 8 24))) (or (let ((.cse1 (fp.mul roundNearestTiesToEven v_main_~term~0_26 (fp.div roundNearestTiesToEven v_main_~term~0_26 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~term~0_26 ((_ 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_~term~0_26 ((_ 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_~term~0_26 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~term~0_26 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))) (not (fp.lt v_main_~term~0_26 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) (not (fp.gt v_main_~term~0_26 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-12-02 15:00:15,055 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_main_~term~0_26 (_ FloatingPoint 8 24))) (or (not (fp.lt v_main_~term~0_26 (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_~term~0_26 (fp.div roundNearestTiesToEven v_main_~term~0_26 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~term~0_26 ((_ 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_~term~0_26 ((_ 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_~term~0_26 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~term~0_26 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))) (not (fp.gt v_main_~term~0_26 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-12-02 15:00:17,391 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~term~0_26 (_ FloatingPoint 8 24))) (or (not (fp.lt v_main_~term~0_26 (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_~term~0_26 (fp.div roundNearestTiesToEven v_main_~term~0_26 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~term~0_26 ((_ 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_~term~0_26 ((_ 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_~term~0_26 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~term~0_26 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))) (not (fp.gt v_main_~term~0_26 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-12-02 15:00:17,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:00:17,416 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:00:17,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:00:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-12-02 15:00:30,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-02 15:00:30,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-12-02 15:00:30,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 15:00:30,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 15:00:30,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=54, Unknown=29, NotChecked=420, Total=552 [2018-12-02 15:00:30,417 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 13 states. [2018-12-02 15:00:59,389 WARN L180 SmtUtils]: Spent 16.60 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-02 15:01:23,511 WARN L180 SmtUtils]: Spent 17.71 s on a formula simplification that was a NOOP. DAG size: 35 [2018-12-02 15:01:34,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:01:34,024 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-12-02 15:01:34,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 15:01:34,025 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-12-02 15:01:34,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:01:34,025 INFO L225 Difference]: With dead ends: 32 [2018-12-02 15:01:34,025 INFO L226 Difference]: Without dead ends: 27 [2018-12-02 15:01:34,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 152.6s TimeCoverageRelationStatistics Valid=66, Invalid=97, Unknown=29, NotChecked=510, Total=702 [2018-12-02 15:01:34,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-02 15:01:34,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-02 15:01:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 15:01:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-12-02 15:01:34,030 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-12-02 15:01:34,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:01:34,030 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-12-02 15:01:34,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 15:01:34,030 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-12-02 15:01:34,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 15:01:34,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:01:34,031 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:01:34,031 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:01:34,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:01:34,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1901913127, now seen corresponding path program 2 times [2018-12-02 15:01:34,032 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 15:01:34,032 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-12-02 15:01:34,038 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 15:02:49,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 15:02:49,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:02:49,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:02:51,529 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))))) is different from false [2018-12-02 15:03:09,081 WARN L180 SmtUtils]: Spent 13.14 s on a formula simplification that was a NOOP. DAG size: 33 [2018-12-02 15:03:11,367 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 (_ bv2 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 (_ bv3 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 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse0))) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 c_main_~term~0)) c_main_~oddExp~0))) is different from false [2018-12-02 15:03:13,656 WARN L854 $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 (_ bv2 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 (_ bv3 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 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse0))) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 c_main_~term~0)) c_main_~oddExp~0))) is different from true [2018-12-02 15:03:15,952 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 (_ bv3 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-12-02 15:03:18,297 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 (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 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 true [2018-12-02 15:03:20,596 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 (_ bv3 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-12-02 15:03:23,006 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 (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 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 true [2018-12-02 15:03:25,419 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)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (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 .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (and (= 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 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) c_main_~oddExp~0) (= (_ bv6 32) c_main_~count~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)))))))) is different from false [2018-12-02 15:03:27,853 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)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32))))))) (and (= 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 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (_ bv6 32) c_main_~count~0) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) c_main_~oddExp~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~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))))))))) is different from false [2018-12-02 15:03:30,295 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)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32))))))) (and (= 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 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (_ bv6 32) c_main_~count~0) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) c_main_~oddExp~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~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-12-02 15:03:32,850 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-12-02 15:03:35,333 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-12-02 15:03:48,544 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-12-02 15:04:01,746 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-12-02 15:04:09,372 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-12-02 15:04:11,836 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-12-02 15:04:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2018-12-02 15:04:11,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:04:16,677 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-12-02 15:04:18,773 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-12-02 15:04:20,857 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-12-02 15:04:22,936 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-12-02 15:04:25,072 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-12-02 15:04:27,212 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-12-02 15:04:29,437 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-12-02 15:04:31,659 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-12-02 15:04:33,868 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-12-02 15:04:36,083 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-12-02 15:04:38,354 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-12-02 15:04:40,621 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-12-02 15:04:42,964 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-12-02 15:04:45,310 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-12-02 15:04:47,647 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-12-02 15:04:49,982 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-12-02 15:04:52,379 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-12-02 15:04:54,766 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-12-02 15:04:58,259 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~oddExp~0_24 (_ FloatingPoint 8 24))) (or (not (fp.lt v_main_~oddExp~0_24 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) (not (fp.gt v_main_~oddExp~0_24 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_main_~oddExp~0_24 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ 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_~oddExp~0_24 ((_ 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_~oddExp~0_24 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))))) is different from true [2018-12-02 15:05:05,780 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_main_~oddExp~0_24 (_ FloatingPoint 8 24))) (or (not (fp.lt v_main_~oddExp~0_24 (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 (fp.gt v_main_~oddExp~0_24 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_main_~oddExp~0_24 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ 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_~oddExp~0_24 ((_ 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_~oddExp~0_24 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))))) is different from false [2018-12-02 15:05:08,296 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~oddExp~0_24 (_ FloatingPoint 8 24))) (or (not (fp.lt v_main_~oddExp~0_24 (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 (fp.gt v_main_~oddExp~0_24 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_main_~oddExp~0_24 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ 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_~oddExp~0_24 ((_ 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_~oddExp~0_24 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_main_~oddExp~0_24 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))))) is different from true [2018-12-02 15:05:08,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:05:08,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:05:08,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 15:05:32,707 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 15:05:32,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-12-02 15:05:33,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-12-02 15:05:33,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-12-02 15:05:33,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-02 15:05:33,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 15:05:33,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=48, Unknown=37, NotChecked=726, Total=870 [2018-12-02 15:05:33,206 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 16 states. [2018-12-02 15:05:40,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:05:40,451 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-12-02 15:05:40,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 15:05:40,452 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2018-12-02 15:05:40,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:05:40,452 INFO L225 Difference]: With dead ends: 36 [2018-12-02 15:05:40,452 INFO L226 Difference]: Without dead ends: 31 [2018-12-02 15:05:40,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 108.4s TimeCoverageRelationStatistics Valid=64, Invalid=59, Unknown=37, NotChecked=770, Total=930 [2018-12-02 15:05:40,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-02 15:05:40,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-02 15:05:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-02 15:05:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-12-02 15:05:40,458 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 22 [2018-12-02 15:05:40,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:05:40,458 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-12-02 15:05:40,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-02 15:05:40,458 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-12-02 15:05:40,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 15:05:40,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:05:40,459 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:05:40,459 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:05:40,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:05:40,459 INFO L82 PathProgramCache]: Analyzing trace with hash -429521713, now seen corresponding path program 2 times [2018-12-02 15:05:40,460 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 15:05:40,460 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/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-12-02 15:05:40,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 15:05:42,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 15:05:42,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:05:43,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:05:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:05:43,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:05:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:05:43,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:05:43,158 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:05:43,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 15:05:56,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 15:05:56,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:05:57,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:05:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:05:57,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:05:57,040 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:05:57,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 15:05:57,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 10 [2018-12-02 15:05:57,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 15:05:57,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 15:05:57,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-12-02 15:05:57,189 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 10 states. [2018-12-02 15:06:16,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:06:16,642 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2018-12-02 15:06:16,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 15:06:16,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-12-02 15:06:16,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:06:16,643 INFO L225 Difference]: With dead ends: 61 [2018-12-02 15:06:16,643 INFO L226 Difference]: Without dead ends: 48 [2018-12-02 15:06:16,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-12-02 15:06:16,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-02 15:06:16,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2018-12-02 15:06:16,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 15:06:16,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-12-02 15:06:16,648 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 26 [2018-12-02 15:06:16,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:06:16,649 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-12-02 15:06:16,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 15:06:16,649 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-12-02 15:06:16,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 15:06:16,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:06:16,649 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:06:16,650 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 15:06:16,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:06:16,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1345485649, now seen corresponding path program 3 times [2018-12-02 15:06:16,650 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 15:06:16,650 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b19d2652-78e9-46ef-831e-9c744e686781/bin-2019/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-12-02 15:06:16,653 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-02 15:09:00,042 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 15:09:00,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:09:00,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:09:20,606 WARN L180 SmtUtils]: Spent 15.24 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-02 15:09:22,625 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-12-02 15:09:24,915 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 (_ bv2 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 (_ bv3 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 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse0))) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 c_main_~term~0)) c_main_~oddExp~0))) is different from false [2018-12-02 15:09:28,819 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 (_ bv3 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-12-02 15:09:31,321 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 (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 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 true [2018-12-02 15:09:33,617 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 (_ bv3 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-12-02 15:09:38,004 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 (_ bv5 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-12-02 15:09:40,298 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 (_ bv5 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-12-02 15:09:42,670 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 ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 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 (_ bv5 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) 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 .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0)))))) is different from false [2018-12-02 15:09:45,114 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 ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 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 (_ bv5 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) 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 .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0)))))) is different from true [2018-12-02 15:09:47,479 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 ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 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 (_ bv5 32)))))) (and (not (= (_ bv0 32) (bvlshr c_main_~count~0 (_ bv1 32)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) 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 .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0)))))) is different from false [2018-12-02 15:09:49,870 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 ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 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 (_ bv5 32)))))) (and (not (= (_ bv0 32) (bvlshr c_main_~count~0 (_ bv1 32)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) 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 .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0)))))) is different from true [2018-12-02 15:09:52,419 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))) (.cse0 (bvadd c_main_~count~0 (_ bv4294967294 32)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven .cse0))))) (and (= (_ bv8 32) c_main_~count~0) (not (= (_ bv0 32) (bvlshr .cse0 (_ bv1 32)))) (= (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) (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)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse2 .cse3)) (fp.mul roundNearestTiesToEven .cse2 .cse4)) (fp.mul roundNearestTiesToEven .cse2 c_main_~term~0)) c_main_~oddExp~0) (= 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 .cse5)) (fp.mul roundNearestTiesToEven .cse2 .cse6)) (fp.mul roundNearestTiesToEven .cse2 .cse1))))))))) is different from false [2018-12-02 15:09:54,708 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))) (.cse0 (bvadd c_main_~count~0 (_ bv4294967294 32)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven .cse0))))) (and (= (_ bv8 32) c_main_~count~0) (not (= (_ bv0 32) (bvlshr .cse0 (_ bv1 32)))) (= (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) (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)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse2 .cse3)) (fp.mul roundNearestTiesToEven .cse2 .cse4)) (fp.mul roundNearestTiesToEven .cse2 c_main_~term~0)) c_main_~oddExp~0) (= 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 .cse5)) (fp.mul roundNearestTiesToEven .cse2 .cse6)) (fp.mul roundNearestTiesToEven .cse2 .cse1))))))))) is different from true [2018-12-02 15:09:57,284 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 (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 .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))) (.cse0 (bvadd c_main_~count~0 (_ bv4294967294 32)))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven .cse0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse7 (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 (= (_ bv8 32) c_main_~count~0) (not (= (_ bv0 32) (bvlshr .cse0 (_ 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)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.mul roundNearestTiesToEven .cse1 .cse4)) c_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= 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 .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 .cse6)) (fp.mul roundNearestTiesToEven .cse1 .cse7)))))))))) is different from false [2018-12-02 15:09:59,899 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (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 .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))) (.cse0 (bvadd c_main_~count~0 (_ bv4294967294 32)))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven .cse0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse7 (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 (= (_ bv8 32) c_main_~count~0) (not (= (_ bv0 32) (bvlshr .cse0 (_ 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)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.mul roundNearestTiesToEven .cse1 .cse4)) c_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= 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 .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 .cse6)) (fp.mul roundNearestTiesToEven .cse1 .cse7)))))))))) is different from true [2018-12-02 15:10:02,465 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 (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 .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))) (.cse0 (bvadd c_main_~count~0 (_ bv4294967294 32)))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven .cse0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse7 (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 (= (_ bv8 32) c_main_~count~0) (not (= (_ bv0 32) (bvlshr .cse0 (_ 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)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.mul roundNearestTiesToEven .cse1 .cse4)) c_main_~oddExp~0) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= 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 .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 .cse6)) (fp.mul roundNearestTiesToEven .cse1 .cse7)))))))))) is different from false [2018-12-02 15:10:05,016 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (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 .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))) (.cse0 (bvadd c_main_~count~0 (_ bv4294967294 32)))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven .cse0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse7 (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 (= (_ bv8 32) c_main_~count~0) (not (= (_ bv0 32) (bvlshr .cse0 (_ 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)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.mul roundNearestTiesToEven .cse1 .cse4)) c_main_~oddExp~0) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= 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 .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 .cse6)) (fp.mul roundNearestTiesToEven .cse1 .cse7)))))))))) is different from true [2018-12-02 15:10:07,662 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-12-02 15:10:10,228 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-12-02 15:10:23,926 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-12-02 15:10:35,997 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-02 15:10:36,198 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2018-12-02 15:10:36,199 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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) 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) ... 39 more [2018-12-02 15:10:36,205 INFO L168 Benchmark]: Toolchain (without parser) took 872850.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -119.4 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2018-12-02 15:10:36,206 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:10:36,206 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.25 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 15:10:36,207 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.50 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:10:36,207 INFO L168 Benchmark]: Boogie Preprocessor took 15.73 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 15:10:36,207 INFO L168 Benchmark]: RCFGBuilder took 3155.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-12-02 15:10:36,207 INFO L168 Benchmark]: TraceAbstraction took 869503.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -3.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.7 MB). Peak memory consumption was 35.1 MB. Max. memory is 11.5 GB. [2018-12-02 15:10:36,209 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 156.25 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 932.6 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 14.50 ms. Allocated memory is still 1.0 GB. Free memory is still 932.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.73 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3155.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 869503.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -3.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.7 MB). Peak memory consumption was 35.1 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...