./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cbb939d5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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-cbb939d [2020-11-23 16:09:49,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-23 16:09:49,844 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-23 16:09:49,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-23 16:09:49,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-23 16:09:49,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-23 16:09:49,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-23 16:09:49,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-23 16:09:49,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-23 16:09:49,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-23 16:09:49,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-23 16:09:49,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-23 16:09:49,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-23 16:09:49,934 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-23 16:09:49,935 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-23 16:09:49,937 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-23 16:09:49,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-23 16:09:49,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-23 16:09:49,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-23 16:09:49,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-23 16:09:49,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-23 16:09:49,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-23 16:09:49,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-23 16:09:49,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-23 16:09:49,962 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-23 16:09:49,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-23 16:09:49,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-23 16:09:49,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-23 16:09:49,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-23 16:09:49,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-23 16:09:49,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-23 16:09:49,968 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-23 16:09:49,970 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-23 16:09:49,971 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-23 16:09:49,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-23 16:09:49,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-23 16:09:49,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-23 16:09:49,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-23 16:09:49,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-23 16:09:49,982 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-23 16:09:49,983 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-23 16:09:49,984 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-23 16:09:50,036 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-23 16:09:50,037 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-23 16:09:50,040 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-23 16:09:50,040 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-23 16:09:50,041 INFO L138 SettingsManager]: * Use SBE=true [2020-11-23 16:09:50,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-23 16:09:50,041 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-23 16:09:50,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-23 16:09:50,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-23 16:09:50,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-23 16:09:50,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-23 16:09:50,044 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-23 16:09:50,044 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-23 16:09:50,044 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-23 16:09:50,045 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-23 16:09:50,045 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-23 16:09:50,045 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-23 16:09:50,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-23 16:09:50,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-23 16:09:50,046 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-23 16:09:50,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-23 16:09:50,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-23 16:09:50,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-23 16:09:50,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-23 16:09:50,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-23 16:09:50,047 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-23 16:09:50,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-23 16:09:50,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-23 16:09:50,048 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-23 16:09:50,048 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-23 16:09:50,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-23 16:09:50,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-23 16:09:50,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-23 16:09:50,491 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-23 16:09:50,493 INFO L275 PluginConnector]: CDTParser initialized [2020-11-23 16:09:50,494 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c [2020-11-23 16:09:50,561 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2695a658c/d08e99a1fb184e87b261cb7732464464/FLAGa6a583039 [2020-11-23 16:09:51,104 INFO L306 CDTParser]: Found 1 translation units. [2020-11-23 16:09:51,105 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c [2020-11-23 16:09:51,112 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2695a658c/d08e99a1fb184e87b261cb7732464464/FLAGa6a583039 [2020-11-23 16:09:51,487 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2695a658c/d08e99a1fb184e87b261cb7732464464 [2020-11-23 16:09:51,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-23 16:09:51,500 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-23 16:09:51,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-23 16:09:51,505 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-23 16:09:51,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-23 16:09:51,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:09:51" (1/1) ... [2020-11-23 16:09:51,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@524c99c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:51, skipping insertion in model container [2020-11-23 16:09:51,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:09:51" (1/1) ... [2020-11-23 16:09:51,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-23 16:09:51,552 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-23 16:09:51,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-23 16:09:51,765 INFO L203 MainTranslator]: Completed pre-run [2020-11-23 16:09:51,784 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-23 16:09:51,801 INFO L208 MainTranslator]: Completed translation [2020-11-23 16:09:51,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:51 WrapperNode [2020-11-23 16:09:51,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-23 16:09:51,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-23 16:09:51,803 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-23 16:09:51,803 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-23 16:09:51,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:51" (1/1) ... [2020-11-23 16:09:51,821 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:51" (1/1) ... [2020-11-23 16:09:51,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-23 16:09:51,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-23 16:09:51,842 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-23 16:09:51,842 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-23 16:09:51,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:51" (1/1) ... [2020-11-23 16:09:51,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:51" (1/1) ... [2020-11-23 16:09:51,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:51" (1/1) ... [2020-11-23 16:09:51,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:51" (1/1) ... [2020-11-23 16:09:51,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:51" (1/1) ... [2020-11-23 16:09:51,860 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:51" (1/1) ... [2020-11-23 16:09:51,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:51" (1/1) ... [2020-11-23 16:09:51,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-23 16:09:51,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-23 16:09:51,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-23 16:09:51,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-23 16:09:51,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 16:09:51,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-23 16:09:51,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-23 16:09:51,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-23 16:09:51,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-23 16:09:52,269 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-23 16:09:52,270 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-23 16:09:52,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:09:52 BoogieIcfgContainer [2020-11-23 16:09:52,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-23 16:09:52,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-23 16:09:52,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-23 16:09:52,277 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-23 16:09:52,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:09:51" (1/3) ... [2020-11-23 16:09:52,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c8d2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:09:52, skipping insertion in model container [2020-11-23 16:09:52,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:51" (2/3) ... [2020-11-23 16:09:52,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c8d2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:09:52, skipping insertion in model container [2020-11-23 16:09:52,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:09:52" (3/3) ... [2020-11-23 16:09:52,283 INFO L111 eAbstractionObserver]: Analyzing ICFG Float_div.i.p+cfa-reducer.c [2020-11-23 16:09:52,299 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-23 16:09:52,303 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-23 16:09:52,318 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-23 16:09:52,364 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-23 16:09:52,365 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-23 16:09:52,365 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-23 16:09:52,365 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-23 16:09:52,366 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-23 16:09:52,366 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-23 16:09:52,366 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-23 16:09:52,366 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-23 16:09:52,384 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2020-11-23 16:09:52,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-23 16:09:52,392 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 16:09:52,393 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-23 16:09:52,394 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 16:09:52,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 16:09:52,402 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2020-11-23 16:09:52,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-23 16:09:52,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609472444] [2020-11-23 16:09:52,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-23 16:09:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-23 16:09:52,548 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-23 16:09:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-23 16:09:52,569 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-23 16:09:52,591 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-23 16:09:52,592 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-23 16:09:52,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-23 16:09:52,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:09:52 BoogieIcfgContainer [2020-11-23 16:09:52,623 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-23 16:09:52,624 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-23 16:09:52,625 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-23 16:09:52,625 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-23 16:09:52,626 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:09:52" (3/4) ... [2020-11-23 16:09:52,630 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-23 16:09:52,631 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-23 16:09:52,634 INFO L168 Benchmark]: Toolchain (without parser) took 1138.00 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 24.3 MB in the beginning and 32.3 MB in the end (delta: -8.1 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. [2020-11-23 16:09:52,635 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 37.7 MB. Free memory is still 20.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 16:09:52,636 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.11 ms. Allocated memory is still 46.1 MB. Free memory was 23.6 MB in the beginning and 25.6 MB in the end (delta: -2.0 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2020-11-23 16:09:52,637 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.64 ms. Allocated memory is still 46.1 MB. Free memory was 25.6 MB in the beginning and 24.3 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 16:09:52,639 INFO L168 Benchmark]: Boogie Preprocessor took 21.95 ms. Allocated memory is still 46.1 MB. Free memory was 24.2 MB in the beginning and 23.2 MB in the end (delta: 928.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 16:09:52,640 INFO L168 Benchmark]: RCFGBuilder took 407.34 ms. Allocated memory is still 46.1 MB. Free memory was 23.2 MB in the beginning and 24.5 MB in the end (delta: -1.3 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-11-23 16:09:52,641 INFO L168 Benchmark]: TraceAbstraction took 350.54 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 24.1 MB in the beginning and 32.8 MB in the end (delta: -8.8 MB). Peak memory consumption was 2.3 MB. Max. memory is 16.1 GB. [2020-11-23 16:09:52,642 INFO L168 Benchmark]: Witness Printer took 6.28 ms. Allocated memory is still 56.6 MB. Free memory was 32.8 MB in the beginning and 32.3 MB in the end (delta: 466.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 16:09:52,648 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.27 ms. Allocated memory is still 37.7 MB. Free memory is still 20.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 297.11 ms. Allocated memory is still 46.1 MB. Free memory was 23.6 MB in the beginning and 25.6 MB in the end (delta: -2.0 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 37.64 ms. Allocated memory is still 46.1 MB. Free memory was 25.6 MB in the beginning and 24.3 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 21.95 ms. Allocated memory is still 46.1 MB. Free memory was 24.2 MB in the beginning and 23.2 MB in the end (delta: 928.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 407.34 ms. Allocated memory is still 46.1 MB. Free memory was 23.2 MB in the beginning and 24.5 MB in the end (delta: -1.3 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 350.54 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 24.1 MB in the beginning and 32.8 MB in the end (delta: -8.8 MB). Peak memory consumption was 2.3 MB. Max. memory is 16.1 GB. * Witness Printer took 6.28 ms. Allocated memory is still 56.6 MB. Free memory was 32.8 MB in the beginning and 32.3 MB in the end (delta: 466.2 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.2s, 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-cbb939d [2020-11-23 16:09:55,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-23 16:09:55,195 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-23 16:09:55,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-23 16:09:55,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-23 16:09:55,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-23 16:09:55,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-23 16:09:55,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-23 16:09:55,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-23 16:09:55,275 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-23 16:09:55,276 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-23 16:09:55,278 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-23 16:09:55,278 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-23 16:09:55,282 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-23 16:09:55,283 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-23 16:09:55,285 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-23 16:09:55,286 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-23 16:09:55,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-23 16:09:55,294 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-23 16:09:55,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-23 16:09:55,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-23 16:09:55,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-23 16:09:55,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-23 16:09:55,309 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-23 16:09:55,318 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-23 16:09:55,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-23 16:09:55,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-23 16:09:55,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-23 16:09:55,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-23 16:09:55,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-23 16:09:55,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-23 16:09:55,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-23 16:09:55,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-23 16:09:55,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-23 16:09:55,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-23 16:09:55,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-23 16:09:55,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-23 16:09:55,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-23 16:09:55,333 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-23 16:09:55,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-23 16:09:55,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-23 16:09:55,337 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-11-23 16:09:55,377 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-23 16:09:55,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-23 16:09:55,379 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-23 16:09:55,379 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-23 16:09:55,379 INFO L138 SettingsManager]: * Use SBE=true [2020-11-23 16:09:55,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-23 16:09:55,380 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-23 16:09:55,380 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-23 16:09:55,380 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-23 16:09:55,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-23 16:09:55,381 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-23 16:09:55,381 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-23 16:09:55,381 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-23 16:09:55,381 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-23 16:09:55,382 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-23 16:09:55,382 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-23 16:09:55,382 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-23 16:09:55,382 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-23 16:09:55,383 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-23 16:09:55,383 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-23 16:09:55,383 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-23 16:09:55,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-23 16:09:55,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-23 16:09:55,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-23 16:09:55,384 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-23 16:09:55,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-23 16:09:55,385 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-11-23 16:09:55,385 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-23 16:09:55,385 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-23 16:09:55,386 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-23 16:09:55,386 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-23 16:09:55,386 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-23 16:09:55,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-23 16:09:55,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-23 16:09:55,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-23 16:09:55,784 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-23 16:09:55,785 INFO L275 PluginConnector]: CDTParser initialized [2020-11-23 16:09:55,786 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c [2020-11-23 16:09:55,866 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a5a2ae1c/a7c089c06c0745c7abb4f6f81677a8ad/FLAG1b2bac93e [2020-11-23 16:09:56,465 INFO L306 CDTParser]: Found 1 translation units. [2020-11-23 16:09:56,466 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-esbmc-regression/Float_div.i.p+cfa-reducer.c [2020-11-23 16:09:56,473 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a5a2ae1c/a7c089c06c0745c7abb4f6f81677a8ad/FLAG1b2bac93e [2020-11-23 16:09:56,825 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a5a2ae1c/a7c089c06c0745c7abb4f6f81677a8ad [2020-11-23 16:09:56,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-23 16:09:56,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-23 16:09:56,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-23 16:09:56,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-23 16:09:56,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-23 16:09:56,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:09:56" (1/1) ... [2020-11-23 16:09:56,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e984d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:56, skipping insertion in model container [2020-11-23 16:09:56,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:09:56" (1/1) ... [2020-11-23 16:09:56,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-23 16:09:56,870 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-23 16:09:57,073 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-23 16:09:57,090 INFO L203 MainTranslator]: Completed pre-run [2020-11-23 16:09:57,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-23 16:09:57,126 INFO L208 MainTranslator]: Completed translation [2020-11-23 16:09:57,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:57 WrapperNode [2020-11-23 16:09:57,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-23 16:09:57,128 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-23 16:09:57,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-23 16:09:57,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-23 16:09:57,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:57" (1/1) ... [2020-11-23 16:09:57,147 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:57" (1/1) ... [2020-11-23 16:09:57,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-23 16:09:57,166 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-23 16:09:57,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-23 16:09:57,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-23 16:09:57,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:57" (1/1) ... [2020-11-23 16:09:57,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:57" (1/1) ... [2020-11-23 16:09:57,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:57" (1/1) ... [2020-11-23 16:09:57,179 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:57" (1/1) ... [2020-11-23 16:09:57,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:57" (1/1) ... [2020-11-23 16:09:57,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:57" (1/1) ... [2020-11-23 16:09:57,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:57" (1/1) ... [2020-11-23 16:09:57,193 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-23 16:09:57,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-23 16:09:57,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-23 16:09:57,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-23 16:09:57,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 16:09:57,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-23 16:09:57,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-23 16:09:57,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-23 16:09:57,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-23 16:10:00,486 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-23 16:10:00,486 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-23 16:10:00,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:10:00 BoogieIcfgContainer [2020-11-23 16:10:00,488 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-23 16:10:00,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-23 16:10:00,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-23 16:10:00,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-23 16:10:00,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 04:09:56" (1/3) ... [2020-11-23 16:10:00,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f966337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:10:00, skipping insertion in model container [2020-11-23 16:10:00,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:09:57" (2/3) ... [2020-11-23 16:10:00,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f966337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 04:10:00, skipping insertion in model container [2020-11-23 16:10:00,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:10:00" (3/3) ... [2020-11-23 16:10:00,498 INFO L111 eAbstractionObserver]: Analyzing ICFG Float_div.i.p+cfa-reducer.c [2020-11-23 16:10:00,513 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-23 16:10:00,517 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-23 16:10:00,529 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-23 16:10:00,555 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-23 16:10:00,555 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-23 16:10:00,555 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-23 16:10:00,556 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-23 16:10:00,556 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-23 16:10:00,556 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-23 16:10:00,556 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-23 16:10:00,556 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-23 16:10:00,570 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2020-11-23 16:10:00,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-23 16:10:00,575 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 16:10:00,576 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-23 16:10:00,576 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 16:10:00,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 16:10:00,583 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2020-11-23 16:10:00,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 16:10:00,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658558475] [2020-11-23 16:10:00,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 16:10:01,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-23 16:10:01,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-23 16:10:01,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 16:10:03,377 WARN L860 $PredicateComparison]: unable to prove that (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) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))))) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)))) is different from true [2020-11-23 16:10:03,383 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-23 16:10:03,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 16:10:03,517 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-23 16:10:03,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658558475] [2020-11-23 16:10:03,519 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-23 16:10:03,519 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-11-23 16:10:03,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229797828] [2020-11-23 16:10:03,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-23 16:10:03,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 16:10:03,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-23 16:10:03,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2020-11-23 16:10:03,541 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 5 states. [2020-11-23 16:10:08,529 WARN L860 $PredicateComparison]: unable to prove that (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) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))))) (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 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)))) is different from true [2020-11-23 16:10:13,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 16:10:13,236 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-11-23 16:10:13,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-23 16:10:13,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2020-11-23 16:10:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 16:10:13,247 INFO L225 Difference]: With dead ends: 17 [2020-11-23 16:10:13,247 INFO L226 Difference]: Without dead ends: 7 [2020-11-23 16:10:13,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=9, Invalid=9, Unknown=2, NotChecked=10, Total=30 [2020-11-23 16:10:13,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2020-11-23 16:10:13,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-11-23 16:10:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-11-23 16:10:13,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2020-11-23 16:10:13,289 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2020-11-23 16:10:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 16:10:13,289 INFO L481 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2020-11-23 16:10:13,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-23 16:10:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2020-11-23 16:10:13,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-23 16:10:13,290 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 16:10:13,290 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-23 16:10:13,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-23 16:10:13,492 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 16:10:13,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 16:10:13,495 INFO L82 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2020-11-23 16:10:13,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 16:10:13,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831482582] [2020-11-23 16:10:13,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 16:10:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-23 16:10:13,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-23 16:10:13,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 16:10:14,188 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-11-23 16:10:16,466 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-23 16:10:16,473 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-23 16:10:16,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 16:10:18,762 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-23 16:10:22,095 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-23 16:10:24,365 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-23 16:10:24,366 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-23 16:10:24,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831482582] [2020-11-23 16:10:24,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-23 16:10:24,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-11-23 16:10:24,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056412610] [2020-11-23 16:10:24,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-23 16:10:24,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 16:10:24,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-23 16:10:24,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=14, Unknown=4, NotChecked=24, Total=56 [2020-11-23 16:10:24,370 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 8 states. [2020-11-23 16:10:26,642 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-23 16:10:30,557 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-23 16:10:47,878 WARN L194 SmtUtils]: Spent 12.94 s on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2020-11-23 16:10:50,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 16:10:50,658 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2020-11-23 16:10:50,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-23 16:10:50,665 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2020-11-23 16:10:50,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 16:10:50,665 INFO L225 Difference]: With dead ends: 11 [2020-11-23 16:10:50,665 INFO L226 Difference]: Without dead ends: 8 [2020-11-23 16:10:50,667 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 33.8s TimeCoverageRelationStatistics Valid=21, Invalid=22, Unknown=7, NotChecked=60, Total=110 [2020-11-23 16:10:50,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-11-23 16:10:50,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-11-23 16:10:50,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-11-23 16:10:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-11-23 16:10:50,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2020-11-23 16:10:50,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 16:10:50,670 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-11-23 16:10:50,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-23 16:10:50,671 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-11-23 16:10:50,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-23 16:10:50,672 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 16:10:50,672 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2020-11-23 16:10:50,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-23 16:10:50,882 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 16:10:50,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 16:10:50,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1805796550, now seen corresponding path program 2 times [2020-11-23 16:10:50,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 16:10:50,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234558885] [2020-11-23 16:10:50,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 16:10:51,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-23 16:10:51,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-23 16:10:51,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2020-11-23 16:10:51,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 16:10:51,857 WARN L194 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-11-23 16:10:54,126 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-23 16:10:56,423 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-23 16:10:58,924 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-23 16:10:58,934 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-23 16:10:58,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 16:11:01,239 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-23 16:11:03,513 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-23 16:11:06,027 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-23 16:11:08,530 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-23 16:11:11,077 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-23 16:11:13,577 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-23 16:11:13,578 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-23 16:11:13,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234558885] [2020-11-23 16:11:13,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-23 16:11:13,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2020-11-23 16:11:13,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998110400] [2020-11-23 16:11:13,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-23 16:11:13,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 16:11:13,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-23 16:11:13,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=21, Unknown=9, NotChecked=60, Total=110 [2020-11-23 16:11:13,581 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2020-11-23 16:11:16,125 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-23 16:11:18,688 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-23 16:11:23,507 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-23 16:11:25,768 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) (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 false [2020-11-23 16:11:28,312 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-23 16:11:33,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 16:11:33,053 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-11-23 16:11:33,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-23 16:11:33,055 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2020-11-23 16:11:33,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 16:11:33,055 INFO L225 Difference]: With dead ends: 12 [2020-11-23 16:11:33,055 INFO L226 Difference]: Without dead ends: 9 [2020-11-23 16:11:33,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 36.6s TimeCoverageRelationStatistics Valid=28, Invalid=24, Unknown=14, NotChecked=144, Total=210 [2020-11-23 16:11:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-11-23 16:11:33,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-11-23 16:11:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-11-23 16:11:33,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2020-11-23 16:11:33,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2020-11-23 16:11:33,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 16:11:33,060 INFO L481 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2020-11-23 16:11:33,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-23 16:11:33,061 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-11-23 16:11:33,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-23 16:11:33,061 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 16:11:33,061 INFO L422 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2020-11-23 16:11:33,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-23 16:11:33,271 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 16:11:33,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 16:11:33,273 INFO L82 PathProgramCache]: Analyzing trace with hash 145055718, now seen corresponding path program 3 times [2020-11-23 16:11:33,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 16:11:33,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006011715] [2020-11-23 16:11:33,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 16:11:34,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-11-23 16:11:34,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-23 16:11:34,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-23 16:11:34,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 16:11:34,522 WARN L194 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-11-23 16:11:36,790 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-23 16:11:39,329 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-23 16:11:42,115 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-23 16:11:42,120 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-23 16:11:42,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 16:11:44,429 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-23 16:11:46,689 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-23 16:11:49,221 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-23 16:11:51,755 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-23 16:11:54,532 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-23 16:11:57,318 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-23 16:12:00,125 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-23 16:12:02,912 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-23 16:12:02,913 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-23 16:12:02,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006011715] [2020-11-23 16:12:02,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-23 16:12:02,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2020-11-23 16:12:02,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99241600] [2020-11-23 16:12:02,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-23 16:12:02,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 16:12:02,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-23 16:12:02,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=23, Unknown=11, NotChecked=98, Total=156 [2020-11-23 16:12:02,917 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 13 states. [2020-11-23 16:12:05,793 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-23 16:12:08,659 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-23 16:12:11,508 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-23 16:12:14,386 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-23 16:12:17,214 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-23 16:12:20,078 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-23 16:12:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 16:12:26,858 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-11-23 16:12:26,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-23 16:12:26,859 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2020-11-23 16:12:26,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 16:12:26,860 INFO L225 Difference]: With dead ends: 13 [2020-11-23 16:12:26,860 INFO L226 Difference]: Without dead ends: 10 [2020-11-23 16:12:26,860 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 45.7s TimeCoverageRelationStatistics Valid=34, Invalid=27, Unknown=17, NotChecked=228, Total=306 [2020-11-23 16:12:26,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-11-23 16:12:26,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-11-23 16:12:26,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-11-23 16:12:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-11-23 16:12:26,863 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2020-11-23 16:12:26,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 16:12:26,864 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-11-23 16:12:26,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-23 16:12:26,864 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-11-23 16:12:26,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-23 16:12:26,864 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 16:12:26,865 INFO L422 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2020-11-23 16:12:27,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-23 16:12:27,069 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 16:12:27,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 16:12:27,071 INFO L82 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 4 times [2020-11-23 16:12:27,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 16:12:27,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306987095] [2020-11-23 16:12:27,073 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 16:12:28,150 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-23 16:12:28,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-23 16:12:28,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-23 16:12:28,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 16:12:28,448 WARN L194 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-11-23 16:12:30,722 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-23 16:12:33,270 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-23 16:12:36,100 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-23 16:12:38,385 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-23 16:12:38,388 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-23 16:12:38,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 16:12:40,687 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-23 16:12:44,523 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-23 16:12:47,066 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-23 16:12:49,924 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-23 16:12:52,769 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-23 16:12:55,813 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-23 16:12:58,869 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-23 16:13:01,947 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-23 16:13:05,032 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-23 16:13:05,033 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-23 16:13:05,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306987095] [2020-11-23 16:13:05,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-23 16:13:05,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2020-11-23 16:13:05,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779482776] [2020-11-23 16:13:05,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-23 16:13:05,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 16:13:05,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-23 16:13:05,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=17, Unknown=13, NotChecked=126, Total=182 [2020-11-23 16:13:05,036 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 14 states. [2020-11-23 16:13:08,164 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-23 16:13:11,272 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-23 16:13:14,113 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-23 16:13:17,223 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-23 16:13:19,792 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-23 16:13:22,891 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-23 16:13:26,012 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-23 16:13:28,299 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-23 16:13:35,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 16:13:35,078 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-11-23 16:13:35,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-23 16:13:35,079 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 9 [2020-11-23 16:13:35,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 16:13:35,080 INFO L225 Difference]: With dead ends: 14 [2020-11-23 16:13:35,080 INFO L226 Difference]: Without dead ends: 11 [2020-11-23 16:13:35,080 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 60.0s TimeCoverageRelationStatistics Valid=38, Invalid=21, Unknown=21, NotChecked=300, Total=380 [2020-11-23 16:13:35,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-11-23 16:13:35,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-11-23 16:13:35,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-11-23 16:13:35,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2020-11-23 16:13:35,084 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2020-11-23 16:13:35,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 16:13:35,085 INFO L481 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2020-11-23 16:13:35,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-23 16:13:35,085 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2020-11-23 16:13:35,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-23 16:13:35,087 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 16:13:35,088 INFO L422 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2020-11-23 16:13:35,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-11-23 16:13:35,291 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 16:13:35,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 16:13:35,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1957592038, now seen corresponding path program 5 times [2020-11-23 16:13:35,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 16:13:35,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264647451] [2020-11-23 16:13:35,294 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 16:13:36,823 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-11-23 16:13:36,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-23 16:13:36,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-23 16:13:36,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 16:13:37,228 WARN L194 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-11-23 16:13:39,512 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-23 16:13:42,076 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-23 16:13:45,077 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-23 16:13:48,251 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-23 16:13:50,559 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-23 16:13:50,562 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-23 16:13:50,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 16:13:52,858 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-23 16:13:55,127 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-23 16:13:57,694 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-23 16:14:00,239 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-23 16:14:03,033 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-23 16:14:05,826 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-23 16:14:08,895 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-23 16:14:11,935 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-23 16:14:16,101 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-23 16:14:20,101 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-23 16:14:24,575 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-23 16:14:27,690 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-23 16:14:27,691 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-23 16:14:27,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264647451] [2020-11-23 16:14:27,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-23 16:14:27,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2020-11-23 16:14:27,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008628485] [2020-11-23 16:14:27,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-23 16:14:27,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 16:14:27,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-23 16:14:27,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=17, Unknown=17, NotChecked=176, Total=240 [2020-11-23 16:14:27,693 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 16 states. [2020-11-23 16:14:32,187 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-23 16:14:35,439 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-23 16:14:38,553 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-23 16:14:41,689 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-23 16:14:44,820 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-23 16:14:47,391 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-23 16:14:51,170 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-23 16:14:57,052 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-23 16:14:59,345 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-23 16:15:00,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 16:15:00,512 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2020-11-23 16:15:00,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-23 16:15:00,515 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 10 [2020-11-23 16:15:00,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 16:15:00,516 INFO L225 Difference]: With dead ends: 15 [2020-11-23 16:15:00,516 INFO L226 Difference]: Without dead ends: 12 [2020-11-23 16:15:00,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 82.3s TimeCoverageRelationStatistics Valid=44, Invalid=22, Unknown=26, NotChecked=414, Total=506 [2020-11-23 16:15:00,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-11-23 16:15:00,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-11-23 16:15:00,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-11-23 16:15:00,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2020-11-23 16:15:00,520 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2020-11-23 16:15:00,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 16:15:00,520 INFO L481 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2020-11-23 16:15:00,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-23 16:15:00,521 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-11-23 16:15:00,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-23 16:15:00,521 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 16:15:00,521 INFO L422 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2020-11-23 16:15:00,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-11-23 16:15:00,724 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 16:15:00,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 16:15:00,726 INFO L82 PathProgramCache]: Analyzing trace with hash 555748550, now seen corresponding path program 6 times [2020-11-23 16:15:00,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 16:15:00,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341042224] [2020-11-23 16:15:00,727 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 16:15:02,382 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2020-11-23 16:15:02,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-23 16:15:02,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-23 16:15:02,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 16:15:02,783 WARN L194 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-11-23 16:15:05,073 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-23 16:15:07,654 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-23 16:15:10,524 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-23 16:15:13,677 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-23 16:15:18,879 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-23 16:15:22,044 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-23 16:15:22,048 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-23 16:15:22,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 16:15:24,382 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-23 16:15:28,946 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-23 16:15:31,524 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-23 16:15:34,402 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-23 16:15:37,244 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-23 16:15:40,409 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-23 16:15:43,553 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-23 16:15:46,703 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-23 16:15:49,869 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-23 16:15:53,029 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-23 16:15:56,212 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-23 16:15:59,374 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-23 16:16:02,539 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-23 16:16:02,540 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-23 16:16:02,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341042224] [2020-11-23 16:16:02,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-23 16:16:02,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2020-11-23 16:16:02,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702706907] [2020-11-23 16:16:02,541 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-23 16:16:02,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 16:16:02,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-23 16:16:02,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=27, Unknown=19, NotChecked=260, Total=342 [2020-11-23 16:16:02,543 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 19 states. [2020-11-23 16:16:05,745 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-23 16:16:08,946 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-23 16:16:12,188 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-23 16:16:15,607 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-23 16:16:18,847 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-23 16:16:22,061 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-23 16:16:25,261 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-23 16:16:27,574 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-23 16:16:30,782 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-23 16:16:33,966 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-23 16:16:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 16:16:40,828 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-11-23 16:16:40,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-23 16:16:40,829 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 11 [2020-11-23 16:16:40,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 16:16:40,830 INFO L225 Difference]: With dead ends: 16 [2020-11-23 16:16:40,830 INFO L226 Difference]: Without dead ends: 13 [2020-11-23 16:16:40,831 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 91.4s TimeCoverageRelationStatistics Valid=52, Invalid=33, Unknown=29, NotChecked=588, Total=702 [2020-11-23 16:16:40,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-11-23 16:16:40,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-11-23 16:16:40,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-11-23 16:16:40,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2020-11-23 16:16:40,836 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2020-11-23 16:16:40,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 16:16:40,837 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2020-11-23 16:16:40,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-23 16:16:40,837 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2020-11-23 16:16:40,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-23 16:16:40,837 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 16:16:40,837 INFO L422 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1] [2020-11-23 16:16:41,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-11-23 16:16:41,039 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 16:16:41,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 16:16:41,040 INFO L82 PathProgramCache]: Analyzing trace with hash 48273382, now seen corresponding path program 7 times [2020-11-23 16:16:41,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 16:16:41,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330978074] [2020-11-23 16:16:41,041 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 16:16:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-23 16:16:42,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 18 conjunts are in the unsatisfiable core [2020-11-23 16:16:42,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 16:16:43,048 WARN L194 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-11-23 16:16:45,345 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-23 16:16:47,921 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-23 16:16:50,789 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-23 16:16:53,981 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-23 16:16:57,212 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-23 16:17:00,429 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-23 16:17:02,729 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-23 16:17:02,735 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-23 16:17:02,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 16:17:05,067 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-23 16:17:07,388 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-23 16:17:09,953 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-23 16:17:12,519 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-23 16:17:15,388 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-23 16:17:18,245 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-23 16:17:21,452 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-23 16:17:24,762 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-23 16:17:28,041 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-23 16:17:31,326 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-23 16:17:34,560 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-23 16:17:37,800 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-23 16:17:41,060 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-23 16:17:44,310 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-23 16:17:47,569 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-23 16:17:50,830 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-23 16:17:50,832 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-23 16:17:50,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330978074] [2020-11-23 16:17:50,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-23 16:17:50,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2020-11-23 16:17:50,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594007574] [2020-11-23 16:17:50,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-23 16:17:50,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 16:17:50,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-23 16:17:50,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=19, Unknown=23, NotChecked=300, Total=380 [2020-11-23 16:17:50,835 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 20 states. [2020-11-23 16:17:54,090 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-23 16:17:57,355 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-23 16:18:00,769 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-23 16:18:04,068 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-23 16:18:07,341 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-23 16:18:10,787 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-23 16:18:14,104 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-23 16:18:17,045 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-23 16:18:20,358 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-23 16:18:23,702 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-23 16:18:26,000 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-23 16:18:29,243 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-23 16:18:31,555 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-23 16:18:34,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 16:18:34,584 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2020-11-23 16:18:34,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-23 16:18:34,588 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 12 [2020-11-23 16:18:34,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 16:18:34,589 INFO L225 Difference]: With dead ends: 17 [2020-11-23 16:18:34,589 INFO L226 Difference]: Without dead ends: 14 [2020-11-23 16:18:34,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 108.7s TimeCoverageRelationStatistics Valid=56, Invalid=24, Unknown=36, NotChecked=696, Total=812 [2020-11-23 16:18:34,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-11-23 16:18:34,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-11-23 16:18:34,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-11-23 16:18:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2020-11-23 16:18:34,594 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2020-11-23 16:18:34,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 16:18:34,594 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2020-11-23 16:18:34,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-23 16:18:34,594 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-11-23 16:18:34,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-23 16:18:34,595 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 16:18:34,595 INFO L422 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1] [2020-11-23 16:18:34,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-11-23 16:18:34,806 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 16:18:34,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 16:18:34,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1496412358, now seen corresponding path program 8 times [2020-11-23 16:18:34,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 16:18:34,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079803605] [2020-11-23 16:18:34,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 16:18:36,794 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-23 16:18:36,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-23 16:18:36,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 23 conjunts are in the unsatisfiable core [2020-11-23 16:18:36,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 16:18:37,199 WARN L194 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2020-11-23 16:18:39,495 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-23 16:18:42,099 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-23 16:18:44,993 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-23 16:18:48,288 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-23 16:18:51,586 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-23 16:18:54,911 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-23 16:18:58,211 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-23 16:19:01,522 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-23 16:19:01,527 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-23 16:19:01,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 16:19:03,882 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-23 16:19:06,189 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-23 16:19:08,803 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-23 16:19:11,401 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-23 16:19:14,271 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-23 16:19:17,147 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-23 16:19:20,413 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-23 16:19:23,717 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-23 16:19:27,026 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-23 16:19:30,342 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-23 16:19:33,690 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-23 16:19:37,003 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-23 16:19:40,339 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-23 16:19:43,532 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-23 16:19:46,729 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-23 16:19:49,906 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-23 16:19:53,070 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-23 16:19:56,281 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-23 16:19:56,283 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-23 16:19:56,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079803605] [2020-11-23 16:19:56,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-23 16:19:56,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2020-11-23 16:19:56,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235662689] [2020-11-23 16:19:56,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-11-23 16:19:56,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 16:19:56,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-11-23 16:19:56,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=28, Unknown=26, NotChecked=408, Total=506 [2020-11-23 16:19:56,286 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 23 states. [2020-11-23 16:19:59,514 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-23 16:20:02,805 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-23 16:20:06,220 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-23 16:20:09,468 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-23 16:20:12,856 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-23 16:20:16,097 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-23 16:20:19,478 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-23 16:20:22,721 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-23 16:20:25,922 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-23 16:20:28,819 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-23 16:20:32,090 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-23 16:20:35,314 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-23 16:20:38,507 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-23 16:20:41,718 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-23 16:20:46,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 16:20:46,519 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-11-23 16:20:46,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-23 16:20:46,519 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 13 [2020-11-23 16:20:46,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 16:20:46,520 INFO L225 Difference]: With dead ends: 18 [2020-11-23 16:20:46,520 INFO L226 Difference]: Without dead ends: 15 [2020-11-23 16:20:46,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 27 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 124.7s TimeCoverageRelationStatistics Valid=64, Invalid=34, Unknown=40, NotChecked=918, Total=1056 [2020-11-23 16:20:46,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-11-23 16:20:46,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-11-23 16:20:46,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-11-23 16:20:46,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2020-11-23 16:20:46,525 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2020-11-23 16:20:46,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 16:20:46,526 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2020-11-23 16:20:46,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-11-23 16:20:46,526 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2020-11-23 16:20:46,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-23 16:20:46,526 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 16:20:46,526 INFO L422 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1] [2020-11-23 16:20:46,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-11-23 16:20:46,728 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 16:20:46,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 16:20:46,729 INFO L82 PathProgramCache]: Analyzing trace with hash -855919642, now seen corresponding path program 9 times [2020-11-23 16:20:46,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 16:20:46,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651961768] [2020-11-23 16:20:46,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 16:20:48,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-11-23 16:20:48,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-23 16:20:48,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-23 16:20:48,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 16:20:50,416 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) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2020-11-23 16:20:52,699 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-23 16:20:55,302 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-23 16:20:57,591 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-23 16:20:57,598 INFO L615 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-23 16:21:11,386 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-23 16:21:19,188 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-23 16:21:21,692 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-23 16:21:21,693 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-23 16:21:21,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 16:21:24,045 WARN L838 $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 false [2020-11-23 16:21:26,337 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-23 16:21:27,159 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-11-23 16:21:27,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651961768] [2020-11-23 16:21:27,161 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-23 16:21:27,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1629374161] [2020-11-23 16:21:27,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 16:21:30,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-11-23 16:21:30,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-23 16:21:30,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-23 16:21:30,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 16:21:30,971 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@4c598a0 [2020-11-23 16:21:30,971 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417773405] [2020-11-23 16:21:30,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-23 16:22:51,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-11-23 16:22:51,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-23 16:22:52,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-23 16:22:52,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 16:22:52,463 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@4c598a0 [2020-11-23 16:22:52,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-11-23 16:22:52,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-11-23 16:22:52,464 ERROR L205 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2020-11-23 16:22:52,464 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-23 16:22:53,069 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-23 16:22:53,085 WARN L254 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-11-23 16:22:53,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:22:53 BoogieIcfgContainer [2020-11-23 16:22:53,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-23 16:22:53,086 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-23 16:22:53,086 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-23 16:22:53,087 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-23 16:22:53,087 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:10:00" (3/4) ... [2020-11-23 16:22:53,091 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-23 16:22:53,091 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-23 16:22:53,093 INFO L168 Benchmark]: Toolchain (without parser) took 776262.28 ms. Allocated memory is still 50.3 MB. Free memory was 26.9 MB in the beginning and 17.9 MB in the end (delta: 8.9 MB). Peak memory consumption was 12.3 MB. Max. memory is 16.1 GB. [2020-11-23 16:22:53,093 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 41.9 MB. Free memory was 21.3 MB in the beginning and 21.2 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 16:22:53,094 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.49 ms. Allocated memory is still 50.3 MB. Free memory was 26.2 MB in the beginning and 27.8 MB in the end (delta: -1.6 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2020-11-23 16:22:53,095 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.54 ms. Allocated memory is still 50.3 MB. Free memory was 27.8 MB in the beginning and 26.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-23 16:22:53,096 INFO L168 Benchmark]: Boogie Preprocessor took 27.11 ms. Allocated memory is still 50.3 MB. Free memory was 26.4 MB in the beginning and 25.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 16:22:53,096 INFO L168 Benchmark]: RCFGBuilder took 3294.29 ms. Allocated memory is still 50.3 MB. Free memory was 25.2 MB in the beginning and 27.3 MB in the end (delta: -2.1 MB). Peak memory consumption was 9.8 MB. Max. memory is 16.1 GB. [2020-11-23 16:22:53,097 INFO L168 Benchmark]: TraceAbstraction took 772595.60 ms. Allocated memory is still 50.3 MB. Free memory was 26.9 MB in the beginning and 18.5 MB in the end (delta: 8.5 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-11-23 16:22:53,098 INFO L168 Benchmark]: Witness Printer took 4.85 ms. Allocated memory is still 50.3 MB. Free memory was 18.3 MB in the beginning and 17.9 MB in the end (delta: 367.0 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-23 16:22:53,102 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.24 ms. Allocated memory is still 41.9 MB. Free memory was 21.3 MB in the beginning and 21.2 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 289.49 ms. Allocated memory is still 50.3 MB. Free memory was 26.2 MB in the beginning and 27.8 MB in the end (delta: -1.6 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 37.54 ms. Allocated memory is still 50.3 MB. Free memory was 27.8 MB in the beginning and 26.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.11 ms. Allocated memory is still 50.3 MB. Free memory was 26.4 MB in the beginning and 25.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 3294.29 ms. Allocated memory is still 50.3 MB. Free memory was 25.2 MB in the beginning and 27.3 MB in the end (delta: -2.1 MB). Peak memory consumption was 9.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 772595.60 ms. Allocated memory is still 50.3 MB. Free memory was 26.9 MB in the beginning and 18.5 MB in the end (delta: 8.5 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Witness Printer took 4.85 ms. Allocated memory is still 50.3 MB. Free memory was 18.3 MB in the beginning and 17.9 MB in the end (delta: 367.0 kB). Peak memory consumption was 2.1 MB. 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: 772.5s, OverallIterations: 10, TraceHistogramMax: 9, AutomataDifference: 274.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 47 SDtfs, 0 SDslu, 67 SDs, 0 SdLazy, 43 SolverSat, 0 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 41.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 23 SyntacticMatches, 10 SemanticMatches, 164 ConstructedPredicates, 133 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 588.5s 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.0s SsaConstructionTime, 10.1s SatisfiabilityAnalysisTime, 359.1s 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...