./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c5828f0140d590ad7769cb7343d2c3b5784d8d5d ............................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c5828f0140d590ad7769cb7343d2c3b5784d8d5d ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-30 01:24:44,075 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:24:44,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:24:44,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:24:44,191 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:24:44,193 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:24:44,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:24:44,199 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:24:44,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:24:44,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:24:44,206 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:24:44,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:24:44,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:24:44,212 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:24:44,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:24:44,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:24:44,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:24:44,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:24:44,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:24:44,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:24:44,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:24:44,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:24:44,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:24:44,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:24:44,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:24:44,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:24:44,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:24:44,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:24:44,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:24:44,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:24:44,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:24:44,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:24:44,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:24:44,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:24:44,255 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:24:44,255 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:24:44,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:24:44,259 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:24:44,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:24:44,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:24:44,265 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:24:44,269 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 01:24:44,311 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:24:44,311 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:24:44,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:24:44,313 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:24:44,314 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:24:44,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:24:44,314 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:24:44,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:24:44,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:24:44,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:24:44,316 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:24:44,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:24:44,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:24:44,317 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:24:44,317 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:24:44,317 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:24:44,317 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:24:44,318 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:24:44,318 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:24:44,318 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:24:44,319 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:24:44,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:24:44,319 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:24:44,320 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:24:44,320 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:24:44,320 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 01:24:44,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:24:44,321 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:24:44,321 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:24:44,322 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_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 -> c5828f0140d590ad7769cb7343d2c3b5784d8d5d [2020-11-30 01:24:44,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:24:44,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:24:44,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:24:44,775 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:24:44,778 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:24:44,780 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/../../sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c [2020-11-30 01:24:44,873 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/data/8f8bb5b96/b67343c2d8814191b6c3c93eb2130399/FLAG9d70aadf6 [2020-11-30 01:24:45,529 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:24:45,530 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c [2020-11-30 01:24:45,543 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/data/8f8bb5b96/b67343c2d8814191b6c3c93eb2130399/FLAG9d70aadf6 [2020-11-30 01:24:45,909 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/data/8f8bb5b96/b67343c2d8814191b6c3c93eb2130399 [2020-11-30 01:24:45,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:24:45,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:24:45,925 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:24:45,925 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:24:45,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:24:45,932 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:24:45" (1/1) ... [2020-11-30 01:24:45,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@423a63f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:45, skipping insertion in model container [2020-11-30 01:24:45,935 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:24:45" (1/1) ... [2020-11-30 01:24:45,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:24:45,963 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:24:46,170 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:24:46,181 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:24:46,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:24:46,216 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:24:46,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:46 WrapperNode [2020-11-30 01:24:46,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:24:46,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:24:46,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:24:46,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:24:46,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:46" (1/1) ... [2020-11-30 01:24:46,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:46" (1/1) ... [2020-11-30 01:24:46,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:24:46,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:24:46,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:24:46,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:24:46,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:46" (1/1) ... [2020-11-30 01:24:46,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:46" (1/1) ... [2020-11-30 01:24:46,286 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:46" (1/1) ... [2020-11-30 01:24:46,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:46" (1/1) ... [2020-11-30 01:24:46,292 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:46" (1/1) ... [2020-11-30 01:24:46,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:46" (1/1) ... [2020-11-30 01:24:46,295 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:46" (1/1) ... [2020-11-30 01:24:46,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:24:46,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:24:46,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:24:46,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:24:46,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:24:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:24:46,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:24:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:24:46,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:24:46,748 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:24:46,748 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-30 01:24:46,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:24:46 BoogieIcfgContainer [2020-11-30 01:24:46,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:24:46,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:24:46,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:24:46,758 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:24:46,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:24:45" (1/3) ... [2020-11-30 01:24:46,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5244686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:24:46, skipping insertion in model container [2020-11-30 01:24:46,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:46" (2/3) ... [2020-11-30 01:24:46,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5244686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:24:46, skipping insertion in model container [2020-11-30 01:24:46,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:24:46" (3/3) ... [2020-11-30 01:24:46,763 INFO L111 eAbstractionObserver]: Analyzing ICFG Float_div.i.p+cfa-reducer.c [2020-11-30 01:24:46,777 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:24:46,782 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 01:24:46,797 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-30 01:24:46,842 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:24:46,843 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 01:24:46,843 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:24:46,843 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:24:46,843 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:24:46,843 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:24:46,844 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:24:46,844 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:24:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2020-11-30 01:24:46,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-30 01:24:46,868 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:24:46,869 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-30 01:24:46,869 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:24:46,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:24:46,877 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2020-11-30 01:24:46,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 01:24:46,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089269891] [2020-11-30 01:24:46,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:24:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:24:47,057 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:24:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:24:47,102 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:24:47,137 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 01:24:47,138 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 01:24:47,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 01:24:47,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:24:47 BoogieIcfgContainer [2020-11-30 01:24:47,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:24:47,182 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:24:47,182 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:24:47,182 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:24:47,184 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:24:46" (3/4) ... [2020-11-30 01:24:47,189 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-30 01:24:47,189 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:24:47,194 INFO L168 Benchmark]: Toolchain (without parser) took 1272.56 ms. Allocated memory was 109.1 MB in the beginning and 136.3 MB in the end (delta: 27.3 MB). Free memory was 81.3 MB in the beginning and 87.0 MB in the end (delta: -5.7 MB). Peak memory consumption was 19.6 MB. Max. memory is 16.1 GB. [2020-11-30 01:24:47,196 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 109.1 MB. Free memory is still 66.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:24:47,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.67 ms. Allocated memory was 109.1 MB in the beginning and 136.3 MB in the end (delta: 27.3 MB). Free memory was 81.3 MB in the beginning and 112.8 MB in the end (delta: -31.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:24:47,201 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.95 ms. Allocated memory is still 136.3 MB. Free memory was 112.8 MB in the beginning and 111.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:24:47,202 INFO L168 Benchmark]: Boogie Preprocessor took 26.17 ms. Allocated memory is still 136.3 MB. Free memory was 111.2 MB in the beginning and 110.7 MB in the end (delta: 539.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:24:47,203 INFO L168 Benchmark]: RCFGBuilder took 452.57 ms. Allocated memory is still 136.3 MB. Free memory was 110.7 MB in the beginning and 99.6 MB in the end (delta: 11.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:24:47,205 INFO L168 Benchmark]: TraceAbstraction took 426.17 ms. Allocated memory is still 136.3 MB. Free memory was 99.2 MB in the beginning and 87.6 MB in the end (delta: 11.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-30 01:24:47,206 INFO L168 Benchmark]: Witness Printer took 7.39 ms. Allocated memory is still 136.3 MB. Free memory was 87.6 MB in the beginning and 87.0 MB in the end (delta: 539.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:24:47,220 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 109.1 MB. Free memory is still 66.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 292.67 ms. Allocated memory was 109.1 MB in the beginning and 136.3 MB in the end (delta: 27.3 MB). Free memory was 81.3 MB in the beginning and 112.8 MB in the end (delta: -31.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 50.95 ms. Allocated memory is still 136.3 MB. Free memory was 112.8 MB in the beginning and 111.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 26.17 ms. Allocated memory is still 136.3 MB. Free memory was 111.2 MB in the beginning and 110.7 MB in the end (delta: 539.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 452.57 ms. Allocated memory is still 136.3 MB. Free memory was 110.7 MB in the beginning and 99.6 MB in the end (delta: 11.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 426.17 ms. Allocated memory is still 136.3 MB. Free memory was 99.2 MB in the beginning and 87.6 MB in the end (delta: 11.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Witness Printer took 7.39 ms. Allocated memory is still 136.3 MB. Free memory was 87.6 MB in the beginning and 87.0 MB in the end (delta: 539.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 4]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 12, overapproximation of someBinaryArithmeticDOUBLEoperation at line 10. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L9] float main__x = 1.0; [L10] float main__x1 = main__x / 2.5; VAL [__return_main=0] [L12] COND FALSE !(main__x1 != main__x) [L21] int __tmp_1; [L22] __tmp_1 = main__x == 0 [L23] int __VERIFIER_assert__cond; [L24] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0] [L25] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0] [L4] __assert_fail("0", "Float_div.i.p+cfa-reducer.c", 4, "reach_error") VAL [__return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-11-30 01:24:50,468 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:24:50,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:24:50,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:24:50,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:24:50,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:24:50,535 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:24:50,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:24:50,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:24:50,556 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:24:50,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:24:50,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:24:50,561 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:24:50,562 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:24:50,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:24:50,566 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:24:50,567 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:24:50,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:24:50,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:24:50,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:24:50,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:24:50,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:24:50,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:24:50,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:24:50,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:24:50,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:24:50,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:24:50,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:24:50,616 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:24:50,617 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:24:50,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:24:50,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:24:50,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:24:50,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:24:50,624 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:24:50,624 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:24:50,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:24:50,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:24:50,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:24:50,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:24:50,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:24:50,630 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-11-30 01:24:50,690 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:24:50,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:24:50,692 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 01:24:50,692 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 01:24:50,693 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 01:24:50,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:24:50,693 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:24:50,693 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:24:50,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:24:50,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:24:50,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:24:50,694 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:24:50,695 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-30 01:24:50,695 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-30 01:24:50,695 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:24:50,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:24:50,699 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:24:50,699 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:24:50,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:24:50,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:24:50,700 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:24:50,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:24:50,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:24:50,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:24:50,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:24:50,702 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:24:50,702 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-11-30 01:24:50,702 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-30 01:24:50,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:24:50,704 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:24:50,704 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 01:24:50,704 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_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 -> c5828f0140d590ad7769cb7343d2c3b5784d8d5d [2020-11-30 01:24:51,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:24:51,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:24:51,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:24:51,331 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:24:51,336 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:24:51,337 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/../../sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c [2020-11-30 01:24:51,428 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/data/c83b8c7af/2742aad1b2e64678a5d4add2e7ce546d/FLAGb70d9ddbc [2020-11-30 01:24:52,148 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:24:52,148 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/sv-benchmarks/c/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c [2020-11-30 01:24:52,158 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/data/c83b8c7af/2742aad1b2e64678a5d4add2e7ce546d/FLAGb70d9ddbc [2020-11-30 01:24:52,521 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/data/c83b8c7af/2742aad1b2e64678a5d4add2e7ce546d [2020-11-30 01:24:52,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:24:52,526 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:24:52,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:24:52,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:24:52,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:24:52,533 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:24:52" (1/1) ... [2020-11-30 01:24:52,535 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21030de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:52, skipping insertion in model container [2020-11-30 01:24:52,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:24:52" (1/1) ... [2020-11-30 01:24:52,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:24:52,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:24:52,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:24:52,768 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:24:52,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:24:52,826 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:24:52,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:52 WrapperNode [2020-11-30 01:24:52,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:24:52,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:24:52,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:24:52,831 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:24:52,840 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:52" (1/1) ... [2020-11-30 01:24:52,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:52" (1/1) ... [2020-11-30 01:24:52,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:24:52,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:24:52,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:24:52,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:24:52,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:52" (1/1) ... [2020-11-30 01:24:52,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:52" (1/1) ... [2020-11-30 01:24:52,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:52" (1/1) ... [2020-11-30 01:24:52,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:52" (1/1) ... [2020-11-30 01:24:52,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:52" (1/1) ... [2020-11-30 01:24:52,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:52" (1/1) ... [2020-11-30 01:24:52,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:52" (1/1) ... [2020-11-30 01:24:52,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:24:52,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:24:52,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:24:52,969 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:24:52,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:24:53,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:24:53,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:24:53,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-30 01:24:53,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:24:56,547 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:24:56,547 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-30 01:24:56,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:24:56 BoogieIcfgContainer [2020-11-30 01:24:56,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:24:56,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:24:56,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:24:56,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:24:56,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:24:52" (1/3) ... [2020-11-30 01:24:56,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12022d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:24:56, skipping insertion in model container [2020-11-30 01:24:56,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:24:52" (2/3) ... [2020-11-30 01:24:56,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12022d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:24:56, skipping insertion in model container [2020-11-30 01:24:56,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:24:56" (3/3) ... [2020-11-30 01:24:56,561 INFO L111 eAbstractionObserver]: Analyzing ICFG Float_div.i.p+cfa-reducer.c [2020-11-30 01:24:56,576 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:24:56,582 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 01:24:56,598 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-30 01:24:56,629 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:24:56,629 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 01:24:56,629 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:24:56,630 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:24:56,630 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:24:56,630 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:24:56,630 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:24:56,630 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:24:56,646 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2020-11-30 01:24:56,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-30 01:24:56,652 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:24:56,653 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-30 01:24:56,653 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:24:56,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:24:56,661 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2020-11-30 01:24:56,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:24:56,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263023104] [2020-11-30 01:24:56,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-11-30 01:24:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:24:57,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-30 01:24:57,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:25:08,959 WARN L193 SmtUtils]: Spent 7.12 s on a formula simplification that was a NOOP. DAG size: 14 [2020-11-30 01:25:08,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:25:08,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:25:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:25:11,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263023104] [2020-11-30 01:25:11,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:25:11,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-11-30 01:25:11,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334024793] [2020-11-30 01:25:11,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 01:25:11,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:25:11,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 01:25:11,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=10, Unknown=2, NotChecked=0, Total=20 [2020-11-30 01:25:11,486 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 5 states. [2020-11-30 01:25:19,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:25:19,403 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-11-30 01:25:19,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 01:25:19,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2020-11-30 01:25:19,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:25:19,416 INFO L225 Difference]: With dead ends: 17 [2020-11-30 01:25:19,416 INFO L226 Difference]: Without dead ends: 7 [2020-11-30 01:25:19,419 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=8, Invalid=10, Unknown=2, NotChecked=0, Total=20 [2020-11-30 01:25:19,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2020-11-30 01:25:19,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-11-30 01:25:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-11-30 01:25:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2020-11-30 01:25:19,466 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2020-11-30 01:25:19,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:25:19,467 INFO L481 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2020-11-30 01:25:19,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 01:25:19,467 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2020-11-30 01:25:19,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-30 01:25:19,469 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:25:19,469 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-30 01:25:19,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-30 01:25:19,684 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:25:19,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:25:19,685 INFO L82 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2020-11-30 01:25:19,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:25:19,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881425646] [2020-11-30 01:25:19,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-11-30 01:25:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:25:20,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-30 01:25:20,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:25:20,777 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-11-30 01:25:23,097 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0)) c_ULTIMATE.start_main_~main__x~0) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0))))) is different from true [2020-11-30 01:25:23,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2020-11-30 01:25:23,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:25:25,437 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2020-11-30 01:25:27,749 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from true [2020-11-30 01:25:30,086 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-11-30 01:25:32,406 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-11-30 01:25:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2020-11-30 01:25:32,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881425646] [2020-11-30 01:25:32,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:25:32,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-11-30 01:25:32,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277659633] [2020-11-30 01:25:32,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-30 01:25:32,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:25:32,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-30 01:25:32,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=13, Unknown=5, NotChecked=24, Total=56 [2020-11-30 01:25:32,412 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 8 states. [2020-11-30 01:25:34,770 WARN L860 $PredicateComparison]: unable to prove that (and (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-30 01:25:37,112 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)))) is different from false [2020-11-30 01:25:39,455 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)))) is different from true [2020-11-30 01:25:41,809 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0)) c_ULTIMATE.start_main_~main__x~0) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0))) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)))) is different from true [2020-11-30 01:25:46,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:25:46,793 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2020-11-30 01:25:46,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 01:25:46,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2020-11-30 01:25:46,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:25:46,796 INFO L225 Difference]: With dead ends: 11 [2020-11-30 01:25:46,796 INFO L226 Difference]: Without dead ends: 8 [2020-11-30 01:25:46,797 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=20, Invalid=15, Unknown=9, NotChecked=66, Total=110 [2020-11-30 01:25:46,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-11-30 01:25:46,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-11-30 01:25:46,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-11-30 01:25:46,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-11-30 01:25:46,800 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2020-11-30 01:25:46,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:25:46,801 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-11-30 01:25:46,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-30 01:25:46,801 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-11-30 01:25:46,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-30 01:25:46,802 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:25:46,802 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2020-11-30 01:25:47,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-30 01:25:47,008 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:25:47,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:25:47,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1805796550, now seen corresponding path program 2 times [2020-11-30 01:25:47,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:25:47,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228042701] [2020-11-30 01:25:47,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-11-30 01:25:47,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 01:25:47,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:25:47,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-30 01:25:47,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:25:48,321 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-11-30 01:25:50,647 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-30 01:25:52,988 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))))) is different from false [2020-11-30 01:25:55,494 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))))) is different from true [2020-11-30 01:25:55,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2020-11-30 01:25:55,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:25:57,924 WARN L838 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) c_ULTIMATE.start_main_~main__x1~0))) is different from false [2020-11-30 01:26:00,194 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) c_ULTIMATE.start_main_~main__x1~0))) is different from true [2020-11-30 01:26:02,716 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2020-11-30 01:26:05,289 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2020-11-30 01:26:07,805 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2020-11-30 01:26:10,421 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2020-11-30 01:26:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2020-11-30 01:26:10,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228042701] [2020-11-30 01:26:10,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:26:10,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2020-11-30 01:26:10,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35081537] [2020-11-30 01:26:10,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-30 01:26:10,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:26:10,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-30 01:26:10,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=21, Unknown=9, NotChecked=60, Total=110 [2020-11-30 01:26:10,426 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2020-11-30 01:26:13,078 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from true [2020-11-30 01:26:15,615 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-11-30 01:26:17,940 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0))))) is different from false [2020-11-30 01:26:20,576 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0))))) is different from true [2020-11-30 01:26:25,114 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.eq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0))) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))))) is different from true [2020-11-30 01:26:28,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:26:28,635 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-11-30 01:26:28,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 01:26:28,636 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2020-11-30 01:26:28,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:26:28,637 INFO L225 Difference]: With dead ends: 12 [2020-11-30 01:26:28,637 INFO L226 Difference]: Without dead ends: 9 [2020-11-30 01:26:28,638 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 37.1s TimeCoverageRelationStatistics Valid=28, Invalid=24, Unknown=14, NotChecked=144, Total=210 [2020-11-30 01:26:28,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-11-30 01:26:28,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-11-30 01:26:28,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-11-30 01:26:28,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2020-11-30 01:26:28,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2020-11-30 01:26:28,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:26:28,642 INFO L481 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2020-11-30 01:26:28,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-30 01:26:28,642 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-11-30 01:26:28,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-30 01:26:28,642 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:26:28,642 INFO L422 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2020-11-30 01:26:28,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-30 01:26:28,843 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:26:28,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:26:28,844 INFO L82 PathProgramCache]: Analyzing trace with hash 145055718, now seen corresponding path program 3 times [2020-11-30 01:26:28,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:26:28,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500322393] [2020-11-30 01:26:28,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-11-30 01:26:30,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-11-30 01:26:30,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:26:30,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-30 01:26:30,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:26:30,486 WARN L193 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-11-30 01:26:32,812 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-30 01:26:35,451 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-11-30 01:26:38,383 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-11-30 01:26:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2020-11-30 01:26:38,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:26:40,787 WARN L838 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) c_ULTIMATE.start_main_~main__x1~0))) is different from false [2020-11-30 01:26:43,078 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) c_ULTIMATE.start_main_~main__x1~0))) is different from true [2020-11-30 01:26:45,714 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2020-11-30 01:26:48,348 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2020-11-30 01:26:51,192 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2020-11-30 01:26:54,097 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2020-11-30 01:26:57,052 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2020-11-30 01:26:59,903 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2020-11-30 01:26:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2020-11-30 01:26:59,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500322393] [2020-11-30 01:26:59,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:26:59,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2020-11-30 01:26:59,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330189372] [2020-11-30 01:26:59,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-30 01:26:59,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:26:59,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-30 01:26:59,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=23, Unknown=11, NotChecked=98, Total=156 [2020-11-30 01:26:59,908 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 13 states. [2020-11-30 01:27:02,883 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from true [2020-11-30 01:27:05,747 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from false [2020-11-30 01:27:08,746 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from true [2020-11-30 01:27:11,736 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-11-30 01:27:14,634 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0))))) is different from true [2020-11-30 01:27:17,690 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.eq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0))))) is different from true [2020-11-30 01:27:24,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:27:24,547 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-11-30 01:27:24,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:27:24,548 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2020-11-30 01:27:24,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:27:24,549 INFO L225 Difference]: With dead ends: 13 [2020-11-30 01:27:24,549 INFO L226 Difference]: Without dead ends: 10 [2020-11-30 01:27:24,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 47.5s TimeCoverageRelationStatistics Valid=34, Invalid=27, Unknown=17, NotChecked=228, Total=306 [2020-11-30 01:27:24,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-11-30 01:27:24,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-11-30 01:27:24,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-11-30 01:27:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-11-30 01:27:24,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2020-11-30 01:27:24,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:27:24,554 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-11-30 01:27:24,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-30 01:27:24,554 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-11-30 01:27:24,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-30 01:27:24,555 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:27:24,555 INFO L422 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2020-11-30 01:27:24,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-30 01:27:24,756 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:27:24,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:27:24,757 INFO L82 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 4 times [2020-11-30 01:27:24,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:27:24,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590959972] [2020-11-30 01:27:24,758 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-11-30 01:27:26,243 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-30 01:27:26,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:27:26,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-30 01:27:26,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:27:26,620 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-11-30 01:27:28,926 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-30 01:27:31,523 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-11-30 01:27:34,424 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-11-30 01:27:36,745 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0))) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-11-30 01:27:36,749 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2020-11-30 01:27:36,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:27:39,066 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2020-11-30 01:27:41,392 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from true [2020-11-30 01:27:44,002 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-11-30 01:27:46,597 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-11-30 01:27:49,528 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-11-30 01:27:52,453 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-11-30 01:27:55,879 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-11-30 01:27:59,174 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-11-30 01:28:02,437 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-11-30 01:28:05,729 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-11-30 01:28:05,730 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2020-11-30 01:28:05,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590959972] [2020-11-30 01:28:05,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:28:05,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2020-11-30 01:28:05,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623266408] [2020-11-30 01:28:05,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-30 01:28:05,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:28:05,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-30 01:28:05,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=16, Unknown=14, NotChecked=126, Total=182 [2020-11-30 01:28:05,733 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 14 states. [2020-11-30 01:28:09,136 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2020-11-30 01:28:12,280 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-11-30 01:28:15,134 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from false [2020-11-30 01:28:18,304 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from true [2020-11-30 01:28:20,880 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))))) is different from false [2020-11-30 01:28:23,975 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))))) is different from true [2020-11-30 01:28:27,148 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-11-30 01:28:29,445 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0))) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-11-30 01:28:33,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:28:33,691 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-11-30 01:28:33,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 01:28:33,694 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 9 [2020-11-30 01:28:33,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:28:33,695 INFO L225 Difference]: With dead ends: 14 [2020-11-30 01:28:33,695 INFO L226 Difference]: Without dead ends: 11 [2020-11-30 01:28:33,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 63.0s TimeCoverageRelationStatistics Valid=38, Invalid=20, Unknown=22, NotChecked=300, Total=380 [2020-11-30 01:28:33,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-11-30 01:28:33,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-11-30 01:28:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-11-30 01:28:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2020-11-30 01:28:33,701 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2020-11-30 01:28:33,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:28:33,701 INFO L481 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2020-11-30 01:28:33,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-30 01:28:33,701 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2020-11-30 01:28:33,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-30 01:28:33,702 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:28:33,702 INFO L422 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2020-11-30 01:28:33,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-11-30 01:28:33,908 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:28:33,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:28:33,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1957592038, now seen corresponding path program 5 times [2020-11-30 01:28:33,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:28:33,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880149642] [2020-11-30 01:28:33,910 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-11-30 01:28:35,679 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-11-30 01:28:35,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:28:35,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-30 01:28:35,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:28:36,105 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-11-30 01:28:38,401 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-30 01:28:40,987 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-11-30 01:28:43,815 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-11-30 01:28:46,986 WARN L860 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-30 01:28:49,292 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0))) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-11-30 01:28:49,295 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2020-11-30 01:28:49,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:28:51,586 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2020-11-30 01:28:53,878 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from true [2020-11-30 01:28:56,437 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-11-30 01:28:59,004 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-11-30 01:29:01,848 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-11-30 01:29:04,694 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-11-30 01:29:07,851 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-11-30 01:29:11,104 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-11-30 01:29:14,336 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-11-30 01:29:17,580 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-11-30 01:29:20,990 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-11-30 01:29:24,178 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-11-30 01:29:24,179 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2020-11-30 01:29:24,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880149642] [2020-11-30 01:29:24,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:29:24,180 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2020-11-30 01:29:24,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359484020] [2020-11-30 01:29:24,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-30 01:29:24,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:29:24,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-30 01:29:24,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=17, Unknown=17, NotChecked=176, Total=240 [2020-11-30 01:29:24,182 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 16 states. [2020-11-30 01:29:29,223 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2020-11-30 01:29:32,583 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from false [2020-11-30 01:29:35,647 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from true [2020-11-30 01:29:38,674 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-11-30 01:29:42,258 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from true [2020-11-30 01:29:44,776 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))))) is different from false [2020-11-30 01:29:48,492 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))))) is different from true [2020-11-30 01:29:50,771 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)))) is different from false [2020-11-30 01:29:54,518 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)))) is different from true [2020-11-30 01:29:56,804 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0))) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-11-30 01:30:02,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:30:02,552 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-11-30 01:30:02,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 01:30:02,553 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 10 [2020-11-30 01:30:02,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:30:02,554 INFO L225 Difference]: With dead ends: 15 [2020-11-30 01:30:02,554 INFO L226 Difference]: Without dead ends: 12 [2020-11-30 01:30:02,554 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 80.9s TimeCoverageRelationStatistics Valid=44, Invalid=21, Unknown=27, NotChecked=414, Total=506 [2020-11-30 01:30:02,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-11-30 01:30:02,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-11-30 01:30:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-11-30 01:30:02,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2020-11-30 01:30:02,558 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2020-11-30 01:30:02,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:30:02,558 INFO L481 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2020-11-30 01:30:02,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-30 01:30:02,559 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-11-30 01:30:02,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-30 01:30:02,559 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:30:02,559 INFO L422 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2020-11-30 01:30:02,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-11-30 01:30:02,760 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:30:02,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:30:02,760 INFO L82 PathProgramCache]: Analyzing trace with hash 555748550, now seen corresponding path program 6 times [2020-11-30 01:30:02,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:30:02,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662655662] [2020-11-30 01:30:02,761 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-11-30 01:30:04,513 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2020-11-30 01:30:04,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:30:04,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-30 01:30:04,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:30:04,923 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-11-30 01:30:07,188 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-30 01:30:09,726 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-11-30 01:30:12,520 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-11-30 01:30:15,611 WARN L860 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-30 01:30:20,145 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-30 01:30:23,301 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-11-30 01:30:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2020-11-30 01:30:23,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:30:25,676 WARN L838 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) c_ULTIMATE.start_main_~main__x1~0))) is different from false [2020-11-30 01:30:27,956 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) c_ULTIMATE.start_main_~main__x1~0))) is different from true [2020-11-30 01:30:30,471 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2020-11-30 01:30:33,039 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2020-11-30 01:30:35,874 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2020-11-30 01:30:38,734 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2020-11-30 01:30:41,991 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2020-11-30 01:30:45,298 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2020-11-30 01:30:48,570 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from false [2020-11-30 01:30:51,839 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2020-11-30 01:30:55,084 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from false [2020-11-30 01:30:58,339 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2020-11-30 01:31:01,596 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2020-11-30 01:31:04,801 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2020-11-30 01:31:04,802 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2020-11-30 01:31:04,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662655662] [2020-11-30 01:31:04,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:31:04,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2020-11-30 01:31:04,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778827717] [2020-11-30 01:31:04,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-30 01:31:04,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:31:04,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-30 01:31:04,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=26, Unknown=20, NotChecked=260, Total=342 [2020-11-30 01:31:04,805 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 19 states. [2020-11-30 01:31:08,111 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-30 01:31:11,354 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (or (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-11-30 01:31:14,638 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-11-30 01:31:18,182 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))))) is different from false [2020-11-30 01:31:21,583 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))))) is different from true [2020-11-30 01:31:24,987 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))))) is different from true [2020-11-30 01:31:28,314 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_ULTIMATE.start_main_~main__x1~0) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-11-30 01:31:30,610 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0))))) is different from false [2020-11-30 01:31:34,002 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0))))) is different from true [2020-11-30 01:31:37,338 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.eq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0))))) is different from true [2020-11-30 01:31:42,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:31:42,215 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-11-30 01:31:42,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-30 01:31:42,216 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 11 [2020-11-30 01:31:42,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:31:42,216 INFO L225 Difference]: With dead ends: 16 [2020-11-30 01:31:42,217 INFO L226 Difference]: Without dead ends: 13 [2020-11-30 01:31:42,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 92.6s TimeCoverageRelationStatistics Valid=52, Invalid=32, Unknown=30, NotChecked=588, Total=702 [2020-11-30 01:31:42,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-11-30 01:31:42,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-11-30 01:31:42,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-11-30 01:31:42,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2020-11-30 01:31:42,221 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2020-11-30 01:31:42,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:31:42,221 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2020-11-30 01:31:42,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-30 01:31:42,221 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-11-30 01:31:42,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-30 01:31:42,222 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:31:42,222 INFO L422 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1] [2020-11-30 01:31:42,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-11-30 01:31:42,430 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:31:42,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:31:42,430 INFO L82 PathProgramCache]: Analyzing trace with hash 48273382, now seen corresponding path program 7 times [2020-11-30 01:31:42,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:31:42,431 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678938555] [2020-11-30 01:31:42,431 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/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 [2020-11-30 01:31:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:31:44,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 18 conjunts are in the unsatisfiable core [2020-11-30 01:31:44,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:31:44,852 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-11-30 01:31:47,167 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-30 01:31:49,812 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-11-30 01:31:52,704 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-11-30 01:31:55,993 WARN L860 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-30 01:31:59,377 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-30 01:32:02,618 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-30 01:32:04,929 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0))) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-11-30 01:32:04,932 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2020-11-30 01:32:04,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:32:07,269 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2020-11-30 01:32:09,571 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from true [2020-11-30 01:32:12,173 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-11-30 01:32:14,766 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-11-30 01:32:17,646 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-11-30 01:32:20,532 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-11-30 01:32:23,916 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-11-30 01:32:27,349 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-11-30 01:32:30,671 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-11-30 01:32:34,074 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-11-30 01:32:37,565 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-11-30 01:32:40,955 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-11-30 01:32:44,382 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-11-30 01:32:47,916 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-11-30 01:32:51,404 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2020-11-30 01:32:54,840 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2020-11-30 01:32:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2020-11-30 01:32:54,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678938555] [2020-11-30 01:32:54,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:32:54,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2020-11-30 01:32:54,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290032207] [2020-11-30 01:32:54,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-30 01:32:54,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:32:54,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-30 01:32:54,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=19, Unknown=23, NotChecked=300, Total=380 [2020-11-30 01:32:54,844 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 20 states. [2020-11-30 01:32:58,197 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2020-11-30 01:33:01,711 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-11-30 01:33:05,393 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from false [2020-11-30 01:33:08,879 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from true [2020-11-30 01:33:12,330 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from true [2020-11-30 01:33:16,010 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))))) is different from false [2020-11-30 01:33:19,380 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))))) is different from true [2020-11-30 01:33:22,322 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from false [2020-11-30 01:33:25,840 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven) (not (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1))))) is different from true [2020-11-30 01:33:29,392 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (not (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-11-30 01:33:31,710 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)))) is different from false [2020-11-30 01:33:35,119 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)))) is different from true [2020-11-30 01:33:37,441 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0))) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-11-30 01:33:43,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:33:43,946 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-11-30 01:33:43,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-30 01:33:43,947 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 12 [2020-11-30 01:33:43,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:33:43,948 INFO L225 Difference]: With dead ends: 17 [2020-11-30 01:33:43,948 INFO L226 Difference]: Without dead ends: 14 [2020-11-30 01:33:43,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 112.8s TimeCoverageRelationStatistics Valid=56, Invalid=24, Unknown=36, NotChecked=696, Total=812 [2020-11-30 01:33:43,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-11-30 01:33:43,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-11-30 01:33:43,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-11-30 01:33:43,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2020-11-30 01:33:43,953 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2020-11-30 01:33:43,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:33:43,953 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2020-11-30 01:33:43,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-30 01:33:43,953 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-11-30 01:33:43,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-30 01:33:43,954 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:33:43,954 INFO L422 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1] [2020-11-30 01:33:44,154 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-11-30 01:33:44,154 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:33:44,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:33:44,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1496412358, now seen corresponding path program 8 times [2020-11-30 01:33:44,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:33:44,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1445376426] [2020-11-30 01:33:44,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/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 [2020-11-30 01:33:46,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-30 01:33:46,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:33:46,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 23 conjunts are in the unsatisfiable core [2020-11-30 01:33:46,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:33:46,986 WARN L193 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-11-30 01:33:49,292 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-30 01:33:51,912 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-11-30 01:33:54,807 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))))) is different from true [2020-11-30 01:33:58,180 WARN L860 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-30 01:34:01,514 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-30 01:34:04,841 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-30 01:34:08,284 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) c_ULTIMATE.start_main_~main__x1~0)) is different from true [2020-11-30 01:34:11,626 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_ULTIMATE.start_main_~main__x~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-11-30 01:34:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2020-11-30 01:34:11,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:34:13,991 WARN L838 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) c_ULTIMATE.start_main_~main__x1~0))) is different from false [2020-11-30 01:34:16,314 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) c_ULTIMATE.start_main_~main__x1~0))) is different from true [2020-11-30 01:34:18,928 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2020-11-30 01:34:21,562 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2020-11-30 01:34:24,502 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2020-11-30 01:34:27,446 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2020-11-30 01:34:30,862 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2020-11-30 01:34:34,178 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2020-11-30 01:34:37,490 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from false [2020-11-30 01:34:41,040 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2020-11-30 01:34:44,562 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from false [2020-11-30 01:34:48,075 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2020-11-30 01:34:51,638 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2020-11-30 01:34:54,975 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2020-11-30 01:34:58,248 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from false [2020-11-30 01:35:01,540 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2020-11-30 01:35:04,801 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from false [2020-11-30 01:35:08,063 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2020-11-30 01:35:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 36 not checked. [2020-11-30 01:35:08,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1445376426] [2020-11-30 01:35:08,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 01:35:08,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2020-11-30 01:35:08,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151601639] [2020-11-30 01:35:08,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-30 01:35:08,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 01:35:08,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-30 01:35:08,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=28, Unknown=26, NotChecked=408, Total=506 [2020-11-30 01:35:08,068 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 23 states. [2020-11-30 01:35:11,364 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))))) is different from true [2020-11-30 01:35:14,645 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (or (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-11-30 01:35:18,391 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from false [2020-11-30 01:35:22,064 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from true [2020-11-30 01:35:25,830 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))))) is different from false [2020-11-30 01:35:29,412 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))))) is different from true [2020-11-30 01:35:33,240 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))))) is different from false [2020-11-30 01:35:36,796 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))))) is different from true [2020-11-30 01:35:40,126 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1))) .cse1))) .cse1)) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-11-30 01:35:43,036 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from false [2020-11-30 01:35:46,440 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from true [2020-11-30 01:35:49,832 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-11-30 01:35:53,094 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_ULTIMATE.start_main_~main__x1~0) (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0))))) is different from true [2020-11-30 01:35:56,449 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0) (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0))) .cse0)) c_ULTIMATE.start_main_~main__x~0) (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.eq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0))))) is different from true [2020-11-30 01:36:03,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:36:03,425 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-11-30 01:36:03,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-30 01:36:03,425 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 13 [2020-11-30 01:36:03,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:36:03,426 INFO L225 Difference]: With dead ends: 18 [2020-11-30 01:36:03,426 INFO L226 Difference]: Without dead ends: 15 [2020-11-30 01:36:03,427 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 27 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 129.7s TimeCoverageRelationStatistics Valid=64, Invalid=34, Unknown=40, NotChecked=918, Total=1056 [2020-11-30 01:36:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-11-30 01:36:03,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-11-30 01:36:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-30 01:36:03,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2020-11-30 01:36:03,432 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2020-11-30 01:36:03,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:36:03,432 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2020-11-30 01:36:03,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-30 01:36:03,432 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-11-30 01:36:03,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-30 01:36:03,433 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:36:03,433 INFO L422 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1] [2020-11-30 01:36:03,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-11-30 01:36:03,634 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:36:03,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:36:03,634 INFO L82 PathProgramCache]: Analyzing trace with hash -855919642, now seen corresponding path program 9 times [2020-11-30 01:36:03,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 01:36:03,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865483944] [2020-11-30 01:36:03,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/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 [2020-11-30 01:36:05,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-11-30 01:36:05,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:36:05,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 01:36:05,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:36:09,305 WARN L860 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-30 01:36:11,894 WARN L838 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) c_ULTIMATE.start_main_~main__x1~0) (exists ((v_ULTIMATE.start_main_~main__x~0_52 (_ FloatingPoint 8 24))) (and (not (fp.eq c_ULTIMATE.start_main_~main__x~0 v_ULTIMATE.start_main_~main__x~0_52)) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~main__x~0_52) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2020-11-30 01:36:14,220 WARN L860 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) c_ULTIMATE.start_main_~main__x1~0) (exists ((v_ULTIMATE.start_main_~main__x~0_52 (_ FloatingPoint 8 24))) (and (not (fp.eq c_ULTIMATE.start_main_~main__x~0 v_ULTIMATE.start_main_~main__x~0_52)) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~main__x~0_52) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-30 01:36:14,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 01:36:28,254 WARN L838 $PredicateComparison]: unable to prove that (or (and (= c_ULTIMATE.start_main_~__VERIFIER_assert__cond~0 (_ bv0 32)) (exists ((v_ULTIMATE.start_main_~main__x~0_52 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_52) .cse1)))) (and (not (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (not (fp.eq .cse0 v_ULTIMATE.start_main_~main__x~0_52)) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0)))))) (and (exists ((v_ULTIMATE.start_main_~main__x~0_52 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_52) .cse3)))) (and (fp.eq .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (fp.eq .cse2 v_ULTIMATE.start_main_~main__x~0_52)) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse2) .cse3)) .cse2))))) (= (bvadd c_ULTIMATE.start_main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32)))) is different from false [2020-11-30 01:36:36,138 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~main__x~0_52 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_52) .cse1)))) (and (not (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (not (fp.eq .cse0 v_ULTIMATE.start_main_~main__x~0_52)) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from false [2020-11-30 01:36:38,673 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~main__x~0_52 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0)))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven v_ULTIMATE.start_main_~main__x~0_52) .cse1)))) (and (not (fp.eq .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (not (fp.eq .cse0 v_ULTIMATE.start_main_~main__x~0_52)) (fp.eq ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse0) .cse1)) .cse0))))) is different from true [2020-11-30 01:36:38,675 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 17 not checked. [2020-11-30 01:36:38,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:36:42,409 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 5.0 2.0)))) c_ULTIMATE.start_main_~main__x1~0))) is different from true [2020-11-30 01:36:43,347 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-11-30 01:36:43,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865483944] [2020-11-30 01:36:43,349 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") [2020-11-30 01:36:43,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [7429344] [2020-11-30 01:36:43,349 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-30 01:36:47,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-11-30 01:36:47,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:36:47,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 01:36:47,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:36:47,810 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@1ec96d2a [2020-11-30 01:36:47,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824917648] [2020-11-30 01:36:47,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c570fd5d-6db9-432e-9a21-de46d2dffae1/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-30 01:38:07,829 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-11-30 01:38:07,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-30 01:38:09,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-30 01:38:09,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:38:09,050 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@1ec96d2a [2020-11-30 01:38:09,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:38:09,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-11-30 01:38:09,051 ERROR L205 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2020-11-30 01:38:09,051 INFO L523 BasicCegarLoop]: Counterexample might be feasible [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forcibly destroying the process [2020-11-30 01:38:09,669 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 mathsat -unsat_core_generation=3 [2020-11-30 01:38:09,686 WARN L238 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-11-30 01:38:09,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:38:09 BoogieIcfgContainer [2020-11-30 01:38:09,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:38:09,687 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:38:09,687 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:38:09,687 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:38:09,688 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:24:56" (3/4) ... [2020-11-30 01:38:09,692 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-30 01:38:09,692 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:38:09,694 INFO L168 Benchmark]: Toolchain (without parser) took 797167.56 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 36.2 MB in the beginning and 25.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 23.9 MB. Max. memory is 16.1 GB. [2020-11-30 01:38:09,695 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 56.6 MB. Free memory was 38.9 MB in the beginning and 38.8 MB in the end (delta: 73.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:38:09,695 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.79 ms. Allocated memory is still 56.6 MB. Free memory was 36.0 MB in the beginning and 26.2 MB in the end (delta: 9.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:38:09,696 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.84 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 26.2 MB in the beginning and 55.6 MB in the end (delta: -29.3 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:38:09,697 INFO L168 Benchmark]: Boogie Preprocessor took 72.12 ms. Allocated memory is still 71.3 MB. Free memory was 55.6 MB in the beginning and 54.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:38:09,698 INFO L168 Benchmark]: RCFGBuilder took 3581.46 ms. Allocated memory is still 71.3 MB. Free memory was 54.4 MB in the beginning and 43.3 MB in the end (delta: 11.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:38:09,699 INFO L168 Benchmark]: TraceAbstraction took 793134.59 ms. Allocated memory is still 71.3 MB. Free memory was 43.0 MB in the beginning and 25.4 MB in the end (delta: 17.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:38:09,699 INFO L168 Benchmark]: Witness Printer took 5.15 ms. Allocated memory is still 71.3 MB. Free memory is still 25.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:38:09,711 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 56.6 MB. Free memory was 38.9 MB in the beginning and 38.8 MB in the end (delta: 73.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 299.79 ms. Allocated memory is still 56.6 MB. Free memory was 36.0 MB in the beginning and 26.2 MB in the end (delta: 9.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 64.84 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 26.2 MB in the beginning and 55.6 MB in the end (delta: -29.3 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 72.12 ms. Allocated memory is still 71.3 MB. Free memory was 55.6 MB in the beginning and 54.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3581.46 ms. Allocated memory is still 71.3 MB. Free memory was 54.4 MB in the beginning and 43.3 MB in the end (delta: 11.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 793134.59 ms. Allocated memory is still 71.3 MB. Free memory was 43.0 MB in the beginning and 25.4 MB in the end (delta: 17.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 16.1 GB. * Witness Printer took 5.15 ms. Allocated memory is still 71.3 MB. Free memory is still 25.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 4]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1] int __return_main; [L9] float main__x = 1.0; [L10] float main__x1 = main__x / 2.5; [L12] COND TRUE main__x1 != main__x [L14] main__x = main__x1 [L15] main__x1 = main__x / 2.5 [L12] COND TRUE main__x1 != main__x [L14] main__x = main__x1 [L15] main__x1 = main__x / 2.5 [L12] COND TRUE main__x1 != main__x [L14] main__x = main__x1 [L15] main__x1 = main__x / 2.5 [L12] COND TRUE main__x1 != main__x [L14] main__x = main__x1 [L15] main__x1 = main__x / 2.5 [L12] COND TRUE main__x1 != main__x [L14] main__x = main__x1 [L15] main__x1 = main__x / 2.5 [L12] COND TRUE main__x1 != main__x [L14] main__x = main__x1 [L15] main__x1 = main__x / 2.5 [L12] COND TRUE main__x1 != main__x [L14] main__x = main__x1 [L15] main__x1 = main__x / 2.5 [L12] COND TRUE main__x1 != main__x [L14] main__x = main__x1 [L15] main__x1 = main__x / 2.5 [L12] COND TRUE main__x1 != main__x [L14] main__x = main__x1 [L15] main__x1 = main__x / 2.5 [L12] COND FALSE !(main__x1 != main__x) [L21] int __tmp_1; [L22] __tmp_1 = main__x == 0 [L23] int __VERIFIER_assert__cond; [L24] __VERIFIER_assert__cond = __tmp_1 [L25] COND TRUE __VERIFIER_assert__cond == 0 [L4] __assert_fail("0", "Float_div.i.p+cfa-reducer.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 793.0s, OverallIterations: 10, TraceHistogramMax: 9, AutomataDifference: 273.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 47 SDtfs, 0 SDslu, 67 SDs, 0 SdLazy, 46 SolverSat, 0 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 48.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 23 SyntacticMatches, 10 SemanticMatches, 163 ConstructedPredicates, 132 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 599.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 12.2s SatisfiabilityAnalysisTime, 378.9s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 56580 SizeOfPredicates, 67 NumberOfNonLiveVariables, 378 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 0/240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...