./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/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_382eb853-3b5c-4494-95e8-d12cc7a90f2b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/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_382eb853-3b5c-4494-95e8-d12cc7a90f2b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/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_382eb853-3b5c-4494-95e8-d12cc7a90f2b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/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-5842f4b [2018-11-18 16:31:29,457 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:31:29,459 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:31:29,466 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:31:29,466 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:31:29,467 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:31:29,467 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:31:29,468 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:31:29,469 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:31:29,470 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:31:29,471 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:31:29,471 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:31:29,472 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:31:29,472 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:31:29,473 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:31:29,473 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:31:29,474 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:31:29,475 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:31:29,476 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:31:29,477 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:31:29,478 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:31:29,479 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:31:29,481 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:31:29,481 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:31:29,481 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:31:29,482 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:31:29,482 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:31:29,483 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:31:29,483 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:31:29,484 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:31:29,484 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:31:29,485 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:31:29,485 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:31:29,485 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:31:29,486 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:31:29,486 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:31:29,486 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 16:31:29,497 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:31:29,497 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:31:29,497 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:31:29,497 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 16:31:29,498 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 16:31:29,498 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 16:31:29,498 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 16:31:29,498 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 16:31:29,498 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 16:31:29,498 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 16:31:29,498 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 16:31:29,498 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 16:31:29,498 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 16:31:29,499 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:31:29,499 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:31:29,499 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:31:29,499 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:31:29,499 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:31:29,499 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:31:29,499 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:31:29,500 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:31:29,500 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:31:29,500 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:31:29,500 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:31:29,500 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:31:29,500 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:31:29,500 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:31:29,500 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:31:29,501 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:31:29,501 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:31:29,501 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:31:29,501 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:31:29,501 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:31:29,501 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 16:31:29,501 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:31:29,501 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:31:29,501 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 16:31:29,501 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_382eb853-3b5c-4494-95e8-d12cc7a90f2b/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-11-18 16:31:29,523 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:31:29,531 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:31:29,533 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:31:29,533 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:31:29,534 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:31:29,534 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/bin-2019/utaipan/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-11-18 16:31:29,570 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/bin-2019/utaipan/data/3b7d01711/de07558cac0f4e5f87e87da0d1911b08/FLAG2a06b15da [2018-11-18 16:31:29,966 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:31:29,966 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-11-18 16:31:29,971 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/bin-2019/utaipan/data/3b7d01711/de07558cac0f4e5f87e87da0d1911b08/FLAG2a06b15da [2018-11-18 16:31:29,980 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/bin-2019/utaipan/data/3b7d01711/de07558cac0f4e5f87e87da0d1911b08 [2018-11-18 16:31:29,982 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:31:29,983 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:31:29,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:31:29,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:31:29,986 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:31:29,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:31:29" (1/1) ... [2018-11-18 16:31:29,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3169912e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:29, skipping insertion in model container [2018-11-18 16:31:29,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:31:29" (1/1) ... [2018-11-18 16:31:29,994 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:31:30,007 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:31:30,115 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:31:30,118 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:31:30,129 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:31:30,137 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:31:30,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:30 WrapperNode [2018-11-18 16:31:30,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:31:30,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:31:30,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:31:30,138 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:31:30,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:30" (1/1) ... [2018-11-18 16:31:30,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:30" (1/1) ... [2018-11-18 16:31:30,149 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:31:30,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:31:30,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:31:30,150 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:31:30,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:30" (1/1) ... [2018-11-18 16:31:30,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:30" (1/1) ... [2018-11-18 16:31:30,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:30" (1/1) ... [2018-11-18 16:31:30,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:30" (1/1) ... [2018-11-18 16:31:30,159 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:30" (1/1) ... [2018-11-18 16:31:30,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:30" (1/1) ... [2018-11-18 16:31:30,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:30" (1/1) ... [2018-11-18 16:31:30,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:31:30,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:31:30,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:31:30,198 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:31:30,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/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-11-18 16:31:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:31:30,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:31:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:31:30,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:31:30,233 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:31:30,233 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:31:30,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 16:31:30,234 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 16:31:30,338 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:31:30,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:31:30 BoogieIcfgContainer [2018-11-18 16:31:30,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:31:30,339 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:31:30,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:31:30,341 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:31:30,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:31:29" (1/3) ... [2018-11-18 16:31:30,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac1446f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:31:30, skipping insertion in model container [2018-11-18 16:31:30,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:30" (2/3) ... [2018-11-18 16:31:30,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ac1446f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:31:30, skipping insertion in model container [2018-11-18 16:31:30,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:31:30" (3/3) ... [2018-11-18 16:31:30,343 INFO L112 eAbstractionObserver]: Analyzing ICFG loop3_true-unreach-call.c.i [2018-11-18 16:31:30,348 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:31:30,352 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 16:31:30,361 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 16:31:30,381 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:31:30,381 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:31:30,381 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:31:30,381 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:31:30,381 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:31:30,382 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:31:30,382 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:31:30,382 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:31:30,391 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-18 16:31:30,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 16:31:30,394 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:31:30,395 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:31:30,396 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:31:30,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:31:30,399 INFO L82 PathProgramCache]: Analyzing trace with hash 857481337, now seen corresponding path program 1 times [2018-11-18 16:31:30,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:31:30,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:31:30,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:31:30,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:31:30,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:31:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:31:30,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:31:30,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:31:30,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:31:30,474 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:31:30,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 16:31:30,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 16:31:30,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:31:30,486 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-18 16:31:30,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:31:30,498 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-18 16:31:30,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 16:31:30,500 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 16:31:30,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:31:30,506 INFO L225 Difference]: With dead ends: 35 [2018-11-18 16:31:30,506 INFO L226 Difference]: Without dead ends: 16 [2018-11-18 16:31:30,509 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:31:30,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-18 16:31:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-18 16:31:30,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 16:31:30,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-18 16:31:30,536 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-11-18 16:31:30,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:31:30,536 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-18 16:31:30,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 16:31:30,536 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-18 16:31:30,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 16:31:30,537 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:31:30,537 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:31:30,537 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:31:30,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:31:30,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1154070091, now seen corresponding path program 1 times [2018-11-18 16:31:30,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:31:30,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:31:30,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:31:30,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:31:30,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:31:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:31:30,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:31:30,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:31:30,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:31:30,603 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 16:31:30,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:31:30,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:31:30,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:31:30,605 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2018-11-18 16:31:30,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:31:30,627 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-18 16:31:30,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:31:30,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-18 16:31:30,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:31:30,628 INFO L225 Difference]: With dead ends: 30 [2018-11-18 16:31:30,628 INFO L226 Difference]: Without dead ends: 20 [2018-11-18 16:31:30,628 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:31:30,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-18 16:31:30,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-18 16:31:30,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 16:31:30,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-18 16:31:30,631 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2018-11-18 16:31:30,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:31:30,631 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-18 16:31:30,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:31:30,631 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-18 16:31:30,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 16:31:30,632 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:31:30,632 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:31:30,632 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:31:30,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:31:30,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1365889843, now seen corresponding path program 1 times [2018-11-18 16:31:30,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 16:31:30,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:31:30,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:31:30,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:31:30,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 16:31:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:31:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:31:30,657 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 16:31:30,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:31:30 BoogieIcfgContainer [2018-11-18 16:31:30,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 16:31:30,674 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:31:30,674 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:31:30,675 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:31:30,675 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:31:30" (3/4) ... [2018-11-18 16:31:30,677 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 16:31:30,677 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:31:30,678 INFO L168 Benchmark]: Toolchain (without parser) took 695.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -139.9 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:31:30,679 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:31:30,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.09 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:31:30,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.75 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:31:30,680 INFO L168 Benchmark]: Boogie Preprocessor took 47.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -200.5 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-18 16:31:30,680 INFO L168 Benchmark]: RCFGBuilder took 141.10 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: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-18 16:31:30,681 INFO L168 Benchmark]: TraceAbstraction took 335.17 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: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2018-11-18 16:31:30,681 INFO L168 Benchmark]: Witness Printer took 2.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:31:30,683 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 154.09 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 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 11.75 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -200.5 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 141.10 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: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 335.17 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: 28.9 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Witness Printer took 2.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 14, overapproximation of to_real at line 12, overapproximation of someBinaryArithmeticFLOAToperation at line 27. Possible FailurePath: [L5] float pi = 3.14159 ; VAL [\old(pi)=2, pi=314159/100000] [L11] float x = __VERIFIER_nondet_float() ; [L12] float octant1 = 0 ; [L13] float octant2 = pi/8 ; [L15] float oddExp = x ; [L16] float evenExp = 1.0 ; [L17] float term = x ; [L18] unsigned int count = 2 ; [L19] int multFactor = 0 ; [L20] int temp ; VAL [count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, term=3, x=3] [L22] COND TRUE 1 [L24] term = term * (x/count) VAL [count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, x=3] [L25] COND FALSE, 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, 23 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 39 SDtfs, 1 SDslu, 13 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=23occurred 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, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 716 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-5842f4b [2018-11-18 16:31:32,082 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:31:32,083 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:31:32,091 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:31:32,091 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:31:32,091 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:31:32,092 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:31:32,093 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:31:32,094 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:31:32,095 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:31:32,096 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:31:32,096 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:31:32,096 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:31:32,097 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:31:32,098 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:31:32,098 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:31:32,099 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:31:32,100 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:31:32,101 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:31:32,102 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:31:32,103 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:31:32,104 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:31:32,106 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:31:32,106 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:31:32,106 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:31:32,107 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:31:32,107 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:31:32,108 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:31:32,108 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:31:32,109 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:31:32,109 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:31:32,110 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:31:32,110 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:31:32,110 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:31:32,111 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:31:32,111 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:31:32,111 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-18 16:31:32,122 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:31:32,122 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:31:32,122 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:31:32,122 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 16:31:32,123 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 16:31:32,123 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 16:31:32,123 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 16:31:32,123 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 16:31:32,123 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 16:31:32,123 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 16:31:32,124 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:31:32,124 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:31:32,124 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:31:32,124 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:31:32,124 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:31:32,125 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:31:32,125 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:31:32,125 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 16:31:32,125 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 16:31:32,125 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:31:32,125 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:31:32,125 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:31:32,125 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:31:32,126 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:31:32,126 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:31:32,126 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:31:32,126 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:31:32,126 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:31:32,126 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:31:32,126 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:31:32,127 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:31:32,127 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 16:31:32,127 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:31:32,127 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 16:31:32,127 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 16:31:32,127 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_382eb853-3b5c-4494-95e8-d12cc7a90f2b/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-11-18 16:31:32,154 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:31:32,162 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:31:32,164 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:31:32,165 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:31:32,165 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:31:32,166 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/bin-2019/utaipan/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-11-18 16:31:32,201 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/bin-2019/utaipan/data/14d6c6527/f206a8cd81a34d7dad39f7253c9c3395/FLAGb5b828eef [2018-11-18 16:31:32,591 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:31:32,591 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-11-18 16:31:32,595 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/bin-2019/utaipan/data/14d6c6527/f206a8cd81a34d7dad39f7253c9c3395/FLAGb5b828eef [2018-11-18 16:31:32,603 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/bin-2019/utaipan/data/14d6c6527/f206a8cd81a34d7dad39f7253c9c3395 [2018-11-18 16:31:32,605 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:31:32,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 16:31:32,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:31:32,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:31:32,610 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:31:32,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:31:32" (1/1) ... [2018-11-18 16:31:32,613 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@119b503f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:32, skipping insertion in model container [2018-11-18 16:31:32,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:31:32" (1/1) ... [2018-11-18 16:31:32,621 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:31:32,635 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:31:32,749 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:31:32,753 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:31:32,767 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:31:32,775 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:31:32,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:32 WrapperNode [2018-11-18 16:31:32,776 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:31:32,776 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 16:31:32,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 16:31:32,776 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 16:31:32,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:32" (1/1) ... [2018-11-18 16:31:32,786 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:32" (1/1) ... [2018-11-18 16:31:32,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 16:31:32,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:31:32,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:31:32,790 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:31:32,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:32" (1/1) ... [2018-11-18 16:31:32,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:32" (1/1) ... [2018-11-18 16:31:32,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:32" (1/1) ... [2018-11-18 16:31:32,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:32" (1/1) ... [2018-11-18 16:31:32,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:32" (1/1) ... [2018-11-18 16:31:32,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:32" (1/1) ... [2018-11-18 16:31:32,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:32" (1/1) ... [2018-11-18 16:31:32,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:31:32,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:31:32,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:31:32,810 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:31:32,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/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-11-18 16:31:32,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:31:32,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:31:32,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:31:32,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:31:32,894 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:31:32,895 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:31:32,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 16:31:32,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 16:31:36,239 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:31:36,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:31:36 BoogieIcfgContainer [2018-11-18 16:31:36,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:31:36,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:31:36,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:31:36,242 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:31:36,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:31:32" (1/3) ... [2018-11-18 16:31:36,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643340f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:31:36, skipping insertion in model container [2018-11-18 16:31:36,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:31:32" (2/3) ... [2018-11-18 16:31:36,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643340f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:31:36, skipping insertion in model container [2018-11-18 16:31:36,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:31:36" (3/3) ... [2018-11-18 16:31:36,245 INFO L112 eAbstractionObserver]: Analyzing ICFG loop3_true-unreach-call.c.i [2018-11-18 16:31:36,259 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:31:36,265 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 16:31:36,277 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 16:31:36,296 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:31:36,296 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:31:36,296 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:31:36,296 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:31:36,296 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:31:36,297 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:31:36,297 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:31:36,297 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:31:36,297 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:31:36,306 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-18 16:31:36,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 16:31:36,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:31:36,310 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:31:36,311 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:31:36,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:31:36,315 INFO L82 PathProgramCache]: Analyzing trace with hash 857481337, now seen corresponding path program 1 times [2018-11-18 16:31:36,317 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 16:31:36,317 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/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-11-18 16:31:36,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:31:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:31:36,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:31:36,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:31:36,377 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:31:36,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:31:36,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:31:36,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 16:31:36,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 16:31:36,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:31:36,403 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-18 16:31:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:31:36,417 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-18 16:31:36,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 16:31:36,418 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 16:31:36,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:31:36,422 INFO L225 Difference]: With dead ends: 35 [2018-11-18 16:31:36,422 INFO L226 Difference]: Without dead ends: 16 [2018-11-18 16:31:36,424 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:31:36,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-18 16:31:36,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-18 16:31:36,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 16:31:36,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-18 16:31:36,447 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-11-18 16:31:36,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:31:36,448 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-18 16:31:36,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 16:31:36,448 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-18 16:31:36,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 16:31:36,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:31:36,448 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:31:36,449 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:31:36,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:31:36,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1154070091, now seen corresponding path program 1 times [2018-11-18 16:31:36,449 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 16:31:36,450 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/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-11-18 16:31:36,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:31:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:31:37,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:31:37,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:31:37,127 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:31:37,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:31:37,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:31:37,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:31:37,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:31:37,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:31:37,141 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2018-11-18 16:31:41,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:31:41,292 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-18 16:31:41,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:31:41,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-18 16:31:41,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:31:41,293 INFO L225 Difference]: With dead ends: 30 [2018-11-18 16:31:41,293 INFO L226 Difference]: Without dead ends: 20 [2018-11-18 16:31:41,294 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:31:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-18 16:31:41,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-18 16:31:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 16:31:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-18 16:31:41,296 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2018-11-18 16:31:41,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:31:41,297 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-18 16:31:41,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:31:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-18 16:31:41,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 16:31:41,297 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:31:41,297 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:31:41,297 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:31:41,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:31:41,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1365889843, now seen corresponding path program 1 times [2018-11-18 16:31:41,298 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 16:31:41,298 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/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-11-18 16:31:41,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:31:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:31:42,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:31:58,768 WARN L180 SmtUtils]: Spent 11.33 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-18 16:32:18,493 WARN L180 SmtUtils]: Spent 14.74 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-18 16:32:20,786 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) c_main_~oddExp~0) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)))))) is different from false [2018-11-18 16:32:23,042 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) c_main_~oddExp~0) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)))))) is different from true [2018-11-18 16:32:34,727 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (and (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven v_prenex_2 (fp.div roundNearestTiesToEven v_prenex_2 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse2 .cse3)) (fp.add roundNearestTiesToEven v_prenex_2 (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_2 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))) (fp.lt v_prenex_2 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt v_prenex_2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))))) is different from false [2018-11-18 16:32:46,513 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven v_prenex_2 (fp.div roundNearestTiesToEven v_prenex_2 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven v_prenex_2 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_2 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))) (fp.lt v_prenex_2 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt v_prenex_2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and (= (_ bv0 32) c___VERIFIER_assert_~cond) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse2 .cse3)) (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))))))) is different from false [2018-11-18 16:32:53,375 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))))) is different from false [2018-11-18 16:32:55,645 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))))) is different from true [2018-11-18 16:32:55,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:32:55,649 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:32:55,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:32:55,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 16:32:55,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 16:32:55,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 16:32:55,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=22, Unknown=6, NotChecked=44, Total=90 [2018-11-18 16:32:55,668 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2018-11-18 16:33:03,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:33:03,659 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-18 16:33:03,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 16:33:03,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-11-18 16:33:03,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:33:03,660 INFO L225 Difference]: With dead ends: 26 [2018-11-18 16:33:03,660 INFO L226 Difference]: Without dead ends: 21 [2018-11-18 16:33:03,661 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 50.3s TimeCoverageRelationStatistics Valid=22, Invalid=30, Unknown=6, NotChecked=52, Total=110 [2018-11-18 16:33:03,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-18 16:33:03,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-18 16:33:03,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 16:33:03,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-18 16:33:03,664 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2018-11-18 16:33:03,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:33:03,664 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-18 16:33:03,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 16:33:03,664 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-18 16:33:03,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 16:33:03,664 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:33:03,664 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:33:03,665 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:33:03,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:33:03,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1908428422, now seen corresponding path program 1 times [2018-11-18 16:33:03,665 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 16:33:03,665 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/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-11-18 16:33:03,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:33:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:33:04,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:33:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:33:04,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:33:04,986 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:33:05,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:33:05,004 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/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-11-18 16:33:05,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:33:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:33:05,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:33:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:33:05,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:33:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:33:05,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 16:33:05,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4] total 6 [2018-11-18 16:33:05,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:33:05,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:33:05,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:33:05,957 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2018-11-18 16:33:16,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:33:16,589 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-18 16:33:16,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:33:16,590 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-18 16:33:16,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:33:16,591 INFO L225 Difference]: With dead ends: 41 [2018-11-18 16:33:16,591 INFO L226 Difference]: Without dead ends: 31 [2018-11-18 16:33:16,592 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 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-11-18 16:33:16,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-18 16:33:16,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-18 16:33:16,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 16:33:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-18 16:33:16,596 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 20 [2018-11-18 16:33:16,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:33:16,596 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-18 16:33:16,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:33:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-18 16:33:16,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 16:33:16,597 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:33:16,597 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:33:16,597 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:33:16,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:33:16,597 INFO L82 PathProgramCache]: Analyzing trace with hash -611531512, now seen corresponding path program 1 times [2018-11-18 16:33:16,597 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 16:33:16,597 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/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-11-18 16:33:16,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:33:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:33:37,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:33:39,291 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-11-18 16:33:55,175 WARN L180 SmtUtils]: Spent 13.44 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-18 16:33:57,511 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= (_ bv4 32) c_main_~count~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse0))) (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 c_main_~term~0)) c_main_~oddExp~0))) is different from false [2018-11-18 16:34:00,074 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= c_main_~oddExp~0 (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= (_ bv4 32) c_main_~count~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)))))) is different from false [2018-11-18 16:34:03,199 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= c_main_~oddExp~0 (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (_ bv4 32) c_main_~count~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)))))) is different from false [2018-11-18 16:34:05,260 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= c_main_~oddExp~0 (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (_ bv4 32) c_main_~count~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)))))) is different from true [2018-11-18 16:34:07,600 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse3 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) c_main_~oddExp~0) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2)))))))) is different from false [2018-11-18 16:34:09,914 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse3 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) c_main_~oddExp~0) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2)))))))) is different from true [2018-11-18 16:34:21,919 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_5 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_5 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt v_prenex_5 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt v_prenex_5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (let ((.cse5 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse6 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse4 .cse5)) (fp.mul roundNearestTiesToEven .cse4 .cse6)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse4 .cse7)) (fp.mul roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))))))) is different from false [2018-11-18 16:34:33,930 WARN L832 $PredicateComparison]: unable to prove that (or (and (= (_ bv0 32) c___VERIFIER_assert_~cond) (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_5 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_5 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt v_prenex_5 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt v_prenex_5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) (and (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (let ((.cse5 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse6 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse4 .cse5)) (fp.mul roundNearestTiesToEven .cse4 .cse6)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse4 .cse7)) (fp.mul roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)))) is different from false [2018-11-18 16:34:40,939 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_5 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_5 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt v_prenex_5 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt v_prenex_5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from false [2018-11-18 16:34:43,253 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_5 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_5 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt v_prenex_5 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt v_prenex_5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from true [2018-11-18 16:34:43,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-11-18 16:34:43,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:34:47,244 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-18 16:34:49,321 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-18 16:34:51,388 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-18 16:34:53,460 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-18 16:34:55,585 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-18 16:34:57,707 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-18 16:34:59,908 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-11-18 16:35:02,099 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-11-18 16:35:04,282 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-11-18 16:35:06,460 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-11-18 16:35:08,703 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))))))) is different from false [2018-11-18 16:35:10,930 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))))))) is different from true [2018-11-18 16:35:13,874 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-11-18 16:35:20,891 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-11-18 16:35:23,237 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-11-18 16:35:23,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:35:23,260 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/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-11-18 16:35:23,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:35:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-18 16:35:36,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:35:36,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-18 16:35:36,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 16:35:36,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 16:35:36,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=47, Unknown=26, NotChecked=432, Total=552 [2018-11-18 16:35:36,165 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 13 states. [2018-11-18 16:35:45,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:35:45,825 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-18 16:35:45,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 16:35:45,826 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-11-18 16:35:45,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:35:45,826 INFO L225 Difference]: With dead ends: 36 [2018-11-18 16:35:45,826 INFO L226 Difference]: Without dead ends: 31 [2018-11-18 16:35:45,827 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 77.9s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=26, NotChecked=464, Total=600 [2018-11-18 16:35:45,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-18 16:35:45,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-18 16:35:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 16:35:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-18 16:35:45,832 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2018-11-18 16:35:45,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:35:45,832 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-18 16:35:45,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 16:35:45,832 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-18 16:35:45,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 16:35:45,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:35:45,832 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:35:45,833 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:35:45,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:35:45,833 INFO L82 PathProgramCache]: Analyzing trace with hash 497228205, now seen corresponding path program 2 times [2018-11-18 16:35:45,833 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 16:35:45,833 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/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-11-18 16:35:45,837 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 16:36:34,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 16:36:34,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:36:34,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:36:52,512 WARN L180 SmtUtils]: Spent 13.64 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-18 16:37:16,710 WARN L180 SmtUtils]: Spent 20.35 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-18 16:37:18,990 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-11-18 16:37:22,876 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-11-18 16:37:25,203 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-11-18 16:37:27,492 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-11-18 16:37:29,780 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-11-18 16:37:32,154 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-11-18 16:37:34,552 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-11-18 16:37:36,944 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-11-18 16:37:39,462 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (and (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) c_main_~oddExp~0) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))))))))) is different from false [2018-11-18 16:37:41,960 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (and (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) c_main_~oddExp~0) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))))))))) is different from true [2018-11-18 16:37:55,001 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_7 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_7 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))) (fp.lt v_prenex_7 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt v_prenex_7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (let ((.cse7 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse10 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse8 (fp.mul roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse11 (fp.mul roundNearestTiesToEven .cse8 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse9 (fp.mul roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse6 .cse7)) (fp.mul roundNearestTiesToEven .cse6 .cse8)) (fp.mul roundNearestTiesToEven .cse6 .cse9)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse6 .cse10)) (fp.mul roundNearestTiesToEven .cse6 .cse11)) (fp.mul roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse9 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))))))) is different from false [2018-11-18 16:38:08,063 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_7 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_7 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))) (fp.lt v_prenex_7 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt v_prenex_7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= (_ bv0 32) c___VERIFIER_assert_~cond)) (and (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (let ((.cse7 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse10 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse8 (fp.mul roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse11 (fp.mul roundNearestTiesToEven .cse8 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse9 (fp.mul roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse6 .cse7)) (fp.mul roundNearestTiesToEven .cse6 .cse8)) (fp.mul roundNearestTiesToEven .cse6 .cse9)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse6 .cse10)) (fp.mul roundNearestTiesToEven .cse6 .cse11)) (fp.mul roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse9 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))))))) is different from false [2018-11-18 16:38:15,584 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_7 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_7 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))) (fp.lt v_prenex_7 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt v_prenex_7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from false [2018-11-18 16:38:18,046 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_7 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_7 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))) (fp.lt v_prenex_7 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt v_prenex_7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from true [2018-11-18 16:38:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2018-11-18 16:38:18,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:38:26,237 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-18 16:38:28,323 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-18 16:38:30,394 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-18 16:38:32,465 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-18 16:38:34,583 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-18 16:38:36,708 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-18 16:38:38,900 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-11-18 16:38:41,099 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-11-18 16:38:43,284 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-11-18 16:38:45,469 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-11-18 16:38:47,761 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))))))) is different from false [2018-11-18 16:38:50,010 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))))))) is different from true [2018-11-18 16:38:52,318 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32)))))))))))) is different from false [2018-11-18 16:38:54,617 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32)))))))))))) is different from true [2018-11-18 16:38:56,914 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32)))))))))))) is different from false [2018-11-18 16:38:59,209 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32)))))))))))) is different from true [2018-11-18 16:39:01,567 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32))))))))))))) is different from false [2018-11-18 16:39:03,918 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32))))))))))))) is different from true [2018-11-18 16:39:07,354 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-11-18 16:39:14,888 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-11-18 16:39:17,394 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-11-18 16:39:17,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:39:17,423 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/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-11-18 16:39:17,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 16:39:41,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 16:39:41,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-11-18 16:39:42,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 16:39:42,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-11-18 16:39:42,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 16:39:42,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 16:39:42,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=59, Unknown=36, NotChecked=714, Total=870 [2018-11-18 16:39:42,183 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 16 states. [2018-11-18 16:39:58,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:39:58,138 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-18 16:39:58,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 16:39:58,228 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-11-18 16:39:58,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:39:58,229 INFO L225 Difference]: With dead ends: 41 [2018-11-18 16:39:58,229 INFO L226 Difference]: Without dead ends: 36 [2018-11-18 16:39:58,229 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 133.2s TimeCoverageRelationStatistics Valid=66, Invalid=72, Unknown=36, NotChecked=756, Total=930 [2018-11-18 16:39:58,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-18 16:39:58,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-18 16:39:58,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 16:39:58,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-18 16:39:58,234 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 25 [2018-11-18 16:39:58,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:39:58,234 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-18 16:39:58,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 16:39:58,235 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-18 16:39:58,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 16:39:58,235 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:39:58,235 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:39:58,235 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:39:58,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:39:58,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1071354458, now seen corresponding path program 2 times [2018-11-18 16:39:58,236 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 16:39:58,236 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/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-11-18 16:39:58,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 16:40:00,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 16:40:00,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:40:00,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:40:00,828 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:40:00,828 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:40:00,879 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:40:00,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 16:40:00,908 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/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-11-18 16:40:00,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 16:40:14,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 16:40:14,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:40:14,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:40:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:40:14,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:40:14,615 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:40:14,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 16:40:14,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 10 [2018-11-18 16:40:14,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 16:40:14,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 16:40:14,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-18 16:40:14,744 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2018-11-18 16:40:32,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:40:32,889 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-18 16:40:32,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 16:40:32,889 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-18 16:40:32,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:40:32,890 INFO L225 Difference]: With dead ends: 72 [2018-11-18 16:40:32,890 INFO L226 Difference]: Without dead ends: 57 [2018-11-18 16:40:32,890 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 108 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-11-18 16:40:32,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-18 16:40:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2018-11-18 16:40:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 16:40:32,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-18 16:40:32,898 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 30 [2018-11-18 16:40:32,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:40:32,898 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-18 16:40:32,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 16:40:32,898 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-18 16:40:32,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 16:40:32,899 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:40:32,899 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:40:32,899 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:40:32,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:40:32,899 INFO L82 PathProgramCache]: Analyzing trace with hash 703652904, now seen corresponding path program 3 times [2018-11-18 16:40:32,899 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 16:40:32,900 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_382eb853-3b5c-4494-95e8-d12cc7a90f2b/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-11-18 16:40:32,907 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-18 16:42:12,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 16:42:12,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 16:42:12,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:42:27,868 WARN L180 SmtUtils]: Spent 11.19 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-18 16:42:48,583 WARN L180 SmtUtils]: Spent 15.61 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-18 16:42:50,877 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-11-18 16:42:53,144 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-11-18 16:42:55,437 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-11-18 16:42:57,717 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-11-18 16:43:00,017 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-11-18 16:43:04,296 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-11-18 16:43:06,584 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-11-18 16:43:08,951 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-11-18 16:43:11,445 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-11-18 16:43:13,797 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)))) (= (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-11-18 16:43:16,126 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)))) (= (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-11-18 16:43:18,658 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (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 .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse0 (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 (= (_ bv8 32) c_main_~count~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))))) 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 .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.mul roundNearestTiesToEven .cse1 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 .cse1 .cse4)) (fp.mul roundNearestTiesToEven .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 .cse0))))))))) is different from false [2018-11-18 16:43:21,010 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (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 .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse0 (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 (= (_ bv8 32) c_main_~count~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))))) 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 .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.mul roundNearestTiesToEven .cse1 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 .cse1 .cse4)) (fp.mul roundNearestTiesToEven .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 .cse0))))))))) is different from true [2018-11-18 16:43:23,574 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (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 .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (_ bv8 32) 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)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) c_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven .cse3 (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 .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse6)))))))))) is different from false [2018-11-18 16:43:26,048 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (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 .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (_ bv8 32) 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)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) c_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven .cse3 (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 .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse6)))))))))) is different from true [2018-11-18 16:43:28,606 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (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 .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (_ bv8 32) 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)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) c_main_~oddExp~0) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse3 (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 .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse6)))))))))) is different from false [2018-11-18 16:43:32,204 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse5 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv8 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv9 32)))))) c_main_~oddExp~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse6)) (fp.mul roundNearestTiesToEven .cse0 .cse7)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))))))))))) is different from false [2018-11-18 16:43:34,732 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse5 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv8 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv9 32)))))) c_main_~oddExp~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse6)) (fp.mul roundNearestTiesToEven .cse0 .cse7)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))))))))))) is different from true [2018-11-18 16:43:48,284 WARN L832 $PredicateComparison]: unable to prove that (or (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (not (let ((.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv8 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse6)) (fp.mul roundNearestTiesToEven .cse0 .cse7)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv9 32)))))))))))))))))) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_11 (_ FloatingPoint 8 24))) (and (fp.gt v_prenex_11 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse9 (fp.mul roundNearestTiesToEven v_prenex_11 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse13 (fp.mul roundNearestTiesToEven .cse9 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse10 (fp.mul roundNearestTiesToEven .cse13 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse14 (fp.mul roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse11 (fp.mul roundNearestTiesToEven .cse14 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (let ((.cse15 (fp.mul roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) (let ((.cse8 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse12 (fp.mul roundNearestTiesToEven .cse15 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv8 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse8 .cse9)) (fp.mul roundNearestTiesToEven .cse8 .cse10)) (fp.mul roundNearestTiesToEven .cse8 .cse11)) (fp.mul roundNearestTiesToEven .cse8 .cse12)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_11 (fp.mul roundNearestTiesToEven .cse8 .cse13)) (fp.mul roundNearestTiesToEven .cse8 .cse14)) (fp.mul roundNearestTiesToEven .cse8 .cse15)) (fp.mul roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven .cse12 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv9 32)))))))))))))) (fp.lt v_prenex_11 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))))))) is different from false [2018-11-18 16:44:00,074 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-18 16:44:00,275 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2018-11-18 16:44:00,275 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:429) 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:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java: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-11-18 16:44:00,278 INFO L168 Benchmark]: Toolchain (without parser) took 747672.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -147.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:44:00,278 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:44:00,278 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.73 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:44:00,279 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.90 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:44:00,279 INFO L168 Benchmark]: Boogie Preprocessor took 19.57 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:44:00,279 INFO L168 Benchmark]: RCFGBuilder took 3429.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:44:00,279 INFO L168 Benchmark]: TraceAbstraction took 744037.15 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -5.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.3 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2018-11-18 16:44:00,282 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 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 169.73 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 940.1 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 13.90 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.57 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 3429.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 744037.15 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -5.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.3 MB). Peak memory consumption was 10.0 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...