./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/zonotope_2_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_2_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2dba1f69a6b738bef9ed848916ef3e39fe78a0e0 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_2_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2dba1f69a6b738bef9ed848916ef3e39fe78a0e0 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:18:35,103 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:18:35,105 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:18:35,114 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:18:35,114 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:18:35,115 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:18:35,116 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:18:35,117 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:18:35,118 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:18:35,119 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:18:35,119 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:18:35,120 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:18:35,120 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:18:35,121 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:18:35,122 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:18:35,122 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:18:35,123 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:18:35,124 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:18:35,126 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:18:35,127 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:18:35,128 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:18:35,129 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:18:35,130 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:18:35,130 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:18:35,131 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:18:35,131 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:18:35,132 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:18:35,132 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:18:35,133 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:18:35,134 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:18:35,134 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:18:35,135 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:18:35,135 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:18:35,135 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:18:35,135 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:18:35,136 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:18:35,136 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 02:18:35,146 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:18:35,147 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:18:35,147 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:18:35,147 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:18:35,148 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:18:35,148 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:18:35,148 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:18:35,148 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:18:35,149 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:18:35,149 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:18:35,149 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:18:35,149 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:18:35,149 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:18:35,149 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:18:35,149 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:18:35,150 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:18:35,150 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:18:35,150 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:18:35,150 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:18:35,150 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:18:35,150 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:18:35,150 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:18:35,150 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:18:35,151 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:18:35,151 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:18:35,151 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:18:35,151 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:18:35,151 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 02:18:35,151 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:18:35,151 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:18:35,152 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_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2dba1f69a6b738bef9ed848916ef3e39fe78a0e0 [2018-11-23 02:18:35,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:18:35,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:18:35,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:18:35,186 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:18:35,186 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:18:35,186 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/zonotope_2_true-unreach-call_true-termination.c [2018-11-23 02:18:35,224 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/data/b3f565f43/39342b10605549f38effdb16ee370a5f/FLAGb11c6c595 [2018-11-23 02:18:35,552 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:18:35,553 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/sv-benchmarks/c/float-benchs/zonotope_2_true-unreach-call_true-termination.c [2018-11-23 02:18:35,558 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/data/b3f565f43/39342b10605549f38effdb16ee370a5f/FLAGb11c6c595 [2018-11-23 02:18:35,985 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/data/b3f565f43/39342b10605549f38effdb16ee370a5f [2018-11-23 02:18:35,987 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:18:35,988 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:18:35,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:18:35,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:18:35,992 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:18:35,992 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:18:35" (1/1) ... [2018-11-23 02:18:35,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c13169d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:35, skipping insertion in model container [2018-11-23 02:18:35,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:18:35" (1/1) ... [2018-11-23 02:18:36,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:18:36,011 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:18:36,120 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:18:36,123 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:18:36,133 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:18:36,145 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:18:36,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:36 WrapperNode [2018-11-23 02:18:36,145 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:18:36,146 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:18:36,146 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:18:36,146 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:18:36,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:36" (1/1) ... [2018-11-23 02:18:36,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:36" (1/1) ... [2018-11-23 02:18:36,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:18:36,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:18:36,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:18:36,160 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:18:36,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:36" (1/1) ... [2018-11-23 02:18:36,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:36" (1/1) ... [2018-11-23 02:18:36,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:36" (1/1) ... [2018-11-23 02:18:36,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:36" (1/1) ... [2018-11-23 02:18:36,170 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:36" (1/1) ... [2018-11-23 02:18:36,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:36" (1/1) ... [2018-11-23 02:18:36,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:36" (1/1) ... [2018-11-23 02:18:36,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:18:36,175 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:18:36,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:18:36,175 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:18:36,176 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:18:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:18:36,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:18:36,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:18:36,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:18:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:18:36,266 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:18:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 02:18:36,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 02:18:36,376 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:18:36,376 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 02:18:36,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:36 BoogieIcfgContainer [2018-11-23 02:18:36,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:18:36,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:18:36,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:18:36,380 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:18:36,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:18:35" (1/3) ... [2018-11-23 02:18:36,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fcd65b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:18:36, skipping insertion in model container [2018-11-23 02:18:36,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:36" (2/3) ... [2018-11-23 02:18:36,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fcd65b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:18:36, skipping insertion in model container [2018-11-23 02:18:36,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:36" (3/3) ... [2018-11-23 02:18:36,383 INFO L112 eAbstractionObserver]: Analyzing ICFG zonotope_2_true-unreach-call_true-termination.c [2018-11-23 02:18:36,391 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:18:36,396 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:18:36,408 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:18:36,429 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:18:36,429 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:18:36,429 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:18:36,429 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:18:36,429 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:18:36,430 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:18:36,430 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:18:36,430 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:18:36,430 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:18:36,442 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 02:18:36,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 02:18:36,446 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:18:36,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:18:36,449 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:18:36,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:18:36,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1296848067, now seen corresponding path program 1 times [2018-11-23 02:18:36,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:18:36,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:18:36,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:18:36,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:18:36,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:18:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:18:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:18:36,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:18:36,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:18:36,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 02:18:36,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 02:18:36,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:18:36,565 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 02:18:36,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:18:36,586 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2018-11-23 02:18:36,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 02:18:36,588 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 02:18:36,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:18:36,597 INFO L225 Difference]: With dead ends: 37 [2018-11-23 02:18:36,597 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 02:18:36,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:18:36,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 02:18:36,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 02:18:36,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 02:18:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-23 02:18:36,625 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2018-11-23 02:18:36,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:18:36,625 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-23 02:18:36,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 02:18:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 02:18:36,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 02:18:36,626 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:18:36,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:18:36,626 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:18:36,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:18:36,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1304236235, now seen corresponding path program 1 times [2018-11-23 02:18:36,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:18:36,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:18:36,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:18:36,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:18:36,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:18:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:18:36,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:18:36,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:18:36,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:18:36,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:18:36,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:18:36,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:18:36,665 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 3 states. [2018-11-23 02:18:36,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:18:36,680 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2018-11-23 02:18:36,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:18:36,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 02:18:36,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:18:36,681 INFO L225 Difference]: With dead ends: 27 [2018-11-23 02:18:36,681 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 02:18:36,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:18:36,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 02:18:36,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-11-23 02:18:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 02:18:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-23 02:18:36,688 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2018-11-23 02:18:36,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:18:36,689 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 02:18:36,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:18:36,689 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-23 02:18:36,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 02:18:36,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:18:36,690 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:18:36,690 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:18:36,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:18:36,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1302508357, now seen corresponding path program 1 times [2018-11-23 02:18:36,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:18:36,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:18:36,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:18:36,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:18:36,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:18:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:18:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:18:36,720 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #35#return; [?] CALL call #t~ret1 := main(); [?] ~x~0 := 12.0;~x1~0 := 12.0;~y~0 := 16.0;~y1~0 := 16.0;havoc ~i~0;~i~0 := 0; VAL [main_~i~0=0, main_~x1~0=12.0, main_~x~0=12.0, main_~y1~0=16.0, main_~y~0=16.0] [?] assume !!(~i~0 < 100000);~x~0 := ~x1~0;~y~0 := ~y1~0;~x1~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(3.0, ~x~0), 4.0), ~someBinaryArithmeticFLOAToperation(~y~0, 4.0));~y1~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, 4.0), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(3.0, ~y~0), 4.0)); VAL [main_~i~0=0, main_~x~0=12.0, main_~y~0=16.0] [?] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~x1~0, 0.0) && ~someBinaryFLOATComparisonOperation(~x1~0, 100.0) then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~x~0 := 12.0; [L13] ~x1~0 := 12.0; [L14] ~y~0 := 16.0; [L15] ~y1~0 := 16.0; [L16] havoc ~i~0; [L17] ~i~0 := 0; VAL [~i~0=0, ~x1~0=12.0, ~x~0=12.0, ~y1~0=16.0, ~y~0=16.0] [L17-L25] assume !!(~i~0 < 100000); [L18] ~x~0 := ~x1~0; [L19] ~y~0 := ~y1~0; [L20] ~x1~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(3.0, ~x~0), 4.0), ~someBinaryArithmeticFLOAToperation(~y~0, 4.0)); [L21] ~y1~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, 4.0), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(3.0, ~y~0), 4.0)); VAL [~i~0=0, ~x~0=12.0, ~y~0=16.0] [L23] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~x1~0, 0.0) && ~someBinaryFLOATComparisonOperation(~x1~0, 100.0) then 1 else 0)); VAL [#in~cond=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L8] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~x~0 := 12.0; [L13] ~x1~0 := 12.0; [L14] ~y~0 := 16.0; [L15] ~y1~0 := 16.0; [L16] havoc ~i~0; [L17] ~i~0 := 0; VAL [~i~0=0, ~x1~0=12.0, ~x~0=12.0, ~y1~0=16.0, ~y~0=16.0] [L17-L25] assume !!(~i~0 < 100000); [L18] ~x~0 := ~x1~0; [L19] ~y~0 := ~y1~0; [L20] ~x1~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(3.0, ~x~0), 4.0), ~someBinaryArithmeticFLOAToperation(~y~0, 4.0)); [L21] ~y1~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, 4.0), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(3.0, ~y~0), 4.0)); VAL [~i~0=0, ~x~0=12.0, ~y~0=16.0] [L23] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~x1~0, 0.0) && ~someBinaryFLOATComparisonOperation(~x1~0, 100.0) then 1 else 0)); VAL [#in~cond=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L8] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~x~0 := 12.0; [L13] ~x1~0 := 12.0; [L14] ~y~0 := 16.0; [L15] ~y1~0 := 16.0; [L16] havoc ~i~0; [L17] ~i~0 := 0; VAL [~i~0=0, ~x1~0=12.0, ~x~0=12.0, ~y1~0=16.0, ~y~0=16.0] [L17-L25] COND FALSE !(!(~i~0 < 100000)) [L18] ~x~0 := ~x1~0; [L19] ~y~0 := ~y1~0; [L20] ~x1~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(3.0, ~x~0), 4.0), ~someBinaryArithmeticFLOAToperation(~y~0, 4.0)); [L21] ~y1~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, 4.0), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(3.0, ~y~0), 4.0)); VAL [~i~0=0, ~x~0=12.0, ~y~0=16.0] [L23] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~x1~0, 0.0) && ~someBinaryFLOATComparisonOperation(~x1~0, 100.0) then 1 else 0)); VAL [#in~cond=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~x~0 := 12.0; [L13] ~x1~0 := 12.0; [L14] ~y~0 := 16.0; [L15] ~y1~0 := 16.0; [L16] havoc ~i~0; [L17] ~i~0 := 0; VAL [~i~0=0, ~x1~0=12.0, ~x~0=12.0, ~y1~0=16.0, ~y~0=16.0] [L17-L25] COND FALSE !(!(~i~0 < 100000)) [L18] ~x~0 := ~x1~0; [L19] ~y~0 := ~y1~0; [L20] ~x1~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(3.0, ~x~0), 4.0), ~someBinaryArithmeticFLOAToperation(~y~0, 4.0)); [L21] ~y1~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, 4.0), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(3.0, ~y~0), 4.0)); VAL [~i~0=0, ~x~0=12.0, ~y~0=16.0] [L23] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~x1~0, 0.0) && ~someBinaryFLOATComparisonOperation(~x1~0, 100.0) then 1 else 0)); VAL [#in~cond=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~x~0 := 12.0; [L13] ~x1~0 := 12.0; [L14] ~y~0 := 16.0; [L15] ~y1~0 := 16.0; [L16] havoc ~i~0; [L17] ~i~0 := 0; VAL [~i~0=0, ~x1~0=12.0, ~x~0=12.0, ~y1~0=16.0, ~y~0=16.0] [L17-L25] COND FALSE !(!(~i~0 < 100000)) [L18] ~x~0 := ~x1~0; [L19] ~y~0 := ~y1~0; [L20] ~x1~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(3.0, ~x~0), 4.0), ~someBinaryArithmeticFLOAToperation(~y~0, 4.0)); [L21] ~y1~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, 4.0), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(3.0, ~y~0), 4.0)); VAL [~i~0=0, ~x~0=12.0, ~y~0=16.0] [L23] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~x1~0, 0.0) && ~someBinaryFLOATComparisonOperation(~x1~0, 100.0) then 1 else 0)); VAL [#in~cond=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] ~x~0 := 12.0; [L13] ~x1~0 := 12.0; [L14] ~y~0 := 16.0; [L15] ~y1~0 := 16.0; [L16] havoc ~i~0; [L17] ~i~0 := 0; VAL [~i~0=0, ~x1~0=12.0, ~x~0=12.0, ~y1~0=16.0, ~y~0=16.0] [L17-L25] COND FALSE !(!(~i~0 < 100000)) [L18] ~x~0 := ~x1~0; [L19] ~y~0 := ~y1~0; [L20] ~x1~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(3.0, ~x~0), 4.0), ~someBinaryArithmeticFLOAToperation(~y~0, 4.0)); [L21] ~y1~0 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~x~0, 4.0), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(3.0, ~y~0), 4.0)); VAL [~i~0=0, ~x~0=12.0, ~y~0=16.0] [L23] CALL call __VERIFIER_assert((if ~someBinaryFLOATComparisonOperation(~x1~0, 0.0) && ~someBinaryFLOATComparisonOperation(~x1~0, 100.0) then 1 else 0)); VAL [#in~cond=0] [L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L8] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L8] assert false; VAL [#in~cond=0, ~cond=0] [L12] float x = 12.f; [L13] float x1 = 12.f; [L14] float y = 16.f; [L15] float y1 = 16.f; [L16] int i; [L17] i = 0 VAL [i=0, x=12, x1=12, y=16, y1=16] [L17] COND TRUE i < 100000 [L18] x = x1 [L19] y = y1 [L20] x1 = 3.f * x / 4.f + y / 4.f [L21] y1 = x / 4.f + 3.f * y / 4.f VAL [i=0, x=12, y=16] [L23] CALL __VERIFIER_assert(x1 >= 0.f && x1 <= 100.f) VAL [\old(cond)=0] [L8] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 02:18:36,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:18:36 BoogieIcfgContainer [2018-11-23 02:18:36,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:18:36,741 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:18:36,741 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:18:36,742 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:18:36,742 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:36" (3/4) ... [2018-11-23 02:18:36,745 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 02:18:36,745 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:18:36,745 INFO L168 Benchmark]: Toolchain (without parser) took 758.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 958.6 MB in the beginning and 1.1 GB in the end (delta: -128.2 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:18:36,747 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:18:36,747 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.87 ms. Allocated memory is still 1.0 GB. Free memory was 958.6 MB in the beginning and 947.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:18:36,748 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.72 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 945.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:18:36,748 INFO L168 Benchmark]: Boogie Preprocessor took 15.18 ms. Allocated memory is still 1.0 GB. Free memory is still 945.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:18:36,748 INFO L168 Benchmark]: RCFGBuilder took 201.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:18:36,749 INFO L168 Benchmark]: TraceAbstraction took 363.79 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: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-23 02:18:36,749 INFO L168 Benchmark]: Witness Printer took 3.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:18:36,751 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 156.87 ms. Allocated memory is still 1.0 GB. Free memory was 958.6 MB in the beginning and 947.9 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.72 ms. Allocated memory is still 1.0 GB. Free memory was 947.9 MB in the beginning and 945.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.18 ms. Allocated memory is still 1.0 GB. Free memory is still 945.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 201.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 363.79 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: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.38 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: 8]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 20. Possible FailurePath: [L12] float x = 12.f; [L13] float x1 = 12.f; [L14] float y = 16.f; [L15] float y1 = 16.f; [L16] int i; [L17] i = 0 VAL [i=0, x=12, x1=12, y=16, y1=16] [L17] COND TRUE i < 100000 [L18] x = x1 [L19] y = y1 [L20] x1 = 3.f * x / 4.f + y / 4.f [L21] y1 = x / 4.f + 3.f * y / 4.f VAL [i=0, x=12, y=16] [L23] CALL __VERIFIER_assert(x1 >= 0.f && x1 <= 100.f) VAL [\old(cond)=0] [L8] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L8] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 41 SDtfs, 1 SDslu, 14 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 02:18:38,254 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:18:38,255 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:18:38,265 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:18:38,265 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:18:38,266 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:18:38,267 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:18:38,269 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:18:38,270 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:18:38,270 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:18:38,271 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:18:38,271 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:18:38,273 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:18:38,273 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:18:38,274 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:18:38,275 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:18:38,275 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:18:38,277 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:18:38,279 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:18:38,280 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:18:38,281 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:18:38,282 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:18:38,283 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:18:38,284 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:18:38,284 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:18:38,285 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:18:38,286 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:18:38,286 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:18:38,287 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:18:38,288 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:18:38,288 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:18:38,288 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:18:38,288 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:18:38,289 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:18:38,289 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:18:38,290 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:18:38,290 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 02:18:38,300 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:18:38,300 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:18:38,301 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:18:38,301 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:18:38,301 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:18:38,301 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:18:38,302 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:18:38,302 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:18:38,302 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:18:38,302 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:18:38,302 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:18:38,302 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:18:38,302 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:18:38,303 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:18:38,303 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 02:18:38,303 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 02:18:38,303 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:18:38,303 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:18:38,303 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:18:38,303 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:18:38,304 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:18:38,304 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:18:38,304 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:18:38,304 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:18:38,306 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:18:38,306 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:18:38,306 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:18:38,306 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:18:38,306 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 02:18:38,306 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:18:38,307 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 02:18:38,307 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 02:18:38,307 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_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2dba1f69a6b738bef9ed848916ef3e39fe78a0e0 [2018-11-23 02:18:38,340 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:18:38,349 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:18:38,351 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:18:38,352 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:18:38,353 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:18:38,353 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/zonotope_2_true-unreach-call_true-termination.c [2018-11-23 02:18:38,396 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/data/a06fd0033/03385e61e43d4f4da3d56ad4d1d18828/FLAGa23b17b4e [2018-11-23 02:18:38,719 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:18:38,719 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/sv-benchmarks/c/float-benchs/zonotope_2_true-unreach-call_true-termination.c [2018-11-23 02:18:38,723 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/data/a06fd0033/03385e61e43d4f4da3d56ad4d1d18828/FLAGa23b17b4e [2018-11-23 02:18:39,163 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/data/a06fd0033/03385e61e43d4f4da3d56ad4d1d18828 [2018-11-23 02:18:39,166 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:18:39,168 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:18:39,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:18:39,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:18:39,172 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:18:39,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:18:39" (1/1) ... [2018-11-23 02:18:39,175 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36936f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:39, skipping insertion in model container [2018-11-23 02:18:39,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:18:39" (1/1) ... [2018-11-23 02:18:39,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:18:39,200 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:18:39,336 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:18:39,342 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:18:39,356 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:18:39,365 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:18:39,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:39 WrapperNode [2018-11-23 02:18:39,366 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:18:39,366 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:18:39,367 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:18:39,367 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:18:39,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:39" (1/1) ... [2018-11-23 02:18:39,379 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:39" (1/1) ... [2018-11-23 02:18:39,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:18:39,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:18:39,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:18:39,385 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:18:39,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:39" (1/1) ... [2018-11-23 02:18:39,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:39" (1/1) ... [2018-11-23 02:18:39,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:39" (1/1) ... [2018-11-23 02:18:39,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:39" (1/1) ... [2018-11-23 02:18:39,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:39" (1/1) ... [2018-11-23 02:18:39,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:39" (1/1) ... [2018-11-23 02:18:39,402 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:39" (1/1) ... [2018-11-23 02:18:39,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:18:39,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:18:39,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:18:39,404 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:18:39,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:18:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:18:39,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:18:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:18:39,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:18:39,498 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:18:39,498 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:18:39,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 02:18:39,498 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 02:18:40,876 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:18:40,877 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 02:18:40,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:40 BoogieIcfgContainer [2018-11-23 02:18:40,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:18:40,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:18:40,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:18:40,880 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:18:40,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:18:39" (1/3) ... [2018-11-23 02:18:40,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e15d1a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:18:40, skipping insertion in model container [2018-11-23 02:18:40,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:18:39" (2/3) ... [2018-11-23 02:18:40,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e15d1a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:18:40, skipping insertion in model container [2018-11-23 02:18:40,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:18:40" (3/3) ... [2018-11-23 02:18:40,883 INFO L112 eAbstractionObserver]: Analyzing ICFG zonotope_2_true-unreach-call_true-termination.c [2018-11-23 02:18:40,893 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:18:40,899 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:18:40,914 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:18:40,939 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:18:40,939 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:18:40,940 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:18:40,940 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:18:40,940 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:18:40,940 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:18:40,940 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:18:40,940 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:18:40,940 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:18:40,955 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 02:18:40,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 02:18:40,960 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:18:40,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:18:40,962 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:18:40,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:18:40,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1296848067, now seen corresponding path program 1 times [2018-11-23 02:18:40,970 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:18:40,970 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 02:18:40,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:18:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:18:41,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:18:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:18:41,031 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:18:41,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:18:41,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:18:41,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 02:18:41,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 02:18:41,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:18:41,056 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2018-11-23 02:18:41,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:18:41,069 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2018-11-23 02:18:41,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 02:18:41,069 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 02:18:41,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:18:41,075 INFO L225 Difference]: With dead ends: 37 [2018-11-23 02:18:41,075 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 02:18:41,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 02:18:41,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 02:18:41,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 02:18:41,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 02:18:41,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-23 02:18:41,104 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2018-11-23 02:18:41,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:18:41,104 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-23 02:18:41,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 02:18:41,105 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-11-23 02:18:41,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 02:18:41,106 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:18:41,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:18:41,106 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:18:41,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:18:41,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1304236235, now seen corresponding path program 1 times [2018-11-23 02:18:41,107 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:18:41,107 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 02:18:41,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:18:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:18:41,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:18:41,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:18:41,173 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:18:41,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:18:41,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:18:41,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:18:41,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:18:41,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:18:41,186 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 3 states. [2018-11-23 02:18:43,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:18:43,326 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 02:18:43,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:18:43,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 02:18:43,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:18:43,327 INFO L225 Difference]: With dead ends: 24 [2018-11-23 02:18:43,327 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 02:18:43,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:18:43,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 02:18:43,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 02:18:43,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 02:18:43,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-11-23 02:18:43,332 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2018-11-23 02:18:43,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:18:43,332 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 02:18:43,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:18:43,333 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-11-23 02:18:43,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 02:18:43,333 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:18:43,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:18:43,333 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:18:43,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:18:43,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1302508357, now seen corresponding path program 1 times [2018-11-23 02:18:43,334 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:18:43,334 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-23 02:18:43,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:18:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:18:43,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:18:43,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:18:43,571 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:18:43,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:18:43,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 02:18:43,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:18:43,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:18:43,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:18:43,581 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 6 states. [2018-11-23 02:18:47,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:18:47,894 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-23 02:18:47,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:18:47,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-11-23 02:18:47,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:18:47,895 INFO L225 Difference]: With dead ends: 28 [2018-11-23 02:18:47,895 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 02:18:47,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:18:47,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 02:18:47,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2018-11-23 02:18:47,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 02:18:47,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 02:18:47,904 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 10 [2018-11-23 02:18:47,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:18:47,904 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 02:18:47,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:18:47,905 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 02:18:47,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 02:18:47,905 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:18:47,905 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:18:47,906 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:18:47,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:18:47,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1114370205, now seen corresponding path program 1 times [2018-11-23 02:18:47,906 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:18:47,907 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-23 02:18:47,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:18:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:18:48,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:18:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 02:18:48,182 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 02:18:48,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:18:48,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 02:18:48,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:18:48,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:18:48,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:18:48,197 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 6 states. [2018-11-23 02:18:52,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:18:52,499 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-23 02:18:52,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:18:52,500 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 02:18:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:18:52,501 INFO L225 Difference]: With dead ends: 32 [2018-11-23 02:18:52,501 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 02:18:52,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:18:52,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 02:18:52,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-11-23 02:18:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 02:18:52,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 02:18:52,507 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 15 [2018-11-23 02:18:52,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:18:52,507 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 02:18:52,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:18:52,507 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 02:18:52,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 02:18:52,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:18:52,508 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:18:52,508 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:18:52,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:18:52,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1880620107, now seen corresponding path program 1 times [2018-11-23 02:18:52,509 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:18:52,509 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-23 02:18:52,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:18:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:18:52,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:18:52,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 02:18:52,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:18:52,754 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 02:18:52,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:18:52,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 02:18:52,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:18:52,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:18:52,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:18:52,767 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 6 states. [2018-11-23 02:18:57,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:18:57,029 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-23 02:18:57,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 02:18:57,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 02:18:57,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:18:57,030 INFO L225 Difference]: With dead ends: 40 [2018-11-23 02:18:57,030 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 02:18:57,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 02:18:57,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 02:18:57,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 02:18:57,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 02:18:57,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 02:18:57,038 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2018-11-23 02:18:57,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:18:57,038 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 02:18:57,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:18:57,038 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 02:18:57,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 02:18:57,039 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:18:57,039 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:18:57,039 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:18:57,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:18:57,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1878892229, now seen corresponding path program 1 times [2018-11-23 02:18:57,040 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:18:57,040 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-23 02:18:57,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:18:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:18:57,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:18:57,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 02:18:57,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:18:59,509 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) c_main_~x1~0) .cse1) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:19:03,444 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2))) .cse2) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:19:05,501 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2))) .cse2) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:19:05,513 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2018-11-23 02:19:05,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:19:05,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 02:19:05,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 02:19:05,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 02:19:05,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=69, Unknown=3, NotChecked=34, Total=132 [2018-11-23 02:19:05,528 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 12 states. [2018-11-23 02:19:07,575 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2))) .cse2) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2)) .cse2))))) (and (= c_main_~y1~0 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (fp.geq .cse0 (_ +zero 8 24)) (= ((_ to_fp 8 24) roundNearestTiesToEven 12.0) c_main_~x1~0) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:19:09,629 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2))) .cse2) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2)) .cse2))))) (and (= c_main_~y1~0 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (fp.geq .cse0 (_ +zero 8 24)) (= ((_ to_fp 8 24) roundNearestTiesToEven 12.0) c_main_~x1~0) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:19:11,829 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 16.0))) (and (fp.geq .cse0 (_ +zero 8 24)) (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse1 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse2))) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= c_main_~x1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse1) .cse2) (fp.div roundNearestTiesToEven .cse4 .cse2)))))) is different from true [2018-11-23 02:19:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:19:16,172 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 02:19:16,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:19:16,176 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-11-23 02:19:16,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:19:16,176 INFO L225 Difference]: With dead ends: 39 [2018-11-23 02:19:16,177 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 02:19:16,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=36, Invalid=84, Unknown=6, NotChecked=84, Total=210 [2018-11-23 02:19:16,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 02:19:16,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 02:19:16,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 02:19:16,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-23 02:19:16,184 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 22 [2018-11-23 02:19:16,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:19:16,184 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-23 02:19:16,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 02:19:16,184 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-23 02:19:16,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:19:16,185 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:19:16,185 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:19:16,185 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:19:16,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:19:16,186 INFO L82 PathProgramCache]: Analyzing trace with hash 524266525, now seen corresponding path program 2 times [2018-11-23 02:19:16,186 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:19:16,186 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-23 02:19:16,189 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 02:19:16,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:19:16,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:19:16,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:19:16,561 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 02:19:16,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:19:18,618 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) c_main_~y1~0) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:19:22,426 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2)) .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2018-11-23 02:19:24,484 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2)) .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2018-11-23 02:19:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 3 not checked. [2018-11-23 02:19:24,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:19:24,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 02:19:24,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 02:19:24,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 02:19:24,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=69, Unknown=3, NotChecked=34, Total=132 [2018-11-23 02:19:24,509 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 12 states. [2018-11-23 02:19:26,555 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2)) .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2))) .cse2))))) (and (= c_main_~y1~0 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= ((_ to_fp 8 24) roundNearestTiesToEven 12.0) c_main_~x1~0) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2018-11-23 02:19:28,614 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2)) .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2))) .cse2))))) (and (= c_main_~y1~0 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= ((_ to_fp 8 24) roundNearestTiesToEven 12.0) c_main_~x1~0) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2018-11-23 02:19:33,525 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~y1~0) .cse2))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 16.0))) (and (fp.geq .cse0 (_ +zero 8 24)) (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse1 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse2))) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= c_main_~x1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse1) .cse2) (fp.div roundNearestTiesToEven .cse4 .cse2)))))) is different from true [2018-11-23 02:19:35,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:19:35,749 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-23 02:19:35,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:19:35,752 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-23 02:19:35,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:19:35,753 INFO L225 Difference]: With dead ends: 43 [2018-11-23 02:19:35,753 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 02:19:35,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=41, Invalid=101, Unknown=6, NotChecked=92, Total=240 [2018-11-23 02:19:35,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 02:19:35,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 02:19:35,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 02:19:35,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-11-23 02:19:35,760 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 27 [2018-11-23 02:19:35,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:19:35,761 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-23 02:19:35,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 02:19:35,761 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-23 02:19:35,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 02:19:35,761 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:19:35,762 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:19:35,762 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:19:35,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:19:35,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1674791493, now seen corresponding path program 3 times [2018-11-23 02:19:35,762 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:19:35,763 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/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-23 02:19:35,770 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 02:19:36,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 02:19:36,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:19:36,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:19:36,354 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 02:19:36,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:20:08,334 WARN L180 SmtUtils]: Spent 10.17 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 02:20:10,405 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2))) .cse2) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:20:12,469 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2))) .cse2) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:20:14,570 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3))) .cse3) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:20:16,664 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3))) .cse3) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:20:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 7 not checked. [2018-11-23 02:20:16,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:20:16,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 02:20:16,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 02:20:16,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 02:20:16,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=96, Unknown=10, NotChecked=42, Total=182 [2018-11-23 02:20:16,703 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 14 states. [2018-11-23 02:20:18,815 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3))) .cse3) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3)) .cse3)))))) (and (= c_main_~y1~0 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (= ((_ to_fp 8 24) roundNearestTiesToEven 12.0) c_main_~x1~0) (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:20:20,858 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2))) .cse2) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~y1~0) .cse2)) .cse2))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 16.0))) (and (fp.geq .cse0 (_ +zero 8 24)) (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse1 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse2))) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= c_main_~x1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse1) .cse2) (fp.div roundNearestTiesToEven .cse4 .cse2)))))) is different from false [2018-11-23 02:20:22,913 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2))) .cse2) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~y1~0) .cse2)) .cse2))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 16.0))) (and (fp.geq .cse0 (_ +zero 8 24)) (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse1 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse2))) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= c_main_~x1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse1) .cse2) (fp.div roundNearestTiesToEven .cse4 .cse2)))))) is different from true [2018-11-23 02:20:37,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:20:37,059 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-11-23 02:20:37,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:20:37,060 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-11-23 02:20:37,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:20:37,060 INFO L225 Difference]: With dead ends: 52 [2018-11-23 02:20:37,060 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 02:20:37,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 49.7s TimeCoverageRelationStatistics Valid=49, Invalid=136, Unknown=13, NotChecked=108, Total=306 [2018-11-23 02:20:37,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 02:20:37,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-11-23 02:20:37,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 02:20:37,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-23 02:20:37,067 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 34 [2018-11-23 02:20:37,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:20:37,068 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-23 02:20:37,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 02:20:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-23 02:20:37,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 02:20:37,069 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:20:37,069 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:20:37,069 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:20:37,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:20:37,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1322657693, now seen corresponding path program 4 times [2018-11-23 02:20:37,069 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:20:37,070 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-11-23 02:20:37,073 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:20:37,516 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:20:37,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:20:37,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:20:37,666 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 02:20:37,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:20:39,735 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) c_main_~y1~0) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:20:41,758 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) c_main_~y1~0) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:20:43,830 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2)) .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2018-11-23 02:20:45,896 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2)) .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2018-11-23 02:20:48,005 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:20:50,112 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:20:50,125 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 10 not checked. [2018-11-23 02:20:50,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:20:50,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 02:20:50,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 02:20:50,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 02:20:50,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=85, Unknown=6, NotChecked=60, Total=182 [2018-11-23 02:20:50,141 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 14 states. [2018-11-23 02:20:52,251 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3)))))) (and (= c_main_~y1~0 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= ((_ to_fp 8 24) roundNearestTiesToEven 12.0) c_main_~x1~0))) is different from true [2018-11-23 02:20:54,304 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2)) .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~y1~0) .cse2))) .cse2))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 16.0))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse1 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse2))) (fp.geq .cse0 (_ +zero 8 24)) (= c_main_~x1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse1) .cse2) (fp.div roundNearestTiesToEven .cse4 .cse2)))))) is different from false [2018-11-23 02:20:56,368 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2)) .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~y1~0) .cse2))) .cse2))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 16.0))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse1 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse2))) (fp.geq .cse0 (_ +zero 8 24)) (= c_main_~x1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse1) .cse2) (fp.div roundNearestTiesToEven .cse4 .cse2)))))) is different from true [2018-11-23 02:21:00,372 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3))) (.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) c_main_~x1~0) (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3)))))) is different from true [2018-11-23 02:21:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:21:08,547 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-11-23 02:21:08,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:21:08,592 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2018-11-23 02:21:08,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:21:08,592 INFO L225 Difference]: With dead ends: 56 [2018-11-23 02:21:08,593 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 02:21:08,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=48, Invalid=122, Unknown=10, NotChecked=162, Total=342 [2018-11-23 02:21:08,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 02:21:08,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-11-23 02:21:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 02:21:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-11-23 02:21:08,604 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 39 [2018-11-23 02:21:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:21:08,604 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-11-23 02:21:08,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 02:21:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-11-23 02:21:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 02:21:08,605 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:21:08,606 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:21:08,606 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:21:08,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:21:08,606 INFO L82 PathProgramCache]: Analyzing trace with hash -119411531, now seen corresponding path program 2 times [2018-11-23 02:21:08,607 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:21:08,607 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-11-23 02:21:08,610 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 02:21:09,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:21:09,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:21:09,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:21:09,141 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 02:21:09,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:21:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-23 02:21:09,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:21:09,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 02:21:09,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 02:21:09,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 02:21:09,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-23 02:21:09,219 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 10 states. [2018-11-23 02:21:17,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:21:17,913 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-23 02:21:17,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:21:17,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-11-23 02:21:17,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:21:17,914 INFO L225 Difference]: With dead ends: 72 [2018-11-23 02:21:17,915 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 02:21:17,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-11-23 02:21:17,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 02:21:17,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-23 02:21:17,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 02:21:17,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2018-11-23 02:21:17,925 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 46 [2018-11-23 02:21:17,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:21:17,926 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2018-11-23 02:21:17,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 02:21:17,926 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-23 02:21:17,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 02:21:17,927 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:21:17,927 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:21:17,927 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:21:17,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:21:17,927 INFO L82 PathProgramCache]: Analyzing trace with hash -117683653, now seen corresponding path program 5 times [2018-11-23 02:21:17,928 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:21:17,928 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-11-23 02:21:17,932 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-23 02:21:18,688 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 02:21:18,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:21:18,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:21:18,909 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 14 proven. 31 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-23 02:21:18,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:21:20,975 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) c_main_~x1~0) .cse1) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:21:23,871 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2))) .cse2) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:21:25,941 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2))) .cse2) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:21:28,054 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3))) .cse3) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:21:30,163 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3))) .cse3) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:21:32,305 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (let ((.cse0 (not (fp.geq c_main_~y1~0 (_ +zero 8 24)))) (.cse1 (not (fp.leq c_main_~y1~0 .cse3))) (.cse2 (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~x1~0) .cse6) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse6))) (.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse6) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~y1~0) .cse6)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse5) .cse6) (fp.div roundNearestTiesToEven .cse7 .cse6))) .cse6) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse6) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse7) .cse6)) .cse6)))))) (and (or .cse0 .cse1 (fp.leq .cse2 .cse3)) (or .cse0 .cse1 (fp.geq .cse2 (_ +zero 8 24)))))) is different from false [2018-11-23 02:21:34,414 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (let ((.cse0 (not (fp.geq c_main_~y1~0 (_ +zero 8 24)))) (.cse1 (not (fp.leq c_main_~y1~0 .cse3))) (.cse2 (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~x1~0) .cse6) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse6))) (.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse6) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~y1~0) .cse6)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse5) .cse6) (fp.div roundNearestTiesToEven .cse7 .cse6))) .cse6) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse6) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse7) .cse6)) .cse6)))))) (and (or .cse0 .cse1 (fp.leq .cse2 .cse3)) (or .cse0 .cse1 (fp.geq .cse2 (_ +zero 8 24)))))) is different from true [2018-11-23 02:22:46,841 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or .cse0 (forall ((v_prenex_9 (_ FloatingPoint 8 24)) (v_prenex_10 (_ FloatingPoint 8 24))) (or (fp.leq (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 v_prenex_9) .cse3) (fp.div roundNearestTiesToEven v_prenex_10 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_9 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 v_prenex_10) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3))) .cse3) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3)) .cse3)))) ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq v_prenex_10 (_ +zero 8 24))))) (or (forall ((v_prenex_18 (_ FloatingPoint 8 24)) (v_prenex_17 (_ FloatingPoint 8 24))) (let ((.cse5 (let ((.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse9 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 v_prenex_18) .cse9) (fp.div roundNearestTiesToEven v_prenex_17 .cse9))) (.cse10 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_18 .cse9) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 v_prenex_17) .cse9)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse8) .cse9) (fp.div roundNearestTiesToEven .cse10 .cse9))) .cse9) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse8 .cse9) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse10) .cse9)) .cse9))))) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (not (fp.geq .cse5 (_ +zero 8 24))) (fp.leq .cse5 .cse6) (fp.leq v_prenex_17 .cse6)))) .cse0) (or .cse0 (forall ((v_prenex_14 (_ FloatingPoint 8 24)) (v_prenex_13 (_ FloatingPoint 8 24))) (or (fp.geq (let ((.cse11 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse13 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse12 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse11 v_prenex_14) .cse13) (fp.div roundNearestTiesToEven v_prenex_13 .cse13))) (.cse14 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_14 .cse13) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse11 v_prenex_13) .cse13)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse11 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse11 .cse12) .cse13) (fp.div roundNearestTiesToEven .cse14 .cse13))) .cse13) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse12 .cse13) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse11 .cse14) .cse13)) .cse13)))) (_ +zero 8 24)) (fp.geq v_prenex_13 (_ +zero 8 24)) (fp.leq v_prenex_13 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) (or .cse0 (forall ((v_prenex_7 (_ FloatingPoint 8 24)) (v_prenex_8 (_ FloatingPoint 8 24))) (let ((.cse19 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (fp.leq (let ((.cse15 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse17 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse16 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse15 v_prenex_7) .cse17) (fp.div roundNearestTiesToEven v_prenex_8 .cse17))) (.cse18 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_7 .cse17) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse15 v_prenex_8) .cse17)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse15 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse15 .cse16) .cse17) (fp.div roundNearestTiesToEven .cse18 .cse17))) .cse17) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse16 .cse17) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse15 .cse18) .cse17)) .cse17)))) .cse19) (fp.geq v_prenex_8 (_ +zero 8 24)) (fp.leq v_prenex_8 .cse19))))) (or .cse0 (forall ((v_prenex_3 (_ FloatingPoint 8 24)) (v_prenex_4 (_ FloatingPoint 8 24))) (or (fp.geq (let ((.cse20 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse21 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse20 v_prenex_3) .cse22) (fp.div roundNearestTiesToEven v_prenex_4 .cse22))) (.cse23 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_3 .cse22) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse20 v_prenex_4) .cse22)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse20 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse20 .cse21) .cse22) (fp.div roundNearestTiesToEven .cse23 .cse22))) .cse22) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse21 .cse22) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse20 .cse23) .cse22)) .cse22)))) (_ +zero 8 24)) (fp.leq v_prenex_4 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) (or .cse0 (forall ((v_prenex_12 (_ FloatingPoint 8 24)) (v_prenex_11 (_ FloatingPoint 8 24))) (let ((.cse24 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (fp.leq v_prenex_12 .cse24) (fp.leq (let ((.cse25 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse27 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse26 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse25 v_prenex_11) .cse27) (fp.div roundNearestTiesToEven v_prenex_12 .cse27))) (.cse28 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_11 .cse27) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse25 v_prenex_12) .cse27)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse25 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse25 .cse26) .cse27) (fp.div roundNearestTiesToEven .cse28 .cse27))) .cse27) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse26 .cse27) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse25 .cse28) .cse27)) .cse27)))) .cse24))))) (or (forall ((v_prenex_1 (_ FloatingPoint 8 24)) (v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse29 (let ((.cse30 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse32 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse31 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse30 v_prenex_1) .cse32) (fp.div roundNearestTiesToEven v_prenex_2 .cse32))) (.cse33 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_1 .cse32) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse30 v_prenex_2) .cse32)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse30 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse30 .cse31) .cse32) (fp.div roundNearestTiesToEven .cse33 .cse32))) .cse32) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse31 .cse32) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse30 .cse33) .cse32)) .cse32)))))) (or (fp.leq .cse29 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq v_prenex_2 (_ +zero 8 24)) (not (fp.geq .cse29 (_ +zero 8 24)))))) .cse0) (or (forall ((v_prenex_5 (_ FloatingPoint 8 24)) (v_prenex_6 (_ FloatingPoint 8 24))) (let ((.cse35 (let ((.cse36 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse38 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse37 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse36 v_prenex_5) .cse38) (fp.div roundNearestTiesToEven v_prenex_6 .cse38))) (.cse39 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_5 .cse38) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse36 v_prenex_6) .cse38)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse36 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse36 .cse37) .cse38) (fp.div roundNearestTiesToEven .cse39 .cse38))) .cse38) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse37 .cse38) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse36 .cse39) .cse38)) .cse38))))) (.cse34 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (fp.leq v_prenex_6 .cse34) (fp.geq .cse35 (_ +zero 8 24)) (not (fp.leq .cse35 .cse34))))) .cse0) (or (forall ((v_main_~x1~0_BEFORE_CALL_39 (_ FloatingPoint 8 24)) (v_main_~y1~0_BEFORE_CALL_43 (_ FloatingPoint 8 24))) (or (fp.geq v_main_~y1~0_BEFORE_CALL_43 (_ +zero 8 24)) (fp.geq (let ((.cse40 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse42 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse41 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse40 v_main_~x1~0_BEFORE_CALL_39) .cse42) (fp.div roundNearestTiesToEven v_main_~y1~0_BEFORE_CALL_43 .cse42))) (.cse43 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_main_~x1~0_BEFORE_CALL_39 .cse42) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse40 v_main_~y1~0_BEFORE_CALL_43) .cse42)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse40 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse40 .cse41) .cse42) (fp.div roundNearestTiesToEven .cse43 .cse42))) .cse42) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse41 .cse42) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse40 .cse43) .cse42)) .cse42)))) (_ +zero 8 24)))) .cse0) (or .cse0 (forall ((v_prenex_16 (_ FloatingPoint 8 24)) (v_prenex_15 (_ FloatingPoint 8 24))) (let ((.cse44 (let ((.cse45 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse47 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse46 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse45 v_prenex_16) .cse47) (fp.div roundNearestTiesToEven v_prenex_15 .cse47))) (.cse48 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_16 .cse47) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse45 v_prenex_15) .cse47)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse45 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse45 .cse46) .cse47) (fp.div roundNearestTiesToEven .cse48 .cse47))) .cse47) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse46 .cse47) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse45 .cse48) .cse47)) .cse47)))))) (or (not (fp.leq .cse44 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (fp.geq v_prenex_15 (_ +zero 8 24)) (fp.geq .cse44 (_ +zero 8 24)))))))) is different from true [2018-11-23 02:24:14,516 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse7 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or .cse0 (forall ((v_prenex_18 (_ FloatingPoint 8 24)) (v_prenex_17 (_ FloatingPoint 8 24))) (let ((.cse1 (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 v_prenex_18) .cse5) (fp.div roundNearestTiesToEven v_prenex_17 .cse5))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_18 .cse5) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 v_prenex_17) .cse5)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse5) (fp.div roundNearestTiesToEven .cse6 .cse5))) .cse5) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse4 .cse5) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse6) .cse5)) .cse5))))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (not (fp.geq .cse1 (_ +zero 8 24))) (fp.leq .cse1 .cse2) (fp.leq v_prenex_17 .cse2)))) .cse7) (or .cse0 (forall ((v_main_~x1~0_BEFORE_CALL_39 (_ FloatingPoint 8 24)) (v_main_~y1~0_BEFORE_CALL_43 (_ FloatingPoint 8 24))) (or (fp.geq v_main_~y1~0_BEFORE_CALL_43 (_ +zero 8 24)) (fp.geq (let ((.cse8 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse10 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 v_main_~x1~0_BEFORE_CALL_39) .cse10) (fp.div roundNearestTiesToEven v_main_~y1~0_BEFORE_CALL_43 .cse10))) (.cse11 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_main_~x1~0_BEFORE_CALL_39 .cse10) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 v_main_~y1~0_BEFORE_CALL_43) .cse10)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 .cse9) .cse10) (fp.div roundNearestTiesToEven .cse11 .cse10))) .cse10) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse9 .cse10) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 .cse11) .cse10)) .cse10)))) (_ +zero 8 24)))) .cse7) (or .cse0 .cse7 (forall ((v_prenex_16 (_ FloatingPoint 8 24)) (v_prenex_15 (_ FloatingPoint 8 24))) (let ((.cse12 (let ((.cse13 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse15 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse14 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 v_prenex_16) .cse15) (fp.div roundNearestTiesToEven v_prenex_15 .cse15))) (.cse16 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_16 .cse15) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 v_prenex_15) .cse15)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse14) .cse15) (fp.div roundNearestTiesToEven .cse16 .cse15))) .cse15) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse14 .cse15) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse16) .cse15)) .cse15)))))) (or (not (fp.leq .cse12 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (fp.geq v_prenex_15 (_ +zero 8 24)) (fp.geq .cse12 (_ +zero 8 24)))))) (or .cse0 .cse7 (forall ((v_prenex_7 (_ FloatingPoint 8 24)) (v_prenex_8 (_ FloatingPoint 8 24))) (let ((.cse21 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (fp.leq (let ((.cse17 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse19 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse18 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse17 v_prenex_7) .cse19) (fp.div roundNearestTiesToEven v_prenex_8 .cse19))) (.cse20 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_7 .cse19) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse17 v_prenex_8) .cse19)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse17 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse17 .cse18) .cse19) (fp.div roundNearestTiesToEven .cse20 .cse19))) .cse19) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse18 .cse19) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse17 .cse20) .cse19)) .cse19)))) .cse21) (fp.geq v_prenex_8 (_ +zero 8 24)) (fp.leq v_prenex_8 .cse21))))) (or .cse0 (forall ((v_prenex_5 (_ FloatingPoint 8 24)) (v_prenex_6 (_ FloatingPoint 8 24))) (let ((.cse23 (let ((.cse24 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse26 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse25 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse24 v_prenex_5) .cse26) (fp.div roundNearestTiesToEven v_prenex_6 .cse26))) (.cse27 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_5 .cse26) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse24 v_prenex_6) .cse26)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse24 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse24 .cse25) .cse26) (fp.div roundNearestTiesToEven .cse27 .cse26))) .cse26) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse25 .cse26) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse24 .cse27) .cse26)) .cse26))))) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (fp.leq v_prenex_6 .cse22) (fp.geq .cse23 (_ +zero 8 24)) (not (fp.leq .cse23 .cse22))))) .cse7) (or .cse0 .cse7 (forall ((v_prenex_9 (_ FloatingPoint 8 24)) (v_prenex_10 (_ FloatingPoint 8 24))) (or (fp.leq (let ((.cse28 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse30 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse29 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse28 v_prenex_9) .cse30) (fp.div roundNearestTiesToEven v_prenex_10 .cse30))) (.cse31 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_9 .cse30) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse28 v_prenex_10) .cse30)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse28 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse28 .cse29) .cse30) (fp.div roundNearestTiesToEven .cse31 .cse30))) .cse30) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse29 .cse30) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse28 .cse31) .cse30)) .cse30)))) ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq v_prenex_10 (_ +zero 8 24))))) (or .cse0 .cse7 (forall ((v_prenex_14 (_ FloatingPoint 8 24)) (v_prenex_13 (_ FloatingPoint 8 24))) (or (fp.geq (let ((.cse32 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse34 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse33 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse32 v_prenex_14) .cse34) (fp.div roundNearestTiesToEven v_prenex_13 .cse34))) (.cse35 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_14 .cse34) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse32 v_prenex_13) .cse34)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse32 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse32 .cse33) .cse34) (fp.div roundNearestTiesToEven .cse35 .cse34))) .cse34) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse33 .cse34) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse32 .cse35) .cse34)) .cse34)))) (_ +zero 8 24)) (fp.geq v_prenex_13 (_ +zero 8 24)) (fp.leq v_prenex_13 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) (or .cse0 .cse7 (forall ((v_prenex_12 (_ FloatingPoint 8 24)) (v_prenex_11 (_ FloatingPoint 8 24))) (let ((.cse36 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (fp.leq v_prenex_12 .cse36) (fp.leq (let ((.cse37 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse39 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse38 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse37 v_prenex_11) .cse39) (fp.div roundNearestTiesToEven v_prenex_12 .cse39))) (.cse40 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_11 .cse39) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse37 v_prenex_12) .cse39)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse37 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse37 .cse38) .cse39) (fp.div roundNearestTiesToEven .cse40 .cse39))) .cse39) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse38 .cse39) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse37 .cse40) .cse39)) .cse39)))) .cse36))))) (or .cse0 .cse7 (forall ((v_prenex_3 (_ FloatingPoint 8 24)) (v_prenex_4 (_ FloatingPoint 8 24))) (or (fp.geq (let ((.cse41 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse43 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse42 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse41 v_prenex_3) .cse43) (fp.div roundNearestTiesToEven v_prenex_4 .cse43))) (.cse44 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_3 .cse43) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse41 v_prenex_4) .cse43)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse41 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse41 .cse42) .cse43) (fp.div roundNearestTiesToEven .cse44 .cse43))) .cse43) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse42 .cse43) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse41 .cse44) .cse43)) .cse43)))) (_ +zero 8 24)) (fp.leq v_prenex_4 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) (or .cse0 (forall ((v_prenex_1 (_ FloatingPoint 8 24)) (v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse45 (let ((.cse46 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse48 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse47 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 v_prenex_1) .cse48) (fp.div roundNearestTiesToEven v_prenex_2 .cse48))) (.cse49 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_1 .cse48) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 v_prenex_2) .cse48)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 .cse47) .cse48) (fp.div roundNearestTiesToEven .cse49 .cse48))) .cse48) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse47 .cse48) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 .cse49) .cse48)) .cse48)))))) (or (fp.leq .cse45 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq v_prenex_2 (_ +zero 8 24)) (not (fp.geq .cse45 (_ +zero 8 24)))))) .cse7))) is different from true [2018-11-23 02:24:16,685 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse7) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_main_~y1~0) .cse7)))) (let ((.cse0 (not (fp.geq .cse4 (_ +zero 8 24)))) (.cse1 (let ((.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_main_~x1~0) .cse7) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse7)))) (let ((.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse9) .cse7) (fp.div roundNearestTiesToEven .cse4 .cse7))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse9 .cse7) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse4) .cse7)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse6) .cse7) (fp.div roundNearestTiesToEven .cse8 .cse7))) .cse7) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse6 .cse7) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse8) .cse7)) .cse7))))) (.cse3 (not (fp.leq .cse4 .cse2)))) (and (or .cse0 (fp.leq .cse1 .cse2) .cse3) (or .cse0 (fp.geq .cse1 (_ +zero 8 24)) .cse3))))) is different from false [2018-11-23 02:24:18,849 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse7) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_main_~y1~0) .cse7)))) (let ((.cse0 (not (fp.geq .cse4 (_ +zero 8 24)))) (.cse1 (let ((.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_main_~x1~0) .cse7) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse7)))) (let ((.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse9) .cse7) (fp.div roundNearestTiesToEven .cse4 .cse7))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse9 .cse7) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse4) .cse7)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse6) .cse7) (fp.div roundNearestTiesToEven .cse8 .cse7))) .cse7) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse6 .cse7) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse8) .cse7)) .cse7))))) (.cse3 (not (fp.leq .cse4 .cse2)))) (and (or .cse0 (fp.leq .cse1 .cse2) .cse3) (or .cse0 (fp.geq .cse1 (_ +zero 8 24)) .cse3))))) is different from true [2018-11-23 02:24:18,885 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 14 proven. 0 refuted. 12 times theorem prover too weak. 45 trivial. 19 not checked. [2018-11-23 02:24:18,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:24:18,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2018-11-23 02:24:18,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 02:24:18,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 02:24:18,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=129, Unknown=11, NotChecked=196, Total=380 [2018-11-23 02:24:18,901 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 20 states. [2018-11-23 02:24:21,053 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse7) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_main_~y1~0) .cse7)))) (let ((.cse0 (not (fp.geq .cse4 (_ +zero 8 24)))) (.cse1 (let ((.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_main_~x1~0) .cse7) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse7)))) (let ((.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse9) .cse7) (fp.div roundNearestTiesToEven .cse4 .cse7))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse9 .cse7) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse4) .cse7)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse6) .cse7) (fp.div roundNearestTiesToEven .cse8 .cse7))) .cse7) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse6 .cse7) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse8) .cse7)) .cse7))))) (.cse3 (not (fp.leq .cse4 .cse2)))) (and (= c_main_~y1~0 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (or .cse0 (fp.leq .cse1 .cse2) .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven 12.0) c_main_~x1~0) (or .cse0 (fp.geq .cse1 (_ +zero 8 24)) .cse3))))) is different from false [2018-11-23 02:24:23,222 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse7) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_main_~y1~0) .cse7)))) (let ((.cse0 (not (fp.geq .cse4 (_ +zero 8 24)))) (.cse1 (let ((.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 c_main_~x1~0) .cse7) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse7)))) (let ((.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse9) .cse7) (fp.div roundNearestTiesToEven .cse4 .cse7))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse9 .cse7) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse4) .cse7)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse6) .cse7) (fp.div roundNearestTiesToEven .cse8 .cse7))) .cse7) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse6 .cse7) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 .cse8) .cse7)) .cse7))))) (.cse3 (not (fp.leq .cse4 .cse2)))) (and (= c_main_~y1~0 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (or .cse0 (fp.leq .cse1 .cse2) .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven 12.0) c_main_~x1~0) (or .cse0 (fp.geq .cse1 (_ +zero 8 24)) .cse3))))) is different from true [2018-11-23 02:24:25,324 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 4.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (let ((.cse0 (not (fp.geq c_main_~y1~0 (_ +zero 8 24)))) (.cse1 (not (fp.leq c_main_~y1~0 .cse3))) (.cse2 (let ((.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 c_main_~x1~0) .cse5) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse5))) (.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse5) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 c_main_~y1~0) .cse5)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse8) .cse5) (fp.div roundNearestTiesToEven .cse9 .cse5))) .cse5) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse8 .cse5) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse9) .cse5)) .cse5)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 16.0))) (and (or .cse0 .cse1 (fp.leq .cse2 .cse3)) (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse4 .cse5) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse7) .cse5))) (or .cse0 .cse1 (fp.geq .cse2 (_ +zero 8 24))) (= c_main_~x1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse4) .cse5) (fp.div roundNearestTiesToEven .cse7 .cse5)))))) is different from false [2018-11-23 02:24:27,450 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 4.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (let ((.cse0 (not (fp.geq c_main_~y1~0 (_ +zero 8 24)))) (.cse1 (not (fp.leq c_main_~y1~0 .cse3))) (.cse2 (let ((.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 c_main_~x1~0) .cse5) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse5))) (.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse5) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 c_main_~y1~0) .cse5)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse8) .cse5) (fp.div roundNearestTiesToEven .cse9 .cse5))) .cse5) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse8 .cse5) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse9) .cse5)) .cse5)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 16.0))) (and (or .cse0 .cse1 (fp.leq .cse2 .cse3)) (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse4 .cse5) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse7) .cse5))) (or .cse0 .cse1 (fp.geq .cse2 (_ +zero 8 24))) (= c_main_~x1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse4) .cse5) (fp.div roundNearestTiesToEven .cse7 .cse5)))))) is different from true [2018-11-23 02:24:30,902 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse7 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or .cse0 (forall ((v_prenex_18 (_ FloatingPoint 8 24)) (v_prenex_17 (_ FloatingPoint 8 24))) (let ((.cse1 (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 v_prenex_18) .cse5) (fp.div roundNearestTiesToEven v_prenex_17 .cse5))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_18 .cse5) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 v_prenex_17) .cse5)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse5) (fp.div roundNearestTiesToEven .cse6 .cse5))) .cse5) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse4 .cse5) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse6) .cse5)) .cse5))))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (not (fp.geq .cse1 (_ +zero 8 24))) (fp.leq .cse1 .cse2) (fp.leq v_prenex_17 .cse2)))) .cse7) (or .cse0 (forall ((v_main_~x1~0_BEFORE_CALL_39 (_ FloatingPoint 8 24)) (v_main_~y1~0_BEFORE_CALL_43 (_ FloatingPoint 8 24))) (or (fp.geq v_main_~y1~0_BEFORE_CALL_43 (_ +zero 8 24)) (fp.geq (let ((.cse8 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse10 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 v_main_~x1~0_BEFORE_CALL_39) .cse10) (fp.div roundNearestTiesToEven v_main_~y1~0_BEFORE_CALL_43 .cse10))) (.cse11 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_main_~x1~0_BEFORE_CALL_39 .cse10) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 v_main_~y1~0_BEFORE_CALL_43) .cse10)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 .cse9) .cse10) (fp.div roundNearestTiesToEven .cse11 .cse10))) .cse10) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse9 .cse10) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse8 .cse11) .cse10)) .cse10)))) (_ +zero 8 24)))) .cse7) (or .cse0 .cse7 (forall ((v_prenex_16 (_ FloatingPoint 8 24)) (v_prenex_15 (_ FloatingPoint 8 24))) (let ((.cse12 (let ((.cse13 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse15 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse14 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 v_prenex_16) .cse15) (fp.div roundNearestTiesToEven v_prenex_15 .cse15))) (.cse16 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_16 .cse15) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 v_prenex_15) .cse15)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse14) .cse15) (fp.div roundNearestTiesToEven .cse16 .cse15))) .cse15) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse14 .cse15) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse16) .cse15)) .cse15)))))) (or (not (fp.leq .cse12 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (fp.geq v_prenex_15 (_ +zero 8 24)) (fp.geq .cse12 (_ +zero 8 24)))))) (or .cse0 .cse7 (forall ((v_prenex_7 (_ FloatingPoint 8 24)) (v_prenex_8 (_ FloatingPoint 8 24))) (let ((.cse21 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (fp.leq (let ((.cse17 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse19 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse18 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse17 v_prenex_7) .cse19) (fp.div roundNearestTiesToEven v_prenex_8 .cse19))) (.cse20 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_7 .cse19) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse17 v_prenex_8) .cse19)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse17 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse17 .cse18) .cse19) (fp.div roundNearestTiesToEven .cse20 .cse19))) .cse19) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse18 .cse19) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse17 .cse20) .cse19)) .cse19)))) .cse21) (fp.geq v_prenex_8 (_ +zero 8 24)) (fp.leq v_prenex_8 .cse21))))) (or .cse0 (forall ((v_prenex_5 (_ FloatingPoint 8 24)) (v_prenex_6 (_ FloatingPoint 8 24))) (let ((.cse23 (let ((.cse24 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse26 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse25 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse24 v_prenex_5) .cse26) (fp.div roundNearestTiesToEven v_prenex_6 .cse26))) (.cse27 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_5 .cse26) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse24 v_prenex_6) .cse26)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse24 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse24 .cse25) .cse26) (fp.div roundNearestTiesToEven .cse27 .cse26))) .cse26) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse25 .cse26) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse24 .cse27) .cse26)) .cse26))))) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (fp.leq v_prenex_6 .cse22) (fp.geq .cse23 (_ +zero 8 24)) (not (fp.leq .cse23 .cse22))))) .cse7) (or .cse0 .cse7 (forall ((v_prenex_9 (_ FloatingPoint 8 24)) (v_prenex_10 (_ FloatingPoint 8 24))) (or (fp.leq (let ((.cse28 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse30 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse29 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse28 v_prenex_9) .cse30) (fp.div roundNearestTiesToEven v_prenex_10 .cse30))) (.cse31 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_9 .cse30) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse28 v_prenex_10) .cse30)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse28 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse28 .cse29) .cse30) (fp.div roundNearestTiesToEven .cse31 .cse30))) .cse30) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse29 .cse30) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse28 .cse31) .cse30)) .cse30)))) ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq v_prenex_10 (_ +zero 8 24))))) (or .cse0 .cse7 (forall ((v_prenex_14 (_ FloatingPoint 8 24)) (v_prenex_13 (_ FloatingPoint 8 24))) (or (fp.geq (let ((.cse32 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse34 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse33 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse32 v_prenex_14) .cse34) (fp.div roundNearestTiesToEven v_prenex_13 .cse34))) (.cse35 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_14 .cse34) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse32 v_prenex_13) .cse34)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse32 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse32 .cse33) .cse34) (fp.div roundNearestTiesToEven .cse35 .cse34))) .cse34) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse33 .cse34) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse32 .cse35) .cse34)) .cse34)))) (_ +zero 8 24)) (fp.geq v_prenex_13 (_ +zero 8 24)) (fp.leq v_prenex_13 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) (or .cse0 .cse7 (forall ((v_prenex_12 (_ FloatingPoint 8 24)) (v_prenex_11 (_ FloatingPoint 8 24))) (let ((.cse36 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (fp.leq v_prenex_12 .cse36) (fp.leq (let ((.cse37 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse39 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse38 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse37 v_prenex_11) .cse39) (fp.div roundNearestTiesToEven v_prenex_12 .cse39))) (.cse40 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_11 .cse39) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse37 v_prenex_12) .cse39)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse37 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse37 .cse38) .cse39) (fp.div roundNearestTiesToEven .cse40 .cse39))) .cse39) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse38 .cse39) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse37 .cse40) .cse39)) .cse39)))) .cse36))))) (or .cse0 .cse7 (forall ((v_prenex_3 (_ FloatingPoint 8 24)) (v_prenex_4 (_ FloatingPoint 8 24))) (or (fp.geq (let ((.cse41 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse43 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse42 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse41 v_prenex_3) .cse43) (fp.div roundNearestTiesToEven v_prenex_4 .cse43))) (.cse44 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_3 .cse43) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse41 v_prenex_4) .cse43)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse41 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse41 .cse42) .cse43) (fp.div roundNearestTiesToEven .cse44 .cse43))) .cse43) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse42 .cse43) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse41 .cse44) .cse43)) .cse43)))) (_ +zero 8 24)) (fp.leq v_prenex_4 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) (or .cse0 (forall ((v_prenex_1 (_ FloatingPoint 8 24)) (v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse45 (let ((.cse46 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse48 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse47 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 v_prenex_1) .cse48) (fp.div roundNearestTiesToEven v_prenex_2 .cse48))) (.cse49 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_1 .cse48) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 v_prenex_2) .cse48)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 .cse47) .cse48) (fp.div roundNearestTiesToEven .cse49 .cse48))) .cse48) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse47 .cse48) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 .cse49) .cse48)) .cse48)))))) (or (fp.leq .cse45 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq v_prenex_2 (_ +zero 8 24)) (not (fp.geq .cse45 (_ +zero 8 24)))))) .cse7))) is different from true [2018-11-23 02:24:33,892 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or .cse0 (forall ((v_prenex_9 (_ FloatingPoint 8 24)) (v_prenex_10 (_ FloatingPoint 8 24))) (or (fp.leq (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 v_prenex_9) .cse3) (fp.div roundNearestTiesToEven v_prenex_10 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_9 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 v_prenex_10) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3))) .cse3) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3)) .cse3)))) ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq v_prenex_10 (_ +zero 8 24))))) (or (forall ((v_prenex_18 (_ FloatingPoint 8 24)) (v_prenex_17 (_ FloatingPoint 8 24))) (let ((.cse5 (let ((.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse9 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 v_prenex_18) .cse9) (fp.div roundNearestTiesToEven v_prenex_17 .cse9))) (.cse10 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_18 .cse9) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 v_prenex_17) .cse9)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse8) .cse9) (fp.div roundNearestTiesToEven .cse10 .cse9))) .cse9) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse8 .cse9) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse7 .cse10) .cse9)) .cse9))))) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (not (fp.geq .cse5 (_ +zero 8 24))) (fp.leq .cse5 .cse6) (fp.leq v_prenex_17 .cse6)))) .cse0) (or .cse0 (forall ((v_prenex_14 (_ FloatingPoint 8 24)) (v_prenex_13 (_ FloatingPoint 8 24))) (or (fp.geq (let ((.cse11 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse13 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse12 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse11 v_prenex_14) .cse13) (fp.div roundNearestTiesToEven v_prenex_13 .cse13))) (.cse14 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_14 .cse13) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse11 v_prenex_13) .cse13)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse11 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse11 .cse12) .cse13) (fp.div roundNearestTiesToEven .cse14 .cse13))) .cse13) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse12 .cse13) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse11 .cse14) .cse13)) .cse13)))) (_ +zero 8 24)) (fp.geq v_prenex_13 (_ +zero 8 24)) (fp.leq v_prenex_13 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) (or .cse0 (forall ((v_prenex_7 (_ FloatingPoint 8 24)) (v_prenex_8 (_ FloatingPoint 8 24))) (let ((.cse19 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (fp.leq (let ((.cse15 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse17 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse16 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse15 v_prenex_7) .cse17) (fp.div roundNearestTiesToEven v_prenex_8 .cse17))) (.cse18 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_7 .cse17) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse15 v_prenex_8) .cse17)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse15 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse15 .cse16) .cse17) (fp.div roundNearestTiesToEven .cse18 .cse17))) .cse17) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse16 .cse17) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse15 .cse18) .cse17)) .cse17)))) .cse19) (fp.geq v_prenex_8 (_ +zero 8 24)) (fp.leq v_prenex_8 .cse19))))) .cse0 (or .cse0 (forall ((v_prenex_3 (_ FloatingPoint 8 24)) (v_prenex_4 (_ FloatingPoint 8 24))) (or (fp.geq (let ((.cse20 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse21 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse20 v_prenex_3) .cse22) (fp.div roundNearestTiesToEven v_prenex_4 .cse22))) (.cse23 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_3 .cse22) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse20 v_prenex_4) .cse22)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse20 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse20 .cse21) .cse22) (fp.div roundNearestTiesToEven .cse23 .cse22))) .cse22) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse21 .cse22) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse20 .cse23) .cse22)) .cse22)))) (_ +zero 8 24)) (fp.leq v_prenex_4 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) (or .cse0 (forall ((v_prenex_12 (_ FloatingPoint 8 24)) (v_prenex_11 (_ FloatingPoint 8 24))) (let ((.cse24 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (fp.leq v_prenex_12 .cse24) (fp.leq (let ((.cse25 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse27 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse26 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse25 v_prenex_11) .cse27) (fp.div roundNearestTiesToEven v_prenex_12 .cse27))) (.cse28 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_11 .cse27) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse25 v_prenex_12) .cse27)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse25 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse25 .cse26) .cse27) (fp.div roundNearestTiesToEven .cse28 .cse27))) .cse27) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse26 .cse27) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse25 .cse28) .cse27)) .cse27)))) .cse24))))) (or (forall ((v_prenex_1 (_ FloatingPoint 8 24)) (v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse29 (let ((.cse30 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse32 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse31 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse30 v_prenex_1) .cse32) (fp.div roundNearestTiesToEven v_prenex_2 .cse32))) (.cse33 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_1 .cse32) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse30 v_prenex_2) .cse32)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse30 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse30 .cse31) .cse32) (fp.div roundNearestTiesToEven .cse33 .cse32))) .cse32) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse31 .cse32) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse30 .cse33) .cse32)) .cse32)))))) (or (fp.leq .cse29 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq v_prenex_2 (_ +zero 8 24)) (not (fp.geq .cse29 (_ +zero 8 24)))))) .cse0) (or (forall ((v_prenex_5 (_ FloatingPoint 8 24)) (v_prenex_6 (_ FloatingPoint 8 24))) (let ((.cse35 (let ((.cse36 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse38 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse37 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse36 v_prenex_5) .cse38) (fp.div roundNearestTiesToEven v_prenex_6 .cse38))) (.cse39 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_5 .cse38) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse36 v_prenex_6) .cse38)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse36 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse36 .cse37) .cse38) (fp.div roundNearestTiesToEven .cse39 .cse38))) .cse38) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse37 .cse38) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse36 .cse39) .cse38)) .cse38))))) (.cse34 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (fp.leq v_prenex_6 .cse34) (fp.geq .cse35 (_ +zero 8 24)) (not (fp.leq .cse35 .cse34))))) .cse0) (or (forall ((v_main_~x1~0_BEFORE_CALL_39 (_ FloatingPoint 8 24)) (v_main_~y1~0_BEFORE_CALL_43 (_ FloatingPoint 8 24))) (or (fp.geq v_main_~y1~0_BEFORE_CALL_43 (_ +zero 8 24)) (fp.geq (let ((.cse40 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse42 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse41 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse40 v_main_~x1~0_BEFORE_CALL_39) .cse42) (fp.div roundNearestTiesToEven v_main_~y1~0_BEFORE_CALL_43 .cse42))) (.cse43 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_main_~x1~0_BEFORE_CALL_39 .cse42) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse40 v_main_~y1~0_BEFORE_CALL_43) .cse42)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse40 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse40 .cse41) .cse42) (fp.div roundNearestTiesToEven .cse43 .cse42))) .cse42) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse41 .cse42) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse40 .cse43) .cse42)) .cse42)))) (_ +zero 8 24)))) .cse0) (or .cse0 (forall ((v_prenex_16 (_ FloatingPoint 8 24)) (v_prenex_15 (_ FloatingPoint 8 24))) (let ((.cse44 (let ((.cse45 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse47 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse46 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse45 v_prenex_16) .cse47) (fp.div roundNearestTiesToEven v_prenex_15 .cse47))) (.cse48 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_16 .cse47) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse45 v_prenex_15) .cse47)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse45 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse45 .cse46) .cse47) (fp.div roundNearestTiesToEven .cse48 .cse47))) .cse47) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse46 .cse47) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse45 .cse48) .cse47)) .cse47)))))) (or (not (fp.leq .cse44 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (fp.geq v_prenex_15 (_ +zero 8 24)) (fp.geq .cse44 (_ +zero 8 24)))))))) is different from true [2018-11-23 02:24:36,043 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse4 (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 c_main_~x1~0) .cse1) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse1))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 c_main_~y1~0) .cse1)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse5) .cse1) (fp.div roundNearestTiesToEven .cse6 .cse1))) .cse1) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse6) .cse1)) .cse1)))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 16.0))) (and (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse0 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) .cse1))) (fp.geq .cse4 (_ +zero 8 24)) (fp.leq .cse4 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= c_main_~x1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse0) .cse1) (fp.div roundNearestTiesToEven .cse3 .cse1)))))) is different from true [2018-11-23 02:24:38,115 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3))) (.cse0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) .cse3) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)) .cse3)))) (and (fp.geq .cse0 (_ +zero 8 24)) (= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) c_main_~x1~0) (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) is different from false [2018-11-23 02:24:40,189 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3))) (.cse0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) .cse3) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)) .cse3)))) (and (fp.geq .cse0 (_ +zero 8 24)) (= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) c_main_~x1~0) (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) is different from true [2018-11-23 02:24:49,041 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse5 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or .cse0 (forall ((v_main_~x1~0_BEFORE_CALL_39 (_ FloatingPoint 8 24)) (v_main_~y1~0_BEFORE_CALL_43 (_ FloatingPoint 8 24))) (or (fp.geq v_main_~y1~0_BEFORE_CALL_43 (_ +zero 8 24)) (fp.geq (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 v_main_~x1~0_BEFORE_CALL_39) .cse3) (fp.div roundNearestTiesToEven v_main_~y1~0_BEFORE_CALL_43 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_main_~x1~0_BEFORE_CALL_39 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 v_main_~y1~0_BEFORE_CALL_43) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3))) .cse3) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3)) .cse3)))) (_ +zero 8 24)))) .cse5) (or .cse0 .cse5 (forall ((v_prenex_7 (_ FloatingPoint 8 24)) (v_prenex_8 (_ FloatingPoint 8 24))) (let ((.cse10 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (fp.leq (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 v_prenex_7) .cse8) (fp.div roundNearestTiesToEven v_prenex_8 .cse8))) (.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_7 .cse8) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 v_prenex_8) .cse8)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse7) .cse8) (fp.div roundNearestTiesToEven .cse9 .cse8))) .cse8) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse8) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse9) .cse8)) .cse8)))) .cse10) (fp.geq v_prenex_8 (_ +zero 8 24)) (fp.leq v_prenex_8 .cse10))))) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or .cse0 (forall ((v_prenex_18 (_ FloatingPoint 8 24)) (v_prenex_17 (_ FloatingPoint 8 24))) (let ((.cse11 (let ((.cse13 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse15 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse14 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 v_prenex_18) .cse15) (fp.div roundNearestTiesToEven v_prenex_17 .cse15))) (.cse16 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_18 .cse15) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 v_prenex_17) .cse15)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse14) .cse15) (fp.div roundNearestTiesToEven .cse16 .cse15))) .cse15) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse14 .cse15) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse16) .cse15)) .cse15))))) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (not (fp.geq .cse11 (_ +zero 8 24))) (fp.leq .cse11 .cse12) (fp.leq v_prenex_17 .cse12)))) .cse5) (or .cse0 .cse5 (forall ((v_prenex_16 (_ FloatingPoint 8 24)) (v_prenex_15 (_ FloatingPoint 8 24))) (let ((.cse17 (let ((.cse18 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse20 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse19 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse18 v_prenex_16) .cse20) (fp.div roundNearestTiesToEven v_prenex_15 .cse20))) (.cse21 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_16 .cse20) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse18 v_prenex_15) .cse20)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse18 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse18 .cse19) .cse20) (fp.div roundNearestTiesToEven .cse21 .cse20))) .cse20) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse19 .cse20) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse18 .cse21) .cse20)) .cse20)))))) (or (not (fp.leq .cse17 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (fp.geq v_prenex_15 (_ +zero 8 24)) (fp.geq .cse17 (_ +zero 8 24)))))) (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (or .cse0 (forall ((v_prenex_5 (_ FloatingPoint 8 24)) (v_prenex_6 (_ FloatingPoint 8 24))) (let ((.cse23 (let ((.cse24 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse26 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse25 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse24 v_prenex_5) .cse26) (fp.div roundNearestTiesToEven v_prenex_6 .cse26))) (.cse27 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_5 .cse26) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse24 v_prenex_6) .cse26)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse24 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse24 .cse25) .cse26) (fp.div roundNearestTiesToEven .cse27 .cse26))) .cse26) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse25 .cse26) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse24 .cse27) .cse26)) .cse26))))) (.cse22 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (fp.leq v_prenex_6 .cse22) (fp.geq .cse23 (_ +zero 8 24)) (not (fp.leq .cse23 .cse22))))) .cse5) (or .cse0 .cse5 (forall ((v_prenex_9 (_ FloatingPoint 8 24)) (v_prenex_10 (_ FloatingPoint 8 24))) (or (fp.leq (let ((.cse28 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse30 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse29 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse28 v_prenex_9) .cse30) (fp.div roundNearestTiesToEven v_prenex_10 .cse30))) (.cse31 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_9 .cse30) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse28 v_prenex_10) .cse30)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse28 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse28 .cse29) .cse30) (fp.div roundNearestTiesToEven .cse31 .cse30))) .cse30) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse29 .cse30) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse28 .cse31) .cse30)) .cse30)))) ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq v_prenex_10 (_ +zero 8 24))))) (or .cse0 .cse5 (forall ((v_prenex_14 (_ FloatingPoint 8 24)) (v_prenex_13 (_ FloatingPoint 8 24))) (or (fp.geq (let ((.cse32 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse34 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse33 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse32 v_prenex_14) .cse34) (fp.div roundNearestTiesToEven v_prenex_13 .cse34))) (.cse35 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_14 .cse34) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse32 v_prenex_13) .cse34)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse32 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse32 .cse33) .cse34) (fp.div roundNearestTiesToEven .cse35 .cse34))) .cse34) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse33 .cse34) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse32 .cse35) .cse34)) .cse34)))) (_ +zero 8 24)) (fp.geq v_prenex_13 (_ +zero 8 24)) (fp.leq v_prenex_13 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (or .cse0 .cse5 (forall ((v_prenex_12 (_ FloatingPoint 8 24)) (v_prenex_11 (_ FloatingPoint 8 24))) (let ((.cse36 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (fp.leq v_prenex_12 .cse36) (fp.leq (let ((.cse37 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse39 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse38 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse37 v_prenex_11) .cse39) (fp.div roundNearestTiesToEven v_prenex_12 .cse39))) (.cse40 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_11 .cse39) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse37 v_prenex_12) .cse39)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse37 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse37 .cse38) .cse39) (fp.div roundNearestTiesToEven .cse40 .cse39))) .cse39) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse38 .cse39) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse37 .cse40) .cse39)) .cse39)))) .cse36))))) (or .cse0 .cse5 (forall ((v_prenex_3 (_ FloatingPoint 8 24)) (v_prenex_4 (_ FloatingPoint 8 24))) (or (fp.geq (let ((.cse41 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse43 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse42 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse41 v_prenex_3) .cse43) (fp.div roundNearestTiesToEven v_prenex_4 .cse43))) (.cse44 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_3 .cse43) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse41 v_prenex_4) .cse43)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse41 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse41 .cse42) .cse43) (fp.div roundNearestTiesToEven .cse44 .cse43))) .cse43) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse42 .cse43) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse41 .cse44) .cse43)) .cse43)))) (_ +zero 8 24)) (fp.leq v_prenex_4 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) (or .cse0 (forall ((v_prenex_1 (_ FloatingPoint 8 24)) (v_prenex_2 (_ FloatingPoint 8 24))) (let ((.cse45 (let ((.cse46 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse48 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse47 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 v_prenex_1) .cse48) (fp.div roundNearestTiesToEven v_prenex_2 .cse48))) (.cse49 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_1 .cse48) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 v_prenex_2) .cse48)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 .cse47) .cse48) (fp.div roundNearestTiesToEven .cse49 .cse48))) .cse48) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse47 .cse48) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 .cse49) .cse48)) .cse48)))))) (or (fp.leq .cse45 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq v_prenex_2 (_ +zero 8 24)) (not (fp.geq .cse45 (_ +zero 8 24)))))) .cse5))) is different from true [2018-11-23 02:24:51,989 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse7) .cse1) (fp.div roundNearestTiesToEven .cse8 .cse1))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse8) .cse1)))) (let ((.cse0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse5) .cse1) (fp.div roundNearestTiesToEven .cse6 .cse1))) (.cse3 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse6) .cse1))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 c_main_~x1~0) .cse1) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse1)))) (and (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse0 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) .cse1))) (fp.geq .cse4 (_ +zero 8 24)) (= c_main_~x1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse0) .cse1) (fp.div roundNearestTiesToEven .cse3 .cse1))) (fp.leq .cse4 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))))) is different from true [2018-11-23 02:25:06,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:25:06,259 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2018-11-23 02:25:06,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 02:25:06,265 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 46 [2018-11-23 02:25:06,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:25:06,266 INFO L225 Difference]: With dead ends: 69 [2018-11-23 02:25:06,266 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 02:25:06,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 58.5s TimeCoverageRelationStatistics Valid=60, Invalid=134, Unknown=22, NotChecked=540, Total=756 [2018-11-23 02:25:06,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 02:25:06,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-23 02:25:06,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 02:25:06,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2018-11-23 02:25:06,278 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 46 [2018-11-23 02:25:06,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:25:06,278 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-11-23 02:25:06,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 02:25:06,279 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2018-11-23 02:25:06,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 02:25:06,279 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:25:06,279 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:25:06,279 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:25:06,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:25:06,279 INFO L82 PathProgramCache]: Analyzing trace with hash 51340061, now seen corresponding path program 6 times [2018-11-23 02:25:06,280 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:25:06,280 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/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-23 02:25:06,285 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-11-23 02:25:06,991 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 02:25:06,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:25:07,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:25:07,159 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 02:25:07,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:25:09,547 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) c_main_~y1~0) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:25:11,622 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2)) .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2018-11-23 02:25:13,692 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2)) .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2018-11-23 02:25:15,819 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:25:17,937 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:25:20,102 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3))))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:25:22,257 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3))))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:25:22,278 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 21 not checked. [2018-11-23 02:25:22,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:25:22,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 02:25:22,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 02:25:22,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 02:25:22,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=105, Unknown=7, NotChecked=92, Total=240 [2018-11-23 02:25:22,294 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 16 states. [2018-11-23 02:25:24,441 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3))))))) (and (= c_main_~y1~0 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (fp.geq .cse0 (_ +zero 8 24)) (= ((_ to_fp 8 24) roundNearestTiesToEven 12.0) c_main_~x1~0) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:25:26,597 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3))))))) (and (= c_main_~y1~0 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (fp.geq .cse0 (_ +zero 8 24)) (= ((_ to_fp 8 24) roundNearestTiesToEven 12.0) c_main_~x1~0) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:25:28,738 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse0 (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~y1~0) .cse2)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse5) .cse2) (fp.div roundNearestTiesToEven .cse6 .cse2)) .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse6) .cse2))) .cse2)))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 16.0))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse1 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse2))) (= c_main_~x1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse1) .cse2) (fp.div roundNearestTiesToEven .cse4 .cse2)))))) is different from true [2018-11-23 02:25:30,825 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3))) .cse3))) (.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)) (= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) c_main_~x1~0) (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3)))))) is different from true [2018-11-23 02:25:38,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:25:38,015 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-11-23 02:25:38,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 02:25:38,020 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2018-11-23 02:25:38,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:25:38,020 INFO L225 Difference]: With dead ends: 73 [2018-11-23 02:25:38,020 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 02:25:38,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=48, Invalid=125, Unknown=11, NotChecked=196, Total=380 [2018-11-23 02:25:38,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 02:25:38,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-11-23 02:25:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 02:25:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2018-11-23 02:25:38,030 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 51 [2018-11-23 02:25:38,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:25:38,030 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2018-11-23 02:25:38,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 02:25:38,030 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2018-11-23 02:25:38,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 02:25:38,031 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:25:38,031 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:25:38,031 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:25:38,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:25:38,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1735319877, now seen corresponding path program 7 times [2018-11-23 02:25:38,032 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:25:38,032 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-11-23 02:25:38,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:25:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:25:38,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:25:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-23 02:25:38,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:25:41,073 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) c_main_~x1~0) .cse1) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:25:43,099 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) c_main_~x1~0) .cse1) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:25:45,178 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2))) .cse2) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:25:47,254 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2))) .cse2) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:25:49,376 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3))) .cse3) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:25:51,494 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3))) .cse3) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:25:53,658 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3))) .cse3) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3)) .cse3))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2018-11-23 02:25:55,817 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3))) .cse3) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3)) .cse3))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2018-11-23 02:25:58,025 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse7) .cse3) (fp.div roundNearestTiesToEven .cse8 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3))) .cse3) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3)) .cse3)))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2018-11-23 02:26:00,237 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse7) .cse3) (fp.div roundNearestTiesToEven .cse8 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3))) .cse3) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3)) .cse3)))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2018-11-23 02:26:00,262 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 32 not checked. [2018-11-23 02:26:00,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:26:00,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-23 02:26:00,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 02:26:00,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 02:26:00,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=125, Unknown=10, NotChecked=130, Total=306 [2018-11-23 02:26:00,279 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 18 states. [2018-11-23 02:26:02,496 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse7) .cse3) (fp.div roundNearestTiesToEven .cse8 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3))) .cse3) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3)) .cse3)))))))) (and (= c_main_~y1~0 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (= ((_ to_fp 8 24) roundNearestTiesToEven 12.0) c_main_~x1~0) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2018-11-23 02:26:04,674 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse4 (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 c_main_~x1~0) .cse1) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse1))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 c_main_~y1~0) .cse1)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse7) .cse1) (fp.div roundNearestTiesToEven .cse8 .cse1))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse8) .cse1)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse5) .cse1) (fp.div roundNearestTiesToEven .cse6 .cse1))) .cse1) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse6) .cse1)) .cse1))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 16.0))) (and (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse0 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) .cse1))) (fp.leq .cse4 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse4 (_ +zero 8 24)) (= c_main_~x1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse0) .cse1) (fp.div roundNearestTiesToEven .cse3 .cse1)))))) is different from true [2018-11-23 02:26:06,816 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse7) .cse3) (fp.div roundNearestTiesToEven .cse8 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse3))) (.cse0 (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) .cse3) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)) .cse3))))) (and (fp.geq .cse0 (_ +zero 8 24)) (= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) c_main_~x1~0) (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) is different from false [2018-11-23 02:26:08,934 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse7) .cse3) (fp.div roundNearestTiesToEven .cse8 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse3))) (.cse0 (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) .cse3) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)) .cse3))))) (and (fp.geq .cse0 (_ +zero 8 24)) (= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) c_main_~x1~0) (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) is different from true [2018-11-23 02:26:10,989 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse7) .cse1) (fp.div roundNearestTiesToEven .cse8 .cse1))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse8) .cse1)))) (let ((.cse0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse5) .cse1) (fp.div roundNearestTiesToEven .cse6 .cse1))) (.cse3 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse6) .cse1))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 c_main_~x1~0) .cse1) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse1))) .cse1) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 c_main_~y1~0) .cse1)) .cse1)))) (and (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse0 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) .cse1))) (fp.geq .cse4 (_ +zero 8 24)) (= c_main_~x1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse0) .cse1) (fp.div roundNearestTiesToEven .cse3 .cse1))) (fp.leq .cse4 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))))) is different from false [2018-11-23 02:26:13,061 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse7) .cse1) (fp.div roundNearestTiesToEven .cse8 .cse1))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse8) .cse1)))) (let ((.cse0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse5) .cse1) (fp.div roundNearestTiesToEven .cse6 .cse1))) (.cse3 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse6) .cse1))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 c_main_~x1~0) .cse1) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse1))) .cse1) (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 c_main_~y1~0) .cse1)) .cse1)))) (and (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse0 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) .cse1))) (fp.geq .cse4 (_ +zero 8 24)) (= c_main_~x1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse0) .cse1) (fp.div roundNearestTiesToEven .cse3 .cse1))) (fp.leq .cse4 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))))) is different from true [2018-11-23 02:26:32,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:26:32,684 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2018-11-23 02:26:32,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:26:32,689 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2018-11-23 02:26:32,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:26:32,690 INFO L225 Difference]: With dead ends: 77 [2018-11-23 02:26:32,690 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 02:26:32,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 39.1s TimeCoverageRelationStatistics Valid=55, Invalid=147, Unknown=16, NotChecked=288, Total=506 [2018-11-23 02:26:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 02:26:32,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-11-23 02:26:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 02:26:32,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2018-11-23 02:26:32,703 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 58 [2018-11-23 02:26:32,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:26:32,703 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2018-11-23 02:26:32,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 02:26:32,703 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2018-11-23 02:26:32,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 02:26:32,704 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:26:32,704 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:26:32,704 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:26:32,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:26:32,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1647616355, now seen corresponding path program 8 times [2018-11-23 02:26:32,705 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:26:32,705 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-11-23 02:26:32,710 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 02:26:33,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 02:26:33,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:26:33,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:26:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 18 proven. 36 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 02:26:33,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:26:35,844 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) c_main_~y1~0) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:26:37,871 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) c_main_~y1~0) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:26:39,953 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2)) .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2018-11-23 02:26:42,031 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2)) .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2018-11-23 02:26:44,162 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:26:46,294 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:26:48,466 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3))))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:26:50,647 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3))))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:26:52,871 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse7) .cse3) (fp.div roundNearestTiesToEven .cse8 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3)))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2018-11-23 02:26:55,122 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse7) .cse3) (fp.div roundNearestTiesToEven .cse8 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3)))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2018-11-23 02:26:55,164 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 36 not checked. [2018-11-23 02:26:55,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:26:55,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-23 02:26:55,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 02:26:55,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 02:26:55,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=125, Unknown=10, NotChecked=130, Total=306 [2018-11-23 02:26:55,185 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand 18 states. [2018-11-23 02:26:57,409 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse7) .cse3) (fp.div roundNearestTiesToEven .cse8 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3)))))))) (and (= c_main_~y1~0 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= ((_ to_fp 8 24) roundNearestTiesToEven 12.0) c_main_~x1~0) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2018-11-23 02:26:59,646 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse7) .cse3) (fp.div roundNearestTiesToEven .cse8 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3)))))))) (and (= c_main_~y1~0 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= ((_ to_fp 8 24) roundNearestTiesToEven 12.0) c_main_~x1~0) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2018-11-23 02:27:01,816 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse0 (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~y1~0) .cse2)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse7) .cse2) (fp.div roundNearestTiesToEven .cse8 .cse2))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse8) .cse2)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse5) .cse2) (fp.div roundNearestTiesToEven .cse6 .cse2)) .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse6) .cse2))) .cse2))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 16.0))) (and (fp.geq .cse0 (_ +zero 8 24)) (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse1 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse2))) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= c_main_~x1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse1) .cse2) (fp.div roundNearestTiesToEven .cse4 .cse2)))))) is different from false [2018-11-23 02:27:04,009 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse0 (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~y1~0) .cse2)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse7) .cse2) (fp.div roundNearestTiesToEven .cse8 .cse2))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse8) .cse2)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse5) .cse2) (fp.div roundNearestTiesToEven .cse6 .cse2)) .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse6) .cse2))) .cse2))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 16.0))) (and (fp.geq .cse0 (_ +zero 8 24)) (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse1 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse2))) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= c_main_~x1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse1) .cse2) (fp.div roundNearestTiesToEven .cse4 .cse2)))))) is different from true [2018-11-23 02:27:06,167 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse0 (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse7) .cse3) (fp.div roundNearestTiesToEven .cse8 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse3))) .cse3)))) (.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) c_main_~x1~0) (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3)))))) is different from true [2018-11-23 02:27:08,252 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse7) .cse2) (fp.div roundNearestTiesToEven .cse8 .cse2))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse8) .cse2)))) (let ((.cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse5) .cse2) (fp.div roundNearestTiesToEven .cse6 .cse2))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse6) .cse2))) (.cse0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2)) .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~y1~0) .cse2))) .cse2)))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse1 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse2))) (= c_main_~x1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse1) .cse2) (fp.div roundNearestTiesToEven .cse4 .cse2))) (fp.geq .cse0 (_ +zero 8 24)))))) is different from false [2018-11-23 02:27:10,334 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse7) .cse2) (fp.div roundNearestTiesToEven .cse8 .cse2))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse8) .cse2)))) (let ((.cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse5) .cse2) (fp.div roundNearestTiesToEven .cse6 .cse2))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse6) .cse2))) (.cse0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2)) .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 c_main_~y1~0) .cse2))) .cse2)))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse1 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) .cse2))) (= c_main_~x1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse1) .cse2) (fp.div roundNearestTiesToEven .cse4 .cse2))) (fp.geq .cse0 (_ +zero 8 24)))))) is different from true [2018-11-23 02:27:21,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:27:21,450 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-11-23 02:27:21,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:27:21,457 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 63 [2018-11-23 02:27:21,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:27:21,458 INFO L225 Difference]: With dead ends: 83 [2018-11-23 02:27:21,458 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 02:27:21,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 108 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 38.8s TimeCoverageRelationStatistics Valid=55, Invalid=146, Unknown=17, NotChecked=288, Total=506 [2018-11-23 02:27:21,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 02:27:21,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-23 02:27:21,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 02:27:21,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-11-23 02:27:21,473 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 63 [2018-11-23 02:27:21,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:27:21,473 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-23 02:27:21,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 02:27:21,473 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-23 02:27:21,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 02:27:21,474 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:27:21,474 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:27:21,475 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:27:21,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:27:21,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1024144187, now seen corresponding path program 9 times [2018-11-23 02:27:21,475 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:27:21,475 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-11-23 02:27:21,482 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 02:27:22,063 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 02:27:22,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:27:22,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:27:24,197 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq main_~x~0 (_ +zero 8 24)) (fp.leq main_~x~0 .cse0) (fp.geq main_~y~0 (_ +zero 8 24)) (= c_main_~x1~0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) main_~x~0) .cse1) (fp.div roundNearestTiesToEven main_~y~0 .cse1)))) (fp.leq main_~y~0 .cse0)))) is different from false [2018-11-23 02:27:26,233 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq main_~x~0 (_ +zero 8 24)) (fp.leq main_~x~0 .cse0) (fp.geq main_~y~0 (_ +zero 8 24)) (= c_main_~x1~0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) main_~x~0) .cse1) (fp.div roundNearestTiesToEven main_~y~0 .cse1)))) (fp.leq main_~y~0 .cse0)))) is different from true [2018-11-23 02:27:42,527 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and (exists ((v_prenex_24 (_ FloatingPoint 8 24)) (v_prenex_23 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (.cse1 (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) v_prenex_23) .cse2) (fp.div roundNearestTiesToEven v_prenex_24 .cse2))))) (and (fp.leq v_prenex_23 .cse0) (fp.geq v_prenex_24 (_ +zero 8 24)) (fp.leq v_prenex_24 .cse0) (fp.leq .cse1 .cse0) (fp.geq v_prenex_23 (_ +zero 8 24)) (fp.geq .cse1 (_ +zero 8 24))))) (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((v_prenex_21 (_ FloatingPoint 8 24)) (v_prenex_20 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq v_prenex_21 (_ +zero 8 24)) (fp.leq v_prenex_21 .cse3) (fp.geq v_prenex_20 (_ +zero 8 24)) (not (fp.geq (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) v_prenex_20) .cse4) (fp.div roundNearestTiesToEven v_prenex_21 .cse4))) (_ +zero 8 24))) (fp.leq v_prenex_20 .cse3)))) .cse5) (and .cse5 (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~y~0 (_ FloatingPoint 8 24))) (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq main_~x~0 (_ +zero 8 24)) (fp.leq main_~x~0 .cse6) (fp.geq main_~y~0 (_ +zero 8 24)) (fp.leq main_~y~0 .cse6) (not (fp.leq (let ((.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) main_~x~0) .cse7) (fp.div roundNearestTiesToEven main_~y~0 .cse7))) .cse6)))))))) is different from false [2018-11-23 02:27:56,796 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~y~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq main_~x~0 (_ +zero 8 24)) (fp.leq main_~x~0 .cse1) (fp.geq main_~y~0 (_ +zero 8 24)) (fp.leq main_~y~0 .cse1) (not (fp.leq (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) main_~x~0) .cse2) (fp.div roundNearestTiesToEven main_~y~0 .cse2))) .cse1)))))) (and .cse0 (exists ((v_prenex_21 (_ FloatingPoint 8 24)) (v_prenex_20 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq v_prenex_21 (_ +zero 8 24)) (fp.leq v_prenex_21 .cse3) (fp.geq v_prenex_20 (_ +zero 8 24)) (not (fp.geq (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) v_prenex_20) .cse4) (fp.div roundNearestTiesToEven v_prenex_21 .cse4))) (_ +zero 8 24))) (fp.leq v_prenex_20 .cse3))))) (and (exists ((v_prenex_24 (_ FloatingPoint 8 24)) (v_prenex_23 (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (.cse6 (let ((.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) v_prenex_23) .cse7) (fp.div roundNearestTiesToEven v_prenex_24 .cse7))))) (and (fp.leq v_prenex_23 .cse5) (fp.geq v_prenex_24 (_ +zero 8 24)) (fp.leq v_prenex_24 .cse5) (fp.leq .cse6 .cse5) (fp.geq v_prenex_23 (_ +zero 8 24)) (fp.geq .cse6 (_ +zero 8 24))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))))) is different from false [2018-11-23 02:28:06,979 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_21 (_ FloatingPoint 8 24)) (v_prenex_20 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq v_prenex_21 (_ +zero 8 24)) (fp.leq v_prenex_21 .cse0) (fp.geq v_prenex_20 (_ +zero 8 24)) (not (fp.geq (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) v_prenex_20) .cse1) (fp.div roundNearestTiesToEven v_prenex_21 .cse1))) (_ +zero 8 24))) (fp.leq v_prenex_20 .cse0)))) (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~y~0 (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq main_~x~0 (_ +zero 8 24)) (fp.leq main_~x~0 .cse2) (fp.geq main_~y~0 (_ +zero 8 24)) (fp.leq main_~y~0 .cse2) (not (fp.leq (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) main_~x~0) .cse3) (fp.div roundNearestTiesToEven main_~y~0 .cse3))) .cse2)))))) is different from false [2018-11-23 02:28:09,012 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_21 (_ FloatingPoint 8 24)) (v_prenex_20 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq v_prenex_21 (_ +zero 8 24)) (fp.leq v_prenex_21 .cse0) (fp.geq v_prenex_20 (_ +zero 8 24)) (not (fp.geq (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) v_prenex_20) .cse1) (fp.div roundNearestTiesToEven v_prenex_21 .cse1))) (_ +zero 8 24))) (fp.leq v_prenex_20 .cse0)))) (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~y~0 (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq main_~x~0 (_ +zero 8 24)) (fp.leq main_~x~0 .cse2) (fp.geq main_~y~0 (_ +zero 8 24)) (fp.leq main_~y~0 .cse2) (not (fp.leq (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) main_~x~0) .cse3) (fp.div roundNearestTiesToEven main_~y~0 .cse3))) .cse2)))))) is different from true [2018-11-23 02:28:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 2 not checked. [2018-11-23 02:28:09,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:28:11,056 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) c_main_~x1~0) .cse1) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:28:14,208 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((main_~y1~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (not (fp.geq main_~y1~0 (_ +zero 8 24))) (not (fp.leq main_~y1~0 .cse0)) (fp.leq (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) c_main_~x1~0) .cse1) (fp.div roundNearestTiesToEven main_~y1~0 .cse1))) .cse0)))) (forall ((v_prenex_25 (_ FloatingPoint 8 24))) (or (not (fp.geq v_prenex_25 (_ +zero 8 24))) (not (fp.leq v_prenex_25 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (fp.geq (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven v_prenex_25 .cse2))) (_ +zero 8 24))))) is different from false [2018-11-23 02:28:16,253 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((main_~y1~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (not (fp.geq main_~y1~0 (_ +zero 8 24))) (not (fp.leq main_~y1~0 .cse0)) (fp.leq (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) c_main_~x1~0) .cse1) (fp.div roundNearestTiesToEven main_~y1~0 .cse1))) .cse0)))) (forall ((v_prenex_25 (_ FloatingPoint 8 24))) (or (not (fp.geq v_prenex_25 (_ +zero 8 24))) (not (fp.leq v_prenex_25 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (fp.geq (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven v_prenex_25 .cse2))) (_ +zero 8 24))))) is different from true [2018-11-23 02:28:16,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:28:16,267 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:28:16,275 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:28:43,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 02:28:43,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:28:43,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:28:59,525 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (or (and .cse0 (exists ((v_prenex_28 (_ FloatingPoint 8 24)) (v_prenex_27 (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq v_prenex_27 (_ +zero 8 24)) (not (fp.leq (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) v_prenex_27) .cse1) (fp.div roundNearestTiesToEven v_prenex_28 .cse1))) .cse2)) (fp.geq v_prenex_28 (_ +zero 8 24)) (fp.leq v_prenex_28 .cse2) (fp.leq v_prenex_27 .cse2))))) (and (exists ((v_prenex_31 (_ FloatingPoint 8 24)) (v_prenex_30 (_ FloatingPoint 8 24))) (let ((.cse3 (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) v_prenex_30) .cse5) (fp.div roundNearestTiesToEven v_prenex_31 .cse5)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq .cse3 (_ +zero 8 24)) (fp.leq .cse3 .cse4) (fp.leq v_prenex_31 .cse4) (fp.geq v_prenex_30 (_ +zero 8 24)) (fp.leq v_prenex_30 .cse4) (fp.geq v_prenex_31 (_ +zero 8 24))))) (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~y~0 (_ FloatingPoint 8 24))) (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq main_~x~0 (_ +zero 8 24)) (fp.leq main_~x~0 .cse6) (not (fp.geq (let ((.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) main_~x~0) .cse7) (fp.div roundNearestTiesToEven main_~y~0 .cse7))) (_ +zero 8 24))) (fp.geq main_~y~0 (_ +zero 8 24)) (fp.leq main_~y~0 .cse6)))) .cse0))) is different from false [2018-11-23 02:29:12,790 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (or (and .cse0 (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~y~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq main_~x~0 (_ +zero 8 24)) (fp.leq main_~x~0 .cse1) (not (fp.geq (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) main_~x~0) .cse2) (fp.div roundNearestTiesToEven main_~y~0 .cse2))) (_ +zero 8 24))) (fp.geq main_~y~0 (_ +zero 8 24)) (fp.leq main_~y~0 .cse1))))) (and .cse0 (exists ((v_prenex_28 (_ FloatingPoint 8 24)) (v_prenex_27 (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq v_prenex_27 (_ +zero 8 24)) (not (fp.leq (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) v_prenex_27) .cse3) (fp.div roundNearestTiesToEven v_prenex_28 .cse3))) .cse4)) (fp.geq v_prenex_28 (_ +zero 8 24)) (fp.leq v_prenex_28 .cse4) (fp.leq v_prenex_27 .cse4))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)))) is different from false [2018-11-23 02:29:22,965 WARN L832 $PredicateComparison]: unable to prove that (or (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq main_~x~0 (_ +zero 8 24)) (fp.leq main_~x~0 .cse0) (not (fp.geq (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) main_~x~0) .cse1) (fp.div roundNearestTiesToEven main_~y~0 .cse1))) (_ +zero 8 24))) (fp.geq main_~y~0 (_ +zero 8 24)) (fp.leq main_~y~0 .cse0)))) (exists ((v_prenex_28 (_ FloatingPoint 8 24)) (v_prenex_27 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq v_prenex_27 (_ +zero 8 24)) (not (fp.leq (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) v_prenex_27) .cse2) (fp.div roundNearestTiesToEven v_prenex_28 .cse2))) .cse3)) (fp.geq v_prenex_28 (_ +zero 8 24)) (fp.leq v_prenex_28 .cse3) (fp.leq v_prenex_27 .cse3))))) is different from false [2018-11-23 02:29:24,991 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq main_~x~0 (_ +zero 8 24)) (fp.leq main_~x~0 .cse0) (not (fp.geq (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) main_~x~0) .cse1) (fp.div roundNearestTiesToEven main_~y~0 .cse1))) (_ +zero 8 24))) (fp.geq main_~y~0 (_ +zero 8 24)) (fp.leq main_~y~0 .cse0)))) (exists ((v_prenex_28 (_ FloatingPoint 8 24)) (v_prenex_27 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq v_prenex_27 (_ +zero 8 24)) (not (fp.leq (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) v_prenex_27) .cse2) (fp.div roundNearestTiesToEven v_prenex_28 .cse2))) .cse3)) (fp.geq v_prenex_28 (_ +zero 8 24)) (fp.leq v_prenex_28 .cse3) (fp.leq v_prenex_27 .cse3))))) is different from true [2018-11-23 02:29:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 83 proven. 5 refuted. 0 times theorem prover too weak. 160 trivial. 2 not checked. [2018-11-23 02:29:24,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:29:27,033 WARN L832 $PredicateComparison]: unable to prove that (and (forall ((main_~y1~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (not (fp.geq main_~y1~0 (_ +zero 8 24))) (not (fp.leq main_~y1~0 .cse0)) (fp.leq (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) c_main_~x1~0) .cse1) (fp.div roundNearestTiesToEven main_~y1~0 .cse1))) .cse0)))) (forall ((v_prenex_33 (_ FloatingPoint 8 24))) (or (fp.geq (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven v_prenex_33 .cse2))) (_ +zero 8 24)) (not (fp.geq v_prenex_33 (_ +zero 8 24))) (not (fp.leq v_prenex_33 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))))) is different from false [2018-11-23 02:29:29,073 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((main_~y1~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (not (fp.geq main_~y1~0 (_ +zero 8 24))) (not (fp.leq main_~y1~0 .cse0)) (fp.leq (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) c_main_~x1~0) .cse1) (fp.div roundNearestTiesToEven main_~y1~0 .cse1))) .cse0)))) (forall ((v_prenex_33 (_ FloatingPoint 8 24))) (or (fp.geq (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven v_prenex_33 .cse2))) (_ +zero 8 24)) (not (fp.geq v_prenex_33 (_ +zero 8 24))) (not (fp.leq v_prenex_33 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))))) is different from true [2018-11-23 02:29:29,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:29:29,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2018-11-23 02:29:29,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 02:29:29,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 02:29:29,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=45, Unknown=15, NotChecked=210, Total=306 [2018-11-23 02:29:29,141 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 14 states. [2018-11-23 02:29:33,435 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse6 (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))) (.cse0 (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (and (or (and .cse0 (exists ((v_prenex_28 (_ FloatingPoint 8 24)) (v_prenex_27 (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq v_prenex_27 (_ +zero 8 24)) (not (fp.leq (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) v_prenex_27) .cse1) (fp.div roundNearestTiesToEven v_prenex_28 .cse1))) .cse2)) (fp.geq v_prenex_28 (_ +zero 8 24)) (fp.leq v_prenex_28 .cse2) (fp.leq v_prenex_27 .cse2))))) (and (exists ((v_prenex_31 (_ FloatingPoint 8 24)) (v_prenex_30 (_ FloatingPoint 8 24))) (let ((.cse3 (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) v_prenex_30) .cse5) (fp.div roundNearestTiesToEven v_prenex_31 .cse5)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq .cse3 (_ +zero 8 24)) (fp.leq .cse3 .cse4) (fp.leq v_prenex_31 .cse4) (fp.geq v_prenex_30 (_ +zero 8 24)) (fp.leq v_prenex_30 .cse4) (fp.geq v_prenex_31 (_ +zero 8 24))))) .cse6) (and (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~y~0 (_ FloatingPoint 8 24))) (let ((.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq main_~x~0 (_ +zero 8 24)) (fp.leq main_~x~0 .cse7) (not (fp.geq (let ((.cse8 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) main_~x~0) .cse8) (fp.div roundNearestTiesToEven main_~y~0 .cse8))) (_ +zero 8 24))) (fp.geq main_~y~0 (_ +zero 8 24)) (fp.leq main_~y~0 .cse7)))) .cse0)) (or (and (exists ((v_prenex_24 (_ FloatingPoint 8 24)) (v_prenex_23 (_ FloatingPoint 8 24))) (let ((.cse9 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (.cse10 (let ((.cse11 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) v_prenex_23) .cse11) (fp.div roundNearestTiesToEven v_prenex_24 .cse11))))) (and (fp.leq v_prenex_23 .cse9) (fp.geq v_prenex_24 (_ +zero 8 24)) (fp.leq v_prenex_24 .cse9) (fp.leq .cse10 .cse9) (fp.geq v_prenex_23 (_ +zero 8 24)) (fp.geq .cse10 (_ +zero 8 24))))) .cse6) (and (exists ((v_prenex_21 (_ FloatingPoint 8 24)) (v_prenex_20 (_ FloatingPoint 8 24))) (let ((.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq v_prenex_21 (_ +zero 8 24)) (fp.leq v_prenex_21 .cse12) (fp.geq v_prenex_20 (_ +zero 8 24)) (not (fp.geq (let ((.cse13 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) v_prenex_20) .cse13) (fp.div roundNearestTiesToEven v_prenex_21 .cse13))) (_ +zero 8 24))) (fp.leq v_prenex_20 .cse12)))) .cse0) (and .cse0 (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~y~0 (_ FloatingPoint 8 24))) (let ((.cse14 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq main_~x~0 (_ +zero 8 24)) (fp.leq main_~x~0 .cse14) (fp.geq main_~y~0 (_ +zero 8 24)) (fp.leq main_~y~0 .cse14) (not (fp.leq (let ((.cse15 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) main_~x~0) .cse15) (fp.div roundNearestTiesToEven main_~y~0 .cse15))) .cse14))))))))) is different from false [2018-11-23 02:29:35,584 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse8 (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)))) (and (or (and .cse0 (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~y~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq main_~x~0 (_ +zero 8 24)) (fp.leq main_~x~0 .cse1) (fp.geq main_~y~0 (_ +zero 8 24)) (fp.leq main_~y~0 .cse1) (not (fp.leq (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) main_~x~0) .cse2) (fp.div roundNearestTiesToEven main_~y~0 .cse2))) .cse1)))))) (and .cse0 (exists ((v_prenex_21 (_ FloatingPoint 8 24)) (v_prenex_20 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq v_prenex_21 (_ +zero 8 24)) (fp.leq v_prenex_21 .cse3) (fp.geq v_prenex_20 (_ +zero 8 24)) (not (fp.geq (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) v_prenex_20) .cse4) (fp.div roundNearestTiesToEven v_prenex_21 .cse4))) (_ +zero 8 24))) (fp.leq v_prenex_20 .cse3))))) (and (exists ((v_prenex_24 (_ FloatingPoint 8 24)) (v_prenex_23 (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (.cse6 (let ((.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) v_prenex_23) .cse7) (fp.div roundNearestTiesToEven v_prenex_24 .cse7))))) (and (fp.leq v_prenex_23 .cse5) (fp.geq v_prenex_24 (_ +zero 8 24)) (fp.leq v_prenex_24 .cse5) (fp.leq .cse6 .cse5) (fp.geq v_prenex_23 (_ +zero 8 24)) (fp.geq .cse6 (_ +zero 8 24))))) .cse8)) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (and .cse0 (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~y~0 (_ FloatingPoint 8 24))) (let ((.cse9 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq main_~x~0 (_ +zero 8 24)) (fp.leq main_~x~0 .cse9) (not (fp.geq (let ((.cse10 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) main_~x~0) .cse10) (fp.div roundNearestTiesToEven main_~y~0 .cse10))) (_ +zero 8 24))) (fp.geq main_~y~0 (_ +zero 8 24)) (fp.leq main_~y~0 .cse9))))) (and .cse0 (exists ((v_prenex_28 (_ FloatingPoint 8 24)) (v_prenex_27 (_ FloatingPoint 8 24))) (let ((.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq v_prenex_27 (_ +zero 8 24)) (not (fp.leq (let ((.cse11 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) v_prenex_27) .cse11) (fp.div roundNearestTiesToEven v_prenex_28 .cse11))) .cse12)) (fp.geq v_prenex_28 (_ +zero 8 24)) (fp.leq v_prenex_28 .cse12) (fp.leq v_prenex_27 .cse12))))) .cse8))) is different from false [2018-11-23 02:29:37,753 WARN L832 $PredicateComparison]: unable to prove that (and (or (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq main_~x~0 (_ +zero 8 24)) (fp.leq main_~x~0 .cse0) (not (fp.geq (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) main_~x~0) .cse1) (fp.div roundNearestTiesToEven main_~y~0 .cse1))) (_ +zero 8 24))) (fp.geq main_~y~0 (_ +zero 8 24)) (fp.leq main_~y~0 .cse0)))) (exists ((v_prenex_28 (_ FloatingPoint 8 24)) (v_prenex_27 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq v_prenex_27 (_ +zero 8 24)) (not (fp.leq (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) v_prenex_27) .cse2) (fp.div roundNearestTiesToEven v_prenex_28 .cse2))) .cse3)) (fp.geq v_prenex_28 (_ +zero 8 24)) (fp.leq v_prenex_28 .cse3) (fp.leq v_prenex_27 .cse3))))) (or (exists ((v_prenex_21 (_ FloatingPoint 8 24)) (v_prenex_20 (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq v_prenex_21 (_ +zero 8 24)) (fp.leq v_prenex_21 .cse4) (fp.geq v_prenex_20 (_ +zero 8 24)) (not (fp.geq (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) v_prenex_20) .cse5) (fp.div roundNearestTiesToEven v_prenex_21 .cse5))) (_ +zero 8 24))) (fp.leq v_prenex_20 .cse4)))) (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~y~0 (_ FloatingPoint 8 24))) (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq main_~x~0 (_ +zero 8 24)) (fp.leq main_~x~0 .cse6) (fp.geq main_~y~0 (_ +zero 8 24)) (fp.leq main_~y~0 .cse6) (not (fp.leq (let ((.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) main_~x~0) .cse7) (fp.div roundNearestTiesToEven main_~y~0 .cse7))) .cse6))))))) is different from false [2018-11-23 02:29:39,783 WARN L854 $PredicateComparison]: unable to prove that (and (or (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~y~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq main_~x~0 (_ +zero 8 24)) (fp.leq main_~x~0 .cse0) (not (fp.geq (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) main_~x~0) .cse1) (fp.div roundNearestTiesToEven main_~y~0 .cse1))) (_ +zero 8 24))) (fp.geq main_~y~0 (_ +zero 8 24)) (fp.leq main_~y~0 .cse0)))) (exists ((v_prenex_28 (_ FloatingPoint 8 24)) (v_prenex_27 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq v_prenex_27 (_ +zero 8 24)) (not (fp.leq (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) v_prenex_27) .cse2) (fp.div roundNearestTiesToEven v_prenex_28 .cse2))) .cse3)) (fp.geq v_prenex_28 (_ +zero 8 24)) (fp.leq v_prenex_28 .cse3) (fp.leq v_prenex_27 .cse3))))) (or (exists ((v_prenex_21 (_ FloatingPoint 8 24)) (v_prenex_20 (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq v_prenex_21 (_ +zero 8 24)) (fp.leq v_prenex_21 .cse4) (fp.geq v_prenex_20 (_ +zero 8 24)) (not (fp.geq (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) v_prenex_20) .cse5) (fp.div roundNearestTiesToEven v_prenex_21 .cse5))) (_ +zero 8 24))) (fp.leq v_prenex_20 .cse4)))) (exists ((main_~x~0 (_ FloatingPoint 8 24)) (main_~y~0 (_ FloatingPoint 8 24))) (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (and (fp.geq main_~x~0 (_ +zero 8 24)) (fp.leq main_~x~0 .cse6) (fp.geq main_~y~0 (_ +zero 8 24)) (fp.leq main_~y~0 .cse6) (not (fp.leq (let ((.cse7 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) main_~x~0) .cse7) (fp.div roundNearestTiesToEven main_~y~0 .cse7))) .cse6))))))) is different from true [2018-11-23 02:29:40,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:29:40,030 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2018-11-23 02:29:40,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:29:40,037 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2018-11-23 02:29:40,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:29:40,038 INFO L225 Difference]: With dead ends: 87 [2018-11-23 02:29:40,038 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 02:29:40,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 40.3s TimeCoverageRelationStatistics Valid=47, Invalid=58, Unknown=19, NotChecked=338, Total=462 [2018-11-23 02:29:40,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 02:29:40,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-11-23 02:29:40,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 02:29:40,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2018-11-23 02:29:40,059 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 70 [2018-11-23 02:29:40,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:29:40,060 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2018-11-23 02:29:40,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 02:29:40,060 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-11-23 02:29:40,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 02:29:40,061 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:29:40,061 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:29:40,061 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:29:40,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:29:40,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1326835171, now seen corresponding path program 10 times [2018-11-23 02:29:40,061 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:29:40,061 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2018-11-23 02:29:40,064 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:29:40,973 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:29:40,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:29:41,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:29:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 22 proven. 55 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-23 02:29:41,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:29:43,362 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) c_main_~y1~0) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:29:46,584 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2)) .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2018-11-23 02:29:48,662 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2)) .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2018-11-23 02:29:50,804 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:29:52,933 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:29:55,110 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3))))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:29:57,288 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3))))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:29:59,504 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse7) .cse3) (fp.div roundNearestTiesToEven .cse8 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3)))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2018-11-23 02:30:01,722 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse7) .cse3) (fp.div roundNearestTiesToEven .cse8 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3)))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2018-11-23 02:30:03,988 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse10 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse9) .cse3) (fp.div roundNearestTiesToEven .cse10 .cse3))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse9 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse10) .cse3)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse7) .cse3) (fp.div roundNearestTiesToEven .cse8 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3))))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2018-11-23 02:30:06,245 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse10 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse9) .cse3) (fp.div roundNearestTiesToEven .cse10 .cse3))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse9 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse10) .cse3)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse7) .cse3) (fp.div roundNearestTiesToEven .cse8 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3))))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2018-11-23 02:30:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 55 not checked. [2018-11-23 02:30:06,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 02:30:06,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-23 02:30:06,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 02:30:06,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 02:30:06,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=149, Unknown=11, NotChecked=174, Total=380 [2018-11-23 02:30:06,300 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 20 states. [2018-11-23 02:30:08,571 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse10 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse9) .cse3) (fp.div roundNearestTiesToEven .cse10 .cse3))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse9 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse10) .cse3)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse7) .cse3) (fp.div roundNearestTiesToEven .cse8 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3))))))))) (and (= c_main_~y1~0 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (= ((_ to_fp 8 24) roundNearestTiesToEven 12.0) c_main_~x1~0) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2018-11-23 02:30:10,811 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse4 (let ((.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 c_main_~x1~0) .cse1) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse1))) (.cse10 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 c_main_~y1~0) .cse1)))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse9) .cse1) (fp.div roundNearestTiesToEven .cse10 .cse1))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse9 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse10) .cse1)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse7) .cse1) (fp.div roundNearestTiesToEven .cse8 .cse1))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse8) .cse1)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse5) .cse1) (fp.div roundNearestTiesToEven .cse6 .cse1)) .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse6) .cse1))) .cse1)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 16.0))) (and (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse0 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) .cse1))) (fp.leq .cse4 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse4 (_ +zero 8 24)) (= c_main_~x1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse0) .cse1) (fp.div roundNearestTiesToEven .cse3 .cse1)))))) is different from true [2018-11-23 02:30:12,995 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse0 (let ((.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse10 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse9) .cse3) (fp.div roundNearestTiesToEven .cse10 .cse3))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse9 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse10) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse7) .cse3) (fp.div roundNearestTiesToEven .cse8 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse3))) .cse3))))) (.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (and (fp.geq .cse0 (_ +zero 8 24)) (= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) c_main_~x1~0) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3)))))) is different from false [2018-11-23 02:30:15,169 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse0 (let ((.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse10 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse9) .cse3) (fp.div roundNearestTiesToEven .cse10 .cse3))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse9 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse10) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse7) .cse3) (fp.div roundNearestTiesToEven .cse8 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse3))) .cse3))))) (.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (and (fp.geq .cse0 (_ +zero 8 24)) (= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) c_main_~x1~0) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3)))))) is different from true [2018-11-23 02:30:17,319 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse9 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse10 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse9) .cse1) (fp.div roundNearestTiesToEven .cse10 .cse1))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse9 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse10) .cse1)))) (let ((.cse4 (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 c_main_~x1~0) .cse1) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse1))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 c_main_~y1~0) .cse1)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse7) .cse1) (fp.div roundNearestTiesToEven .cse8 .cse1)) .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse8) .cse1))) .cse1)))) (.cse0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse5) .cse1) (fp.div roundNearestTiesToEven .cse6 .cse1))) (.cse3 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse6) .cse1)))) (and (= c_main_~y1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse0 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) .cse1))) (fp.geq .cse4 (_ +zero 8 24)) (fp.leq .cse4 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= c_main_~x1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse0) .cse1) (fp.div roundNearestTiesToEven .cse3 .cse1))))))) is different from true [2018-11-23 02:30:19,408 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse9 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse10 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse9) .cse2) (fp.div roundNearestTiesToEven .cse10 .cse2))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse9 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse10) .cse2)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse7) .cse2) (fp.div roundNearestTiesToEven .cse8 .cse2))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse8) .cse2)))) (let ((.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2)) .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 c_main_~y1~0) .cse2))) .cse2))) (.cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse5) .cse2) (fp.div roundNearestTiesToEven .cse6 .cse2))) (.cse3 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse6) .cse2)))) (and (= c_main_~x1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) .cse2) (fp.div roundNearestTiesToEven .cse3 .cse2))) (fp.leq .cse4 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse4 (_ +zero 8 24)) (= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse1 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse3) .cse2)) c_main_~y1~0)))))) is different from true [2018-11-23 02:30:21,450 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse11 ((_ to_fp 8 24) roundNearestTiesToEven 12.0)) (.cse12 ((_ to_fp 8 24) roundNearestTiesToEven 16.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse11) .cse2) (fp.div roundNearestTiesToEven .cse12 .cse2))) (.cse10 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse11 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse12) .cse2)))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse9) .cse2) (fp.div roundNearestTiesToEven .cse10 .cse2))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse9 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse10) .cse2)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse7) .cse2) (fp.div roundNearestTiesToEven .cse8 .cse2))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse8) .cse2)))) (let ((.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 c_main_~y1~0) .cse2))) (.cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse5) .cse2) (fp.div roundNearestTiesToEven .cse6 .cse2))) (.cse3 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse6) .cse2)))) (and (= c_main_~x1~0 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) .cse2) (fp.div roundNearestTiesToEven .cse3 .cse2))) (fp.geq .cse4 (_ +zero 8 24)) (fp.leq .cse4 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (= (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse1 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse3) .cse2)) c_main_~y1~0))))))) is different from true [2018-11-23 02:30:23,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:30:23,777 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-11-23 02:30:23,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:30:23,782 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 75 [2018-11-23 02:30:23,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:30:23,783 INFO L225 Difference]: With dead ends: 91 [2018-11-23 02:30:23,783 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 02:30:23,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 40.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=18, NotChecked=444, Total=702 [2018-11-23 02:30:23,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 02:30:23,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-11-23 02:30:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 02:30:23,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2018-11-23 02:30:23,806 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 75 [2018-11-23 02:30:23,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:30:23,807 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-11-23 02:30:23,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 02:30:23,807 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-11-23 02:30:23,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 02:30:23,808 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:30:23,808 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:30:23,808 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:30:23,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:30:23,808 INFO L82 PathProgramCache]: Analyzing trace with hash -28600931, now seen corresponding path program 11 times [2018-11-23 02:30:23,809 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 02:30:23,809 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a943dfea-f4de-4fa6-8a09-4f33e9a4b214/bin-2019/uautomizer/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2018-11-23 02:30:23,818 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-23 02:30:25,194 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-23 02:30:25,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:30:25,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:30:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 24 proven. 146 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-11-23 02:30:25,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:30:27,696 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) c_main_~y1~0) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:30:29,724 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse1) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 3.0) c_main_~y1~0) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:30:31,805 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2)) .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2018-11-23 02:30:33,892 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse2) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse2)) .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse2) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2018-11-23 02:30:36,028 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:30:38,162 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:30:40,338 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3))))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from false [2018-11-23 02:30:42,507 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3))))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))) is different from true [2018-11-23 02:30:44,742 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse7) .cse3) (fp.div roundNearestTiesToEven .cse8 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3)))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2018-11-23 02:30:46,968 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse7) .cse3) (fp.div roundNearestTiesToEven .cse8 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3)))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2018-11-23 02:30:49,231 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse10 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse9) .cse3) (fp.div roundNearestTiesToEven .cse10 .cse3))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse9 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse10) .cse3)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse7) .cse3) (fp.div roundNearestTiesToEven .cse8 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3))))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2018-11-23 02:30:51,507 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~x1~0) .cse3) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse3))) (.cse10 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 c_main_~y1~0) .cse3)))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse9) .cse3) (fp.div roundNearestTiesToEven .cse10 .cse3))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse9 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse10) .cse3)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse7) .cse3) (fp.div roundNearestTiesToEven .cse8 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3))))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2018-11-23 02:30:53,813 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (let ((.cse0 (not (fp.geq c_main_~y1~0 (_ +zero 8 24)))) (.cse1 (not (fp.leq c_main_~y1~0 .cse3))) (.cse2 (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse12 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~x1~0) .cse6) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse6))) (.cse13 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse6) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~y1~0) .cse6)))) (let ((.cse10 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse12) .cse6) (fp.div roundNearestTiesToEven .cse13 .cse6))) (.cse11 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse12 .cse6) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse13) .cse6)))) (let ((.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse10) .cse6) (fp.div roundNearestTiesToEven .cse11 .cse6))) (.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse10 .cse6) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse11) .cse6)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse8) .cse6) (fp.div roundNearestTiesToEven .cse9 .cse6))) (.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse8 .cse6) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse9) .cse6)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse5) .cse6) (fp.div roundNearestTiesToEven .cse7 .cse6)) .cse6) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse6) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse7) .cse6))) .cse6))))))))) (and (or .cse0 .cse1 (fp.geq .cse2 (_ +zero 8 24))) (or .cse0 .cse1 (fp.leq .cse2 .cse3))))) is different from false [2018-11-23 02:30:56,087 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (let ((.cse0 (not (fp.geq c_main_~y1~0 (_ +zero 8 24)))) (.cse1 (not (fp.leq c_main_~y1~0 .cse3))) (.cse2 (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse12 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~x1~0) .cse6) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse6))) (.cse13 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse6) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 c_main_~y1~0) .cse6)))) (let ((.cse10 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse12) .cse6) (fp.div roundNearestTiesToEven .cse13 .cse6))) (.cse11 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse12 .cse6) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse13) .cse6)))) (let ((.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse10) .cse6) (fp.div roundNearestTiesToEven .cse11 .cse6))) (.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse10 .cse6) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse11) .cse6)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse8) .cse6) (fp.div roundNearestTiesToEven .cse9 .cse6))) (.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse8 .cse6) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse9) .cse6)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse5) .cse6) (fp.div roundNearestTiesToEven .cse7 .cse6)) .cse6) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse6) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse7) .cse6))) .cse6))))))))) (and (or .cse0 .cse1 (fp.geq .cse2 (_ +zero 8 24))) (or .cse0 .cse1 (fp.leq .cse2 .cse3))))) is different from true [2018-11-23 02:31:25,439 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or .cse0 (forall ((v_prenex_38 (_ FloatingPoint 8 24)) (v_prenex_37 (_ FloatingPoint 8 24))) (let ((.cse11 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (fp.leq (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 v_prenex_38) .cse3) (fp.div roundNearestTiesToEven v_prenex_37 .cse3))) (.cse10 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_38 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 v_prenex_37) .cse3)))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse9) .cse3) (fp.div roundNearestTiesToEven .cse10 .cse3))) (.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse9 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse10) .cse3)))) (let ((.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse7) .cse3) (fp.div roundNearestTiesToEven .cse8 .cse3))) (.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse8) .cse3)))) (let ((.cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse5) .cse3) (fp.div roundNearestTiesToEven .cse6 .cse3))) (.cse4 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse5 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse6) .cse3)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.div roundNearestTiesToEven .cse4 .cse3)) .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse2 .cse3) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse4) .cse3))) .cse3))))))) .cse11) (fp.leq v_prenex_37 .cse11))))) (or .cse0 (forall ((v_prenex_44 (_ FloatingPoint 8 24)) (v_prenex_43 (_ FloatingPoint 8 24))) (let ((.cse12 (let ((.cse13 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse15 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse21 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 v_prenex_44) .cse15) (fp.div roundNearestTiesToEven v_prenex_43 .cse15))) (.cse22 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_44 .cse15) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 v_prenex_43) .cse15)))) (let ((.cse19 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse21) .cse15) (fp.div roundNearestTiesToEven .cse22 .cse15))) (.cse20 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse21 .cse15) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse22) .cse15)))) (let ((.cse17 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse19) .cse15) (fp.div roundNearestTiesToEven .cse20 .cse15))) (.cse18 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse19 .cse15) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse20) .cse15)))) (let ((.cse14 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse17) .cse15) (fp.div roundNearestTiesToEven .cse18 .cse15))) (.cse16 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse17 .cse15) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse18) .cse15)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse14) .cse15) (fp.div roundNearestTiesToEven .cse16 .cse15)) .cse15) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse14 .cse15) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse16) .cse15))) .cse15))))))))) (or (not (fp.geq .cse12 (_ +zero 8 24))) (fp.geq v_prenex_43 (_ +zero 8 24)) (fp.leq .cse12 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))))) (or .cse0 (forall ((v_main_~y1~0_BEFORE_CALL_143 (_ FloatingPoint 8 24)) (v_main_~x1~0_BEFORE_CALL_132 (_ FloatingPoint 8 24))) (or (fp.geq v_main_~y1~0_BEFORE_CALL_143 (_ +zero 8 24)) (fp.geq (let ((.cse23 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse25 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse31 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse23 v_main_~x1~0_BEFORE_CALL_132) .cse25) (fp.div roundNearestTiesToEven v_main_~y1~0_BEFORE_CALL_143 .cse25))) (.cse32 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_main_~x1~0_BEFORE_CALL_132 .cse25) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse23 v_main_~y1~0_BEFORE_CALL_143) .cse25)))) (let ((.cse29 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse23 .cse31) .cse25) (fp.div roundNearestTiesToEven .cse32 .cse25))) (.cse30 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse31 .cse25) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse23 .cse32) .cse25)))) (let ((.cse27 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse23 .cse29) .cse25) (fp.div roundNearestTiesToEven .cse30 .cse25))) (.cse28 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse29 .cse25) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse23 .cse30) .cse25)))) (let ((.cse24 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse23 .cse27) .cse25) (fp.div roundNearestTiesToEven .cse28 .cse25))) (.cse26 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse27 .cse25) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse23 .cse28) .cse25)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse23 .cse24) .cse25) (fp.div roundNearestTiesToEven .cse26 .cse25)) .cse25) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse23 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse24 .cse25) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse23 .cse26) .cse25))) .cse25))))))) (_ +zero 8 24))))) (or .cse0 (forall ((v_prenex_42 (_ FloatingPoint 8 24)) (v_prenex_41 (_ FloatingPoint 8 24))) (or (fp.geq (let ((.cse33 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse35 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse41 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse33 v_prenex_42) .cse35) (fp.div roundNearestTiesToEven v_prenex_41 .cse35))) (.cse42 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_42 .cse35) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse33 v_prenex_41) .cse35)))) (let ((.cse39 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse33 .cse41) .cse35) (fp.div roundNearestTiesToEven .cse42 .cse35))) (.cse40 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse41 .cse35) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse33 .cse42) .cse35)))) (let ((.cse37 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse33 .cse39) .cse35) (fp.div roundNearestTiesToEven .cse40 .cse35))) (.cse38 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse39 .cse35) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse33 .cse40) .cse35)))) (let ((.cse34 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse33 .cse37) .cse35) (fp.div roundNearestTiesToEven .cse38 .cse35))) (.cse36 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse37 .cse35) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse33 .cse38) .cse35)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse33 .cse34) .cse35) (fp.div roundNearestTiesToEven .cse36 .cse35)) .cse35) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse33 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse34 .cse35) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse33 .cse36) .cse35))) .cse35))))))) (_ +zero 8 24)) (fp.leq v_prenex_41 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) (or .cse0 (forall ((v_prenex_36 (_ FloatingPoint 8 24)) (v_prenex_35 (_ FloatingPoint 8 24))) (let ((.cse44 (let ((.cse45 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse47 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse53 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse45 v_prenex_36) .cse47) (fp.div roundNearestTiesToEven v_prenex_35 .cse47))) (.cse54 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_36 .cse47) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse45 v_prenex_35) .cse47)))) (let ((.cse51 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse45 .cse53) .cse47) (fp.div roundNearestTiesToEven .cse54 .cse47))) (.cse52 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse53 .cse47) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse45 .cse54) .cse47)))) (let ((.cse49 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse45 .cse51) .cse47) (fp.div roundNearestTiesToEven .cse52 .cse47))) (.cse50 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse51 .cse47) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse45 .cse52) .cse47)))) (let ((.cse46 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse45 .cse49) .cse47) (fp.div roundNearestTiesToEven .cse50 .cse47))) (.cse48 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse49 .cse47) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse45 .cse50) .cse47)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse45 .cse46) .cse47) (fp.div roundNearestTiesToEven .cse48 .cse47)) .cse47) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse45 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse46 .cse47) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse45 .cse48) .cse47))) .cse47)))))))) (.cse43 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (fp.leq v_prenex_35 .cse43) (not (fp.geq .cse44 (_ +zero 8 24))) (fp.leq .cse44 .cse43))))) (or .cse0 (forall ((v_prenex_39 (_ FloatingPoint 8 24)) (v_prenex_40 (_ FloatingPoint 8 24))) (or (fp.leq (let ((.cse55 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse57 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse63 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse55 v_prenex_40) .cse57) (fp.div roundNearestTiesToEven v_prenex_39 .cse57))) (.cse64 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_40 .cse57) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse55 v_prenex_39) .cse57)))) (let ((.cse61 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse55 .cse63) .cse57) (fp.div roundNearestTiesToEven .cse64 .cse57))) (.cse62 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse63 .cse57) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse55 .cse64) .cse57)))) (let ((.cse59 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse55 .cse61) .cse57) (fp.div roundNearestTiesToEven .cse62 .cse57))) (.cse60 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse61 .cse57) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse55 .cse62) .cse57)))) (let ((.cse56 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse55 .cse59) .cse57) (fp.div roundNearestTiesToEven .cse60 .cse57))) (.cse58 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse59 .cse57) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse55 .cse60) .cse57)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse55 .cse56) .cse57) (fp.div roundNearestTiesToEven .cse58 .cse57)) .cse57) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse55 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse56 .cse57) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse55 .cse58) .cse57))) .cse57))))))) ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq v_prenex_39 (_ +zero 8 24))))))) is different from true [2018-11-23 02:32:22,627 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse1 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or .cse0 .cse1 (forall ((v_main_~y1~0_BEFORE_CALL_143 (_ FloatingPoint 8 24)) (v_main_~x1~0_BEFORE_CALL_132 (_ FloatingPoint 8 24))) (or (fp.geq v_main_~y1~0_BEFORE_CALL_143 (_ +zero 8 24)) (fp.geq (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse10 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 v_main_~x1~0_BEFORE_CALL_132) .cse4) (fp.div roundNearestTiesToEven v_main_~y1~0_BEFORE_CALL_143 .cse4))) (.cse11 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_main_~x1~0_BEFORE_CALL_132 .cse4) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 v_main_~y1~0_BEFORE_CALL_143) .cse4)))) (let ((.cse8 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse10) .cse4) (fp.div roundNearestTiesToEven .cse11 .cse4))) (.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse10 .cse4) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse11) .cse4)))) (let ((.cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse8) .cse4) (fp.div roundNearestTiesToEven .cse9 .cse4))) (.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse8 .cse4) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse9) .cse4)))) (let ((.cse3 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse6) .cse4) (fp.div roundNearestTiesToEven .cse7 .cse4))) (.cse5 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse6 .cse4) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse7) .cse4)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) .cse4) (fp.div roundNearestTiesToEven .cse5 .cse4)) .cse4) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse3 .cse4) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse5) .cse4))) .cse4))))))) (_ +zero 8 24))))) (or .cse0 .cse1 (forall ((v_prenex_44 (_ FloatingPoint 8 24)) (v_prenex_43 (_ FloatingPoint 8 24))) (let ((.cse12 (let ((.cse13 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse15 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse21 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 v_prenex_44) .cse15) (fp.div roundNearestTiesToEven v_prenex_43 .cse15))) (.cse22 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_44 .cse15) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 v_prenex_43) .cse15)))) (let ((.cse19 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse21) .cse15) (fp.div roundNearestTiesToEven .cse22 .cse15))) (.cse20 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse21 .cse15) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse22) .cse15)))) (let ((.cse17 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse19) .cse15) (fp.div roundNearestTiesToEven .cse20 .cse15))) (.cse18 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse19 .cse15) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse20) .cse15)))) (let ((.cse14 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse17) .cse15) (fp.div roundNearestTiesToEven .cse18 .cse15))) (.cse16 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse17 .cse15) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse18) .cse15)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse14) .cse15) (fp.div roundNearestTiesToEven .cse16 .cse15)) .cse15) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse14 .cse15) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse13 .cse16) .cse15))) .cse15))))))))) (or (not (fp.geq .cse12 (_ +zero 8 24))) (fp.geq v_prenex_43 (_ +zero 8 24)) (fp.leq .cse12 ((_ to_fp 8 24) roundNearestTiesToEven 100.0)))))) (or .cse0 .cse1 (forall ((v_prenex_42 (_ FloatingPoint 8 24)) (v_prenex_41 (_ FloatingPoint 8 24))) (or (fp.geq (let ((.cse23 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse25 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse31 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse23 v_prenex_42) .cse25) (fp.div roundNearestTiesToEven v_prenex_41 .cse25))) (.cse32 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_42 .cse25) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse23 v_prenex_41) .cse25)))) (let ((.cse29 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse23 .cse31) .cse25) (fp.div roundNearestTiesToEven .cse32 .cse25))) (.cse30 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse31 .cse25) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse23 .cse32) .cse25)))) (let ((.cse27 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse23 .cse29) .cse25) (fp.div roundNearestTiesToEven .cse30 .cse25))) (.cse28 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse29 .cse25) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse23 .cse30) .cse25)))) (let ((.cse24 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse23 .cse27) .cse25) (fp.div roundNearestTiesToEven .cse28 .cse25))) (.cse26 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse27 .cse25) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse23 .cse28) .cse25)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse23 .cse24) .cse25) (fp.div roundNearestTiesToEven .cse26 .cse25)) .cse25) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse23 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse24 .cse25) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse23 .cse26) .cse25))) .cse25))))))) (_ +zero 8 24)) (fp.leq v_prenex_41 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))))) (or .cse0 .cse1 (forall ((v_prenex_38 (_ FloatingPoint 8 24)) (v_prenex_37 (_ FloatingPoint 8 24))) (let ((.cse43 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (fp.leq (let ((.cse33 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse35 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse41 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse33 v_prenex_38) .cse35) (fp.div roundNearestTiesToEven v_prenex_37 .cse35))) (.cse42 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_38 .cse35) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse33 v_prenex_37) .cse35)))) (let ((.cse39 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse33 .cse41) .cse35) (fp.div roundNearestTiesToEven .cse42 .cse35))) (.cse40 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse41 .cse35) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse33 .cse42) .cse35)))) (let ((.cse37 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse33 .cse39) .cse35) (fp.div roundNearestTiesToEven .cse40 .cse35))) (.cse38 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse39 .cse35) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse33 .cse40) .cse35)))) (let ((.cse34 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse33 .cse37) .cse35) (fp.div roundNearestTiesToEven .cse38 .cse35))) (.cse36 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse37 .cse35) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse33 .cse38) .cse35)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse33 .cse34) .cse35) (fp.div roundNearestTiesToEven .cse36 .cse35)) .cse35) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse33 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse34 .cse35) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse33 .cse36) .cse35))) .cse35))))))) .cse43) (fp.leq v_prenex_37 .cse43))))) (or .cse0 .cse1 (forall ((v_prenex_36 (_ FloatingPoint 8 24)) (v_prenex_35 (_ FloatingPoint 8 24))) (let ((.cse45 (let ((.cse46 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse48 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse54 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 v_prenex_36) .cse48) (fp.div roundNearestTiesToEven v_prenex_35 .cse48))) (.cse55 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_36 .cse48) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 v_prenex_35) .cse48)))) (let ((.cse52 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 .cse54) .cse48) (fp.div roundNearestTiesToEven .cse55 .cse48))) (.cse53 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse54 .cse48) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 .cse55) .cse48)))) (let ((.cse50 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 .cse52) .cse48) (fp.div roundNearestTiesToEven .cse53 .cse48))) (.cse51 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse52 .cse48) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 .cse53) .cse48)))) (let ((.cse47 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 .cse50) .cse48) (fp.div roundNearestTiesToEven .cse51 .cse48))) (.cse49 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse50 .cse48) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 .cse51) .cse48)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 .cse47) .cse48) (fp.div roundNearestTiesToEven .cse49 .cse48)) .cse48) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse47 .cse48) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse46 .cse49) .cse48))) .cse48)))))))) (.cse44 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (fp.leq v_prenex_35 .cse44) (not (fp.geq .cse45 (_ +zero 8 24))) (fp.leq .cse45 .cse44))))) (or .cse0 .cse1 (forall ((v_prenex_39 (_ FloatingPoint 8 24)) (v_prenex_40 (_ FloatingPoint 8 24))) (or (fp.leq (let ((.cse56 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse58 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse64 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse56 v_prenex_40) .cse58) (fp.div roundNearestTiesToEven v_prenex_39 .cse58))) (.cse65 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_40 .cse58) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse56 v_prenex_39) .cse58)))) (let ((.cse62 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse56 .cse64) .cse58) (fp.div roundNearestTiesToEven .cse65 .cse58))) (.cse63 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse64 .cse58) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse56 .cse65) .cse58)))) (let ((.cse60 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse56 .cse62) .cse58) (fp.div roundNearestTiesToEven .cse63 .cse58))) (.cse61 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse62 .cse58) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse56 .cse63) .cse58)))) (let ((.cse57 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse56 .cse60) .cse58) (fp.div roundNearestTiesToEven .cse61 .cse58))) (.cse59 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse60 .cse58) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse56 .cse61) .cse58)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse56 .cse57) .cse58) (fp.div roundNearestTiesToEven .cse59 .cse58)) .cse58) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse56 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse57 .cse58) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse56 .cse59) .cse58))) .cse58))))))) ((_ to_fp 8 24) roundNearestTiesToEven 100.0)) (fp.geq v_prenex_39 (_ +zero 8 24))))))) is different from true [2018-11-23 02:32:24,966 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (let ((.cse0 (not (fp.geq c_main_~y1~0 (_ +zero 8 24)))) (.cse1 (not (fp.leq c_main_~y1~0 .cse5))) (.cse3 (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse14 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 c_main_~x1~0) .cse8) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse8))) (.cse15 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse8) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 c_main_~y1~0) .cse8)))) (let ((.cse12 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse14) .cse8) (fp.div roundNearestTiesToEven .cse15 .cse8))) (.cse13 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse14 .cse8) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse15) .cse8)))) (let ((.cse10 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse12) .cse8) (fp.div roundNearestTiesToEven .cse13 .cse8))) (.cse11 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse12 .cse8) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse13) .cse8)))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse10) .cse8) (fp.div roundNearestTiesToEven .cse11 .cse8))) (.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse10 .cse8) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse11) .cse8)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse7) .cse8) (fp.div roundNearestTiesToEven .cse9 .cse8)) .cse8) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse8) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse9) .cse8))) .cse8)))))))) (.cse2 (not (fp.geq c_main_~x1~0 (_ +zero 8 24)))) (.cse4 (not (fp.leq c_main_~x1~0 .cse5)))) (and (or .cse0 .cse1 .cse2 (fp.geq .cse3 (_ +zero 8 24)) .cse4) (or .cse0 .cse1 (fp.leq .cse3 .cse5) .cse2 .cse4)))) is different from false [2018-11-23 02:32:27,244 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (let ((.cse0 (not (fp.geq c_main_~y1~0 (_ +zero 8 24)))) (.cse1 (not (fp.leq c_main_~y1~0 .cse5))) (.cse3 (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse8 ((_ to_fp 8 24) roundNearestTiesToEven 4.0))) (let ((.cse14 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 c_main_~x1~0) .cse8) (fp.div roundNearestTiesToEven c_main_~y1~0 .cse8))) (.cse15 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~x1~0 .cse8) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 c_main_~y1~0) .cse8)))) (let ((.cse12 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse14) .cse8) (fp.div roundNearestTiesToEven .cse15 .cse8))) (.cse13 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse14 .cse8) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse15) .cse8)))) (let ((.cse10 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse12) .cse8) (fp.div roundNearestTiesToEven .cse13 .cse8))) (.cse11 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse12 .cse8) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse13) .cse8)))) (let ((.cse7 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse10) .cse8) (fp.div roundNearestTiesToEven .cse11 .cse8))) (.cse9 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse10 .cse8) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse11) .cse8)))) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse7) .cse8) (fp.div roundNearestTiesToEven .cse9 .cse8)) .cse8) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse7 .cse8) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse9) .cse8))) .cse8)))))))) (.cse2 (not (fp.geq c_main_~x1~0 (_ +zero 8 24)))) (.cse4 (not (fp.leq c_main_~x1~0 .cse5)))) (and (or .cse0 .cse1 .cse2 (fp.geq .cse3 (_ +zero 8 24)) .cse4) (or .cse0 .cse1 (fp.leq .cse3 .cse5) .cse2 .cse4)))) is different from true [2018-11-23 02:32:56,079 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-23 02:32:56,280 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2018-11-23 02:32:56,281 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:845) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-11-23 02:32:56,284 INFO L168 Benchmark]: Toolchain (without parser) took 857117.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.6 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -181.9 MB). Peak memory consumption was 35.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:32:56,285 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:32:56,285 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.48 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:32:56,286 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.75 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 933.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:32:56,286 INFO L168 Benchmark]: Boogie Preprocessor took 18.80 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:32:56,286 INFO L168 Benchmark]: RCFGBuilder took 1473.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -155.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:32:56,287 INFO L168 Benchmark]: TraceAbstraction took 855405.51 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 99.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -42.8 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:32:56,290 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.16 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 197.48 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.75 ms. Allocated memory is still 1.0 GB. Free memory was 939.0 MB in the beginning and 933.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.80 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1473.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -155.2 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 855405.51 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 99.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -42.8 MB). Peak memory consumption was 56.3 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...