./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 88b5e43d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/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 fb5ab7eb36d10dfdf42ecc1671ac3f1599a6bed2 ............................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/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 fb5ab7eb36d10dfdf42ecc1671ac3f1599a6bed2 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.2.0-88b5e43 [2020-11-23 23:47:39,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-23 23:47:39,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-23 23:47:39,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-23 23:47:39,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-23 23:47:39,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-23 23:47:39,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-23 23:47:39,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-23 23:47:39,055 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-23 23:47:39,056 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-23 23:47:39,057 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-23 23:47:39,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-23 23:47:39,059 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-23 23:47:39,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-23 23:47:39,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-23 23:47:39,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-23 23:47:39,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-23 23:47:39,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-23 23:47:39,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-23 23:47:39,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-23 23:47:39,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-23 23:47:39,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-23 23:47:39,074 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-23 23:47:39,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-23 23:47:39,078 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-23 23:47:39,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-23 23:47:39,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-23 23:47:39,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-23 23:47:39,080 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-23 23:47:39,081 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-23 23:47:39,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-23 23:47:39,083 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-23 23:47:39,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-23 23:47:39,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-23 23:47:39,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-23 23:47:39,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-23 23:47:39,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-23 23:47:39,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-23 23:47:39,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-23 23:47:39,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-23 23:47:39,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-23 23:47:39,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-23 23:47:39,138 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-23 23:47:39,139 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-23 23:47:39,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-23 23:47:39,141 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-23 23:47:39,141 INFO L138 SettingsManager]: * Use SBE=true [2020-11-23 23:47:39,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-23 23:47:39,142 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-23 23:47:39,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-23 23:47:39,142 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-23 23:47:39,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-23 23:47:39,143 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-23 23:47:39,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-23 23:47:39,144 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-23 23:47:39,144 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-23 23:47:39,144 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-23 23:47:39,144 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-23 23:47:39,145 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-23 23:47:39,145 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-23 23:47:39,145 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-23 23:47:39,146 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-23 23:47:39,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-23 23:47:39,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-23 23:47:39,147 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-23 23:47:39,147 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-23 23:47:39,147 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-23 23:47:39,147 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-23 23:47:39,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-23 23:47:39,148 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-23 23:47:39,148 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-23 23:47:39,148 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-2/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-2/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 -> fb5ab7eb36d10dfdf42ecc1671ac3f1599a6bed2 [2020-11-23 23:47:39,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-23 23:47:39,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-23 23:47:39,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-23 23:47:39,561 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-23 23:47:39,562 INFO L275 PluginConnector]: CDTParser initialized [2020-11-23 23:47:39,564 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c [2020-11-23 23:47:39,656 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bce791545/bf3a5201ae4740df826615d48923961e/FLAGa4bb06f1c [2020-11-23 23:47:40,242 INFO L306 CDTParser]: Found 1 translation units. [2020-11-23 23:47:40,243 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c [2020-11-23 23:47:40,250 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bce791545/bf3a5201ae4740df826615d48923961e/FLAGa4bb06f1c [2020-11-23 23:47:40,644 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/bce791545/bf3a5201ae4740df826615d48923961e [2020-11-23 23:47:40,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-23 23:47:40,663 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-23 23:47:40,665 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-23 23:47:40,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-23 23:47:40,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-23 23:47:40,672 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:47:40" (1/1) ... [2020-11-23 23:47:40,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@759bbb69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:40, skipping insertion in model container [2020-11-23 23:47:40,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:47:40" (1/1) ... [2020-11-23 23:47:40,685 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-11-23 23:47:40,706 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-11-23 23:47:40,895 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-11-23 23:47:40,910 INFO L212 MainTranslator]: Completed pre-run [2020-11-23 23:47:40,926 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-11-23 23:47:40,941 INFO L217 MainTranslator]: Completed translation [2020-11-23 23:47:40,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:40 WrapperNode [2020-11-23 23:47:40,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-23 23:47:40,944 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-23 23:47:40,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-23 23:47:40,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-23 23:47:40,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:40" (1/1) ... [2020-11-23 23:47:40,961 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:40" (1/1) ... [2020-11-23 23:47:40,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-23 23:47:40,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-23 23:47:40,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-23 23:47:40,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-23 23:47:40,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:40" (1/1) ... [2020-11-23 23:47:40,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:40" (1/1) ... [2020-11-23 23:47:40,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:40" (1/1) ... [2020-11-23 23:47:40,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:40" (1/1) ... [2020-11-23 23:47:40,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:40" (1/1) ... [2020-11-23 23:47:41,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:40" (1/1) ... [2020-11-23 23:47:41,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:40" (1/1) ... [2020-11-23 23:47:41,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-23 23:47:41,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-23 23:47:41,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-23 23:47:41,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-23 23:47:41,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:40" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 23:47:41,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-23 23:47:41,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-23 23:47:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-23 23:47:41,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-23 23:47:41,310 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-23 23:47:41,311 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-23 23:47:41,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:47:41 BoogieIcfgContainer [2020-11-23 23:47:41,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-23 23:47:41,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-23 23:47:41,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-23 23:47:41,319 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-23 23:47:41,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:47:40" (1/3) ... [2020-11-23 23:47:41,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7710b4ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:47:41, skipping insertion in model container [2020-11-23 23:47:41,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:40" (2/3) ... [2020-11-23 23:47:41,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7710b4ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:47:41, skipping insertion in model container [2020-11-23 23:47:41,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:47:41" (3/3) ... [2020-11-23 23:47:41,323 INFO L111 eAbstractionObserver]: Analyzing ICFG Double_div.i.p+cfa-reducer.c [2020-11-23 23:47:41,336 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-23 23:47:41,341 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-23 23:47:41,356 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-23 23:47:41,385 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-23 23:47:41,385 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-23 23:47:41,385 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-23 23:47:41,386 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-23 23:47:41,386 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-23 23:47:41,390 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-23 23:47:41,391 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-23 23:47:41,391 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-23 23:47:41,406 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2020-11-23 23:47:41,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-23 23:47:41,413 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 23:47:41,414 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-23 23:47:41,414 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 23:47:41,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 23:47:41,427 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2020-11-23 23:47:41,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-23 23:47:41,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470102262] [2020-11-23 23:47:41,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-23 23:47:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-23 23:47:41,668 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-23 23:47:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-23 23:47:41,691 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-23 23:47:41,715 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-23 23:47:41,716 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-23 23:47:41,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-23 23:47:41,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 11:47:41 BoogieIcfgContainer [2020-11-23 23:47:41,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-23 23:47:41,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-23 23:47:41,747 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-23 23:47:41,747 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-23 23:47:41,748 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:47:41" (3/4) ... [2020-11-23 23:47:41,752 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-23 23:47:41,753 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-23 23:47:41,756 INFO L168 Benchmark]: Toolchain (without parser) took 1096.03 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 19.2 MB in the beginning and 27.6 MB in the end (delta: -8.4 MB). Peak memory consumption was 4.6 MB. Max. memory is 16.1 GB. [2020-11-23 23:47:41,757 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 41.9 MB. Free memory is still 26.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 23:47:41,758 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.54 ms. Allocated memory is still 41.9 MB. Free memory was 18.5 MB in the beginning and 20.7 MB in the end (delta: -2.2 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2020-11-23 23:47:41,759 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.52 ms. Allocated memory is still 41.9 MB. Free memory was 20.6 MB in the beginning and 19.4 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 23:47:41,760 INFO L168 Benchmark]: Boogie Preprocessor took 21.78 ms. Allocated memory is still 41.9 MB. Free memory was 19.2 MB in the beginning and 18.4 MB in the end (delta: 842.8 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-23 23:47:41,762 INFO L168 Benchmark]: RCFGBuilder took 309.48 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 18.2 MB in the beginning and 28.4 MB in the end (delta: -10.2 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. [2020-11-23 23:47:41,763 INFO L168 Benchmark]: TraceAbstraction took 430.74 ms. Allocated memory is still 52.4 MB. Free memory was 28.0 MB in the beginning and 28.1 MB in the end (delta: -22.6 kB). Peak memory consumption was 675.4 kB. Max. memory is 16.1 GB. [2020-11-23 23:47:41,764 INFO L168 Benchmark]: Witness Printer took 5.99 ms. Allocated memory is still 52.4 MB. Free memory was 28.1 MB in the beginning and 27.8 MB in the end (delta: 243.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 23:47:41,769 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 41.9 MB. Free memory is still 26.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 277.54 ms. Allocated memory is still 41.9 MB. Free memory was 18.5 MB in the beginning and 20.7 MB in the end (delta: -2.2 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 36.52 ms. Allocated memory is still 41.9 MB. Free memory was 20.6 MB in the beginning and 19.4 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 21.78 ms. Allocated memory is still 41.9 MB. Free memory was 19.2 MB in the beginning and 18.4 MB in the end (delta: 842.8 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 309.48 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 18.2 MB in the beginning and 28.4 MB in the end (delta: -10.2 MB). Peak memory consumption was 4.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 430.74 ms. Allocated memory is still 52.4 MB. Free memory was 28.0 MB in the beginning and 28.1 MB in the end (delta: -22.6 kB). Peak memory consumption was 675.4 kB. Max. memory is 16.1 GB. * Witness Printer took 5.99 ms. Allocated memory is still 52.4 MB. Free memory was 28.1 MB in the beginning and 27.8 MB in the end (delta: 243.9 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 someBinaryArithmeticDOUBLE_SMToperation at line 10, overapproximation of someBinaryDOUBLE_SMTComparisonOperation at line 12. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L9] double main__x = 1.0; [L10] double 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", "Double_div.i.p+cfa-reducer.c", 4, "reach_error") VAL [__return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-88b5e43 [2020-11-23 23:47:44,309 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-23 23:47:44,313 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-23 23:47:44,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-23 23:47:44,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-23 23:47:44,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-23 23:47:44,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-23 23:47:44,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-23 23:47:44,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-23 23:47:44,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-23 23:47:44,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-23 23:47:44,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-23 23:47:44,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-23 23:47:44,363 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-23 23:47:44,364 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-23 23:47:44,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-23 23:47:44,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-23 23:47:44,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-23 23:47:44,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-23 23:47:44,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-23 23:47:44,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-23 23:47:44,385 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-23 23:47:44,389 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-23 23:47:44,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-23 23:47:44,397 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-23 23:47:44,397 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-23 23:47:44,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-23 23:47:44,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-23 23:47:44,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-23 23:47:44,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-23 23:47:44,406 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-23 23:47:44,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-23 23:47:44,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-23 23:47:44,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-23 23:47:44,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-23 23:47:44,414 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-23 23:47:44,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-23 23:47:44,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-23 23:47:44,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-23 23:47:44,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-23 23:47:44,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-23 23:47:44,420 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-11-23 23:47:44,476 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-23 23:47:44,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-23 23:47:44,478 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-23 23:47:44,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-23 23:47:44,479 INFO L138 SettingsManager]: * Use SBE=true [2020-11-23 23:47:44,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-23 23:47:44,480 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-23 23:47:44,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-23 23:47:44,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-23 23:47:44,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-23 23:47:44,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-23 23:47:44,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-23 23:47:44,481 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-23 23:47:44,481 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-23 23:47:44,482 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-23 23:47:44,482 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-23 23:47:44,482 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-23 23:47:44,482 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-23 23:47:44,483 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-23 23:47:44,483 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-23 23:47:44,483 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-23 23:47:44,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-23 23:47:44,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-23 23:47:44,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-23 23:47:44,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-23 23:47:44,485 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-23 23:47:44,485 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-11-23 23:47:44,485 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-23 23:47:44,485 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-23 23:47:44,486 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-23 23:47:44,486 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-23 23:47:44,486 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-2/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-2/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 -> fb5ab7eb36d10dfdf42ecc1671ac3f1599a6bed2 [2020-11-23 23:47:44,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-23 23:47:44,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-23 23:47:44,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-23 23:47:44,991 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-23 23:47:44,994 INFO L275 PluginConnector]: CDTParser initialized [2020-11-23 23:47:44,996 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c [2020-11-23 23:47:45,096 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e66db96e5/e09a73bfc95a4261ab36f969af9714e3/FLAGc49751438 [2020-11-23 23:47:45,723 INFO L306 CDTParser]: Found 1 translation units. [2020-11-23 23:47:45,724 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/floats-esbmc-regression/Double_div.i.p+cfa-reducer.c [2020-11-23 23:47:45,732 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e66db96e5/e09a73bfc95a4261ab36f969af9714e3/FLAGc49751438 [2020-11-23 23:47:46,120 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e66db96e5/e09a73bfc95a4261ab36f969af9714e3 [2020-11-23 23:47:46,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-23 23:47:46,136 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-23 23:47:46,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-23 23:47:46,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-23 23:47:46,145 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-23 23:47:46,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:47:46" (1/1) ... [2020-11-23 23:47:46,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e3939ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:46, skipping insertion in model container [2020-11-23 23:47:46,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:47:46" (1/1) ... [2020-11-23 23:47:46,161 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-11-23 23:47:46,184 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-11-23 23:47:46,446 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-11-23 23:47:46,465 INFO L212 MainTranslator]: Completed pre-run [2020-11-23 23:47:46,490 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-11-23 23:47:46,516 INFO L217 MainTranslator]: Completed translation [2020-11-23 23:47:46,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:46 WrapperNode [2020-11-23 23:47:46,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-23 23:47:46,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-23 23:47:46,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-23 23:47:46,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-23 23:47:46,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:46" (1/1) ... [2020-11-23 23:47:46,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:46" (1/1) ... [2020-11-23 23:47:46,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-23 23:47:46,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-23 23:47:46,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-23 23:47:46,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-23 23:47:46,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:46" (1/1) ... [2020-11-23 23:47:46,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:46" (1/1) ... [2020-11-23 23:47:46,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:46" (1/1) ... [2020-11-23 23:47:46,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:46" (1/1) ... [2020-11-23 23:47:46,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:46" (1/1) ... [2020-11-23 23:47:46,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:46" (1/1) ... [2020-11-23 23:47:46,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:46" (1/1) ... [2020-11-23 23:47:46,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-23 23:47:46,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-23 23:47:46,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-23 23:47:46,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-23 23:47:46,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:46" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 23:47:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.float_to_bitvec_DOUBLE [2020-11-23 23:47:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-23 23:47:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-23 23:47:46,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-23 23:47:46,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-23 23:47:47,683 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-23 23:47:47,684 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-11-23 23:47:47,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:47:47 BoogieIcfgContainer [2020-11-23 23:47:47,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-23 23:47:47,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-23 23:47:47,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-23 23:47:47,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-23 23:47:47,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:47:46" (1/3) ... [2020-11-23 23:47:47,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df40d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:47:47, skipping insertion in model container [2020-11-23 23:47:47,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:47:46" (2/3) ... [2020-11-23 23:47:47,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df40d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:47:47, skipping insertion in model container [2020-11-23 23:47:47,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:47:47" (3/3) ... [2020-11-23 23:47:47,695 INFO L111 eAbstractionObserver]: Analyzing ICFG Double_div.i.p+cfa-reducer.c [2020-11-23 23:47:47,707 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-23 23:47:47,713 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-23 23:47:47,728 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-23 23:47:47,755 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-23 23:47:47,756 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-23 23:47:47,756 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-23 23:47:47,756 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-23 23:47:47,756 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-23 23:47:47,757 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-23 23:47:47,757 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-23 23:47:47,757 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-23 23:47:47,772 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2020-11-23 23:47:47,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-23 23:47:47,778 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 23:47:47,779 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-23 23:47:47,779 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 23:47:47,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 23:47:47,786 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2020-11-23 23:47:47,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 23:47:47,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560209644] [2020-11-23 23:47:47,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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 23:47:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-23 23:47:48,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-23 23:47:48,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 23:47:50,474 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (and (= (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse0))) is different from true [2020-11-23 23:47:50,494 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 23:47:50,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 23:47:51,750 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 23:47:51,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560209644] [2020-11-23 23:47:51,752 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-23 23:47:51,752 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-11-23 23:47:51,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297664301] [2020-11-23 23:47:51,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-23 23:47:51,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 23:47:51,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-23 23:47:51,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2020-11-23 23:47:51,776 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 5 states. [2020-11-23 23:47:58,019 WARN L193 SmtUtils]: Spent 4.42 s on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2020-11-23 23:48:01,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 23:48:01,470 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-11-23 23:48:01,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-23 23:48:01,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2020-11-23 23:48:01,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 23:48:01,482 INFO L225 Difference]: With dead ends: 18 [2020-11-23 23:48:01,483 INFO L226 Difference]: Without dead ends: 8 [2020-11-23 23:48:01,488 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16, Invalid=17, Unknown=1, NotChecked=8, Total=42 [2020-11-23 23:48:01,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-11-23 23:48:01,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-11-23 23:48:01,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-11-23 23:48:01,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-11-23 23:48:01,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2020-11-23 23:48:01,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 23:48:01,528 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-11-23 23:48:01,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-23 23:48:01,529 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-11-23 23:48:01,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-23 23:48:01,530 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 23:48:01,530 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2020-11-23 23:48:01,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-23 23:48:01,732 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 23:48:01,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 23:48:01,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1805796550, now seen corresponding path program 1 times [2020-11-23 23:48:01,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 23:48:01,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912207800] [2020-11-23 23:48:01,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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 23:48:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-23 23:48:02,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-23 23:48:02,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 23:48:07,312 WARN L193 SmtUtils]: Spent 3.64 s on a formula simplification that was a NOOP. DAG size: 23 [2020-11-23 23:48:09,557 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((v_ULTIMATE.start_main_~main__x~0_8 (_ BitVec 64)) (ULTIMATE.start_main_~main__x~0 (_ BitVec 64))) (let ((.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_8)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= (fp.div c_~CRM .cse2 .cse1) .cse0) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse2))))) is different from false [2020-11-23 23:48:11,930 WARN L838 $PredicateComparison]: unable to prove that (and (= (fp.div roundNearestTiesToEven (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (exists ((v_ULTIMATE.start_main_~main__x~0_9 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_8 (_ BitVec 64))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_9))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_8)))) (and (= (fp.div roundNearestTiesToEven .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= (fp.div roundNearestTiesToEven .cse2 .cse1) .cse0) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse2))))) is different from false [2020-11-23 23:48:14,119 WARN L860 $PredicateComparison]: unable to prove that (and (= (fp.div roundNearestTiesToEven (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (exists ((v_ULTIMATE.start_main_~main__x~0_9 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_8 (_ BitVec 64))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_9))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_8)))) (and (= (fp.div roundNearestTiesToEven .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= (fp.div roundNearestTiesToEven .cse2 .cse1) .cse0) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse2))))) is different from true [2020-11-23 23:48:14,129 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 23:48:14,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 23:48:17,157 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_10 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_10))) (.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)))) (or (not (fp.eq .cse0 .cse1)) (not (= .cse0 (fp.div c_~CRM .cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)))))))) is different from false [2020-11-23 23:48:20,011 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_10 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_11 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_10))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_11) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_11) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_11))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (not (fp.eq .cse2 .cse0)) (not (= .cse0 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse1)))))) is different from false [2020-11-23 23:48:24,233 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_10 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_12 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_11 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_12 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_12) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_12) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_12))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_10))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_11) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_11) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_11))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_12) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_12) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_12))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (not (= (fp.div c_~CRM .cse3 .cse1) .cse4)) (not (= .cse3 ((_ to_fp 11 53) c_~CRM 1.0))) (not (fp.eq .cse2 .cse0)) (not (= .cse0 (fp.div c_~CRM .cse4 .cse1)))))) is different from true [2020-11-23 23:48:24,235 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 23:48:24,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912207800] [2020-11-23 23:48:24,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-23 23:48:24,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2020-11-23 23:48:24,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342432314] [2020-11-23 23:48:24,237 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-23 23:48:24,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 23:48:24,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-23 23:48:24,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=16, Unknown=6, NotChecked=50, Total=90 [2020-11-23 23:48:24,239 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 10 states. [2020-11-23 23:48:31,596 WARN L193 SmtUtils]: Spent 2.44 s on a formula simplification that was a NOOP. DAG size: 43 [2020-11-23 23:48:34,812 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~main__x1~0_10 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_11 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_10))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_11) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_11) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_11))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (not (fp.eq .cse2 .cse0)) (not (= .cse0 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse1)))))) (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (and (= (fp.div c_~CRM .cse3 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse3)))) (not (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))))) is different from true [2020-11-23 23:48:37,438 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (forall ((v_ULTIMATE.start_main_~main__x1~0_10 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_10) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_10))) (.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)))) (or (not (fp.eq .cse0 .cse1)) (not (= .cse0 (fp.div c_~CRM .cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)))))))) (exists ((v_ULTIMATE.start_main_~main__x~0_8 (_ BitVec 64)) (ULTIMATE.start_main_~main__x~0 (_ BitVec 64))) (let ((.cse3 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_8)))) (and (= (fp.div c_~CRM .cse2 .cse3) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= (fp.div c_~CRM .cse4 .cse3) .cse2) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse4))))) is different from false [2020-11-23 23:48:41,082 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (and (= (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) .cse1) (exists ((v_ULTIMATE.start_main_~main__x~0_9 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_8 (_ BitVec 64))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_9))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_8)))) (and (= (fp.div roundNearestTiesToEven .cse2 .cse3) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= (fp.div roundNearestTiesToEven .cse4 .cse3) .cse2) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse4)))) (not (fp.eq .cse1 .cse0)))) is different from false [2020-11-23 23:48:43,329 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (and (= (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) .cse1) (exists ((v_ULTIMATE.start_main_~main__x~0_9 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_8 (_ BitVec 64))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_9) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_9) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_9))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_8) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_8)))) (and (= (fp.div roundNearestTiesToEven .cse2 .cse3) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= (fp.div roundNearestTiesToEven .cse4 .cse3) .cse2) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse4)))) (not (fp.eq .cse1 .cse0)))) is different from true [2020-11-23 23:48:44,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 23:48:44,047 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2020-11-23 23:48:44,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-23 23:48:44,048 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2020-11-23 23:48:44,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 23:48:44,048 INFO L225 Difference]: With dead ends: 12 [2020-11-23 23:48:44,049 INFO L226 Difference]: Without dead ends: 9 [2020-11-23 23:48:44,050 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 40.7s TimeCoverageRelationStatistics Valid=27, Invalid=23, Unknown=12, NotChecked=120, Total=182 [2020-11-23 23:48:44,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-11-23 23:48:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-11-23 23:48:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-11-23 23:48:44,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2020-11-23 23:48:44,054 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2020-11-23 23:48:44,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 23:48:44,054 INFO L481 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2020-11-23 23:48:44,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-23 23:48:44,054 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-11-23 23:48:44,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-23 23:48:44,055 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 23:48:44,055 INFO L422 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2020-11-23 23:48:44,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-23 23:48:44,258 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 23:48:44,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 23:48:44,260 INFO L82 PathProgramCache]: Analyzing trace with hash 145055718, now seen corresponding path program 2 times [2020-11-23 23:48:44,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 23:48:44,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122154825] [2020-11-23 23:48:44,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/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 23:48:45,057 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-23 23:48:45,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-23 23:48:45,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core [2020-11-23 23:48:45,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 23:48:50,577 WARN L193 SmtUtils]: Spent 3.93 s on a formula simplification that was a NOOP. DAG size: 23 [2020-11-23 23:48:52,825 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_13 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse2 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_13)))) (and (= .cse0 (fp.div c_~CRM .cse1 .cse2)) (= (fp.div c_~CRM .cse0 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse1))))) is different from false [2020-11-23 23:48:55,205 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_13 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_14 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_14))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_13)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= (fp.div c_~CRM .cse2 .cse1) .cse0) (= .cse2 (fp.div c_~CRM .cse3 .cse1)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse3)))) (= roundNearestTiesToEven c_~CRM)) is different from false [2020-11-23 23:48:57,694 WARN L838 $PredicateComparison]: unable to prove that (and (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= roundNearestTiesToEven c_~CRM) (exists ((v_ULTIMATE.start_main_~main__x~0_13 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_14 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_15 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_15) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_15) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_15))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_14))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_13)))) (and (= (fp.div c_~CRM .cse0 .cse1) .cse2) (= (fp.div c_~CRM .cse2 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= .cse0 (fp.div c_~CRM .cse3 .cse1)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse3))))) is different from false [2020-11-23 23:48:59,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-23 23:49:04,877 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 23:49:04,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 23:49:25,397 WARN L193 SmtUtils]: Spent 6.90 s on a formula simplification that was a NOOP. DAG size: 24 [2020-11-23 23:49:27,675 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_16 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_17 (_ BitVec 64))) (let ((.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_16))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_17)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (fp.eq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse0 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse1))) (not (fp.eq .cse2 .cse0))))) is different from true [2020-11-23 23:49:30,069 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_16 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_18 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_17 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_18) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_18) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_18))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_16))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_17)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse1) .cse3)) (fp.eq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse0 (fp.div c_~CRM .cse3 .cse1))) (not (fp.eq .cse2 .cse0))))) is different from true [2020-11-23 23:49:32,628 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_16 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_18 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_17 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_19 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_19 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_19))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_19))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_18) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_18) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_18))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_16))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_17)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (not (= (fp.div c_~CRM .cse3 .cse1) .cse4)) (not (= (fp.div c_~CRM .cse2 .cse1) .cse5)) (not (= ((_ to_fp 11 53) c_~CRM 1.0) .cse0)) (fp.eq .cse3 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse3 (fp.div c_~CRM .cse5 .cse1))) (not (fp.eq .cse4 .cse3))))) is different from true [2020-11-23 23:49:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2020-11-23 23:49:32,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122154825] [2020-11-23 23:49:32,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-23 23:49:32,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2020-11-23 23:49:32,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995101210] [2020-11-23 23:49:32,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-23 23:49:32,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 23:49:32,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-23 23:49:32,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=10, NotChecked=90, Total=156 [2020-11-23 23:49:32,638 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 13 states. [2020-11-23 23:49:43,594 WARN L193 SmtUtils]: Spent 2.60 s on a formula simplification that was a NOOP. DAG size: 54 [2020-11-23 23:49:46,661 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)))) (and (or (fp.eq .cse0 .cse1) (forall ((v_ULTIMATE.start_main_~main__x1~0_16 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_16)))) (or (not (fp.eq .cse2 .cse3)) (not (= (fp.div c_~CRM .cse3 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) .cse2)))))) (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (and (= (fp.div c_~CRM .cse4 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse4)))) (forall ((v_ULTIMATE.start_main_~main__x1~0_16 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_18 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_17 (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_18) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_18) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_18))) (.cse6 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_16))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_17)))) (or (not (= (fp.div c_~CRM .cse5 .cse6) .cse7)) (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse6) .cse8)) (fp.eq .cse5 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse5 (fp.div c_~CRM .cse8 .cse6))) (not (fp.eq .cse7 .cse5))))) (let ((.cse9 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (or (fp.eq .cse9 .cse1) (not (fp.eq .cse0 .cse9)))))) is different from false [2020-11-23 23:49:48,940 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~main__x1~0_16 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_17 (_ BitVec 64))) (let ((.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_16))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_17)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (fp.eq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse0 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse1))) (not (fp.eq .cse2 .cse0))))) (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_13 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse5 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_13)))) (and (= .cse3 (fp.div c_~CRM .cse4 .cse5)) (= (fp.div c_~CRM .cse3 .cse5) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse4)))) (let ((.cse6 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (or (fp.eq .cse6 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse6))))) is different from false [2020-11-23 23:49:51,786 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~main__x1~0_16 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_17 (_ BitVec 64))) (let ((.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_16))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_17) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_17) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_17)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (fp.eq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse0 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse1))) (not (fp.eq .cse2 .cse0))))) (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_13 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse5 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_13)))) (and (= .cse3 (fp.div c_~CRM .cse4 .cse5)) (= (fp.div c_~CRM .cse3 .cse5) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse4)))) (let ((.cse6 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (or (fp.eq .cse6 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse6))))) is different from true [2020-11-23 23:49:54,355 WARN L838 $PredicateComparison]: unable to prove that (and (or (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (forall ((v_ULTIMATE.start_main_~main__x1~0_16 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_16)))) (or (not (fp.eq .cse0 .cse1)) (not (= (fp.div c_~CRM .cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) .cse0)))))) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_13 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_14 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_14))) (.cse3 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_13)))) (and (= (fp.div c_~CRM .cse2 .cse3) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= (fp.div c_~CRM .cse4 .cse3) .cse2) (= .cse4 (fp.div c_~CRM .cse5 .cse3)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse5)))) (= roundNearestTiesToEven c_~CRM)) is different from false [2020-11-23 23:49:57,494 WARN L860 $PredicateComparison]: unable to prove that (and (or (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (forall ((v_ULTIMATE.start_main_~main__x1~0_16 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_16)))) (or (not (fp.eq .cse0 .cse1)) (not (= (fp.div c_~CRM .cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) .cse0)))))) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_13 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_14 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_14))) (.cse3 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_13)))) (and (= (fp.div c_~CRM .cse2 .cse3) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= (fp.div c_~CRM .cse4 .cse3) .cse2) (= .cse4 (fp.div c_~CRM .cse5 .cse3)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse5)))) (= roundNearestTiesToEven c_~CRM)) is different from true [2020-11-23 23:49:59,981 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (and (= (fp.div c_~CRM .cse0 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) .cse1) (= roundNearestTiesToEven c_~CRM) (exists ((v_ULTIMATE.start_main_~main__x~0_13 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_14 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_15 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_15) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_15) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_15))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_14))) (.cse3 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_13)))) (and (= (fp.div c_~CRM .cse2 .cse3) .cse4) (= (fp.div c_~CRM .cse4 .cse3) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= .cse2 (fp.div c_~CRM .cse5 .cse3)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse5)))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (fp.eq .cse1 .cse0))))) is different from false [2020-11-23 23:50:02,099 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (and (= (fp.div c_~CRM .cse0 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) .cse1) (= roundNearestTiesToEven c_~CRM) (exists ((v_ULTIMATE.start_main_~main__x~0_13 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_14 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_15 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_15) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_15) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_15))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_14) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_14))) (.cse3 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_13)))) (and (= (fp.div c_~CRM .cse2 .cse3) .cse4) (= (fp.div c_~CRM .cse4 .cse3) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= .cse2 (fp.div c_~CRM .cse5 .cse3)) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse5)))) (or (fp.eq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (fp.eq .cse1 .cse0))))) is different from true [2020-11-23 23:50:08,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 23:50:08,636 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-11-23 23:50:08,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-23 23:50:08,637 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2020-11-23 23:50:08,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 23:50:08,638 INFO L225 Difference]: With dead ends: 13 [2020-11-23 23:50:08,638 INFO L226 Difference]: Without dead ends: 10 [2020-11-23 23:50:08,638 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 69.0s TimeCoverageRelationStatistics Valid=35, Invalid=42, Unknown=19, NotChecked=210, Total=306 [2020-11-23 23:50:08,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-11-23 23:50:08,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-11-23 23:50:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-11-23 23:50:08,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-11-23 23:50:08,643 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2020-11-23 23:50:08,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 23:50:08,643 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-11-23 23:50:08,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-23 23:50:08,644 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-11-23 23:50:08,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-23 23:50:08,644 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 23:50:08,645 INFO L422 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2020-11-23 23:50:08,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-23 23:50:08,846 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 23:50:08,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 23:50:08,847 INFO L82 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 3 times [2020-11-23 23:50:08,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 23:50:08,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459652105] [2020-11-23 23:50:08,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/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 23:50:09,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-11-23 23:50:09,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-23 23:50:09,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 15 conjunts are in the unsatisfiable core [2020-11-23 23:50:09,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 23:50:14,694 WARN L193 SmtUtils]: Spent 3.51 s on a formula simplification that was a NOOP. DAG size: 23 [2020-11-23 23:50:16,966 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_20 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_20)))) (and (= (fp.div c_~CRM .cse0 .cse1) .cse2) (= (fp.div c_~CRM .cse2 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= .cse0 ((_ to_fp 11 53) c_~CRM 1.0))))) (= roundNearestTiesToEven c_~CRM)) is different from false [2020-11-23 23:50:19,351 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_20 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_21 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_21))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_20)))) (and (= (fp.div c_~CRM .cse0 .cse1) .cse2) (= .cse0 (fp.div c_~CRM .cse3 .cse1)) (= (fp.div c_~CRM .cse2 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= .cse3 ((_ to_fp 11 53) c_~CRM 1.0)))))) is different from false [2020-11-23 23:50:21,884 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_20 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_21 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_22 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_21))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_22) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_22) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_22))) (.cse2 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_20)))) (and (= .cse0 (fp.div c_~CRM .cse1 .cse2)) (= (fp.div c_~CRM .cse3 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= .cse4 (fp.div c_~CRM .cse0 .cse2)) (= (fp.div c_~CRM .cse4 .cse2) .cse3) (= .cse1 ((_ to_fp 11 53) c_~CRM 1.0)))))) is different from false [2020-11-23 23:50:24,722 WARN L838 $PredicateComparison]: unable to prove that (and (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= roundNearestTiesToEven c_~CRM) (exists ((v_ULTIMATE.start_main_~main__x~0_20 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_21 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_22 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_23 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_21))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_22) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_22) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_22))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_23))) (.cse2 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_20)))) (and (= .cse0 (fp.div c_~CRM .cse1 .cse2)) (= .cse3 (fp.div c_~CRM .cse0 .cse2)) (= (fp.div c_~CRM .cse3 .cse2) .cse4) (= (fp.div c_~CRM .cse4 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= .cse1 ((_ to_fp 11 53) c_~CRM 1.0)))))) is different from false [2020-11-23 23:50:26,854 WARN L860 $PredicateComparison]: unable to prove that (and (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= roundNearestTiesToEven c_~CRM) (exists ((v_ULTIMATE.start_main_~main__x~0_20 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_21 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_22 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_23 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_21))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_22) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_22) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_22))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_23))) (.cse2 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_20)))) (and (= .cse0 (fp.div c_~CRM .cse1 .cse2)) (= .cse3 (fp.div c_~CRM .cse0 .cse2)) (= (fp.div c_~CRM .cse3 .cse2) .cse4) (= (fp.div c_~CRM .cse4 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= .cse1 ((_ to_fp 11 53) c_~CRM 1.0)))))) is different from true [2020-11-23 23:50:26,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-23 23:50:32,642 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 23:50:32,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 23:50:35,234 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-11-23 23:50:37,398 WARN L860 $PredicateComparison]: unable to prove that (or (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (forall ((v_ULTIMATE.start_main_~main__x1~0_24 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_24)))) (or (not (fp.eq .cse0 .cse1)) (not (= (fp.div c_~CRM .cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) .cse0)))))) is different from true [2020-11-23 23:50:39,683 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_25 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_24 (_ BitVec 64))) (let ((.cse2 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_24))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_25)))) (or (not (= .cse0 (fp.div c_~CRM .cse1 .cse2))) (fp.eq .cse1 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse2) .cse1)) (not (fp.eq .cse0 .cse1))))) is different from true [2020-11-23 23:50:42,086 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_25 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_24 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_26 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_24))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_25))) (.cse2 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_26) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_26) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_26)))) (or (not (= .cse0 (fp.div c_~CRM .cse1 .cse2))) (not (= .cse3 (fp.div c_~CRM .cse0 .cse2))) (fp.eq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (fp.eq .cse3 .cse0)) (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse2) .cse1))))) is different from true [2020-11-23 23:50:44,642 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_25 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_24 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_27 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_26 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_26) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_26) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_26))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_27) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_27) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_27))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_24))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_25)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (not (= .cse3 (fp.div c_~CRM .cse2 .cse1))) (not (= .cse4 (fp.div c_~CRM .cse3 .cse1))) (fp.eq .cse3 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse0 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse1))) (not (fp.eq .cse4 .cse3))))) is different from true [2020-11-23 23:50:47,519 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_25 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_24 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_27 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_26 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_28 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_28 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_26) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_26) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_26))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_28) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_28) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_28))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_27) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_27) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_27))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_28) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_28) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_28))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_24))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_25)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (not (= (fp.div c_~CRM .cse3 .cse1) .cse4)) (not (= .cse5 (fp.div c_~CRM .cse4 .cse1))) (not (= .cse0 ((_ to_fp 11 53) c_~CRM 1.0))) (not (= .cse6 (fp.div c_~CRM .cse5 .cse1))) (fp.eq .cse5 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse3 (fp.div c_~CRM .cse2 .cse1))) (not (fp.eq .cse6 .cse5))))) is different from true [2020-11-23 23:50:47,521 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 23:50:47,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459652105] [2020-11-23 23:50:47,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-23 23:50:47,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2020-11-23 23:50:47,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483681061] [2020-11-23 23:50:47,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-23 23:50:47,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 23:50:47,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-23 23:50:47,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=10, NotChecked=144, Total=210 [2020-11-23 23:50:47,525 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 15 states. [2020-11-23 23:50:56,765 WARN L193 SmtUtils]: Spent 2.89 s on a formula simplification that was a NOOP. DAG size: 62 [2020-11-23 23:51:01,030 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~main__x1~0_25 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_24 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_27 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_26 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_26) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_26) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_26))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_27) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_27) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_27))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_24))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_25)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (not (= .cse3 (fp.div c_~CRM .cse2 .cse1))) (not (= .cse4 (fp.div c_~CRM .cse3 .cse1))) (fp.eq .cse3 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse0 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse1))) (not (fp.eq .cse4 .cse3))))) (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (and (= (fp.div c_~CRM .cse5 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse5)))) (let ((.cse6 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (or (fp.eq .cse6 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse6))))) is different from true [2020-11-23 23:51:03,289 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_20 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_20)))) (and (= (fp.div c_~CRM .cse0 .cse1) .cse2) (= (fp.div c_~CRM .cse2 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= .cse0 ((_ to_fp 11 53) c_~CRM 1.0))))) (= roundNearestTiesToEven c_~CRM) (forall ((v_ULTIMATE.start_main_~main__x1~0_25 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_24 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_26 (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_24))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_25))) (.cse5 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_26) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_26) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_26)))) (or (not (= .cse3 (fp.div c_~CRM .cse4 .cse5))) (not (= .cse6 (fp.div c_~CRM .cse3 .cse5))) (fp.eq .cse3 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (fp.eq .cse6 .cse3)) (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse5) .cse4)))))) is different from false [2020-11-23 23:51:05,711 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_20 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_21 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_21))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_20)))) (and (= (fp.div c_~CRM .cse0 .cse1) .cse2) (= .cse0 (fp.div c_~CRM .cse3 .cse1)) (= (fp.div c_~CRM .cse2 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= .cse3 ((_ to_fp 11 53) c_~CRM 1.0))))) (forall ((v_ULTIMATE.start_main_~main__x1~0_25 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_24 (_ BitVec 64))) (let ((.cse6 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_24))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_25)))) (or (not (= .cse4 (fp.div c_~CRM .cse5 .cse6))) (fp.eq .cse5 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse6) .cse5)) (not (fp.eq .cse4 .cse5)))))) is different from false [2020-11-23 23:51:09,022 WARN L860 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_20 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_21 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_21))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_20)))) (and (= (fp.div c_~CRM .cse0 .cse1) .cse2) (= .cse0 (fp.div c_~CRM .cse3 .cse1)) (= (fp.div c_~CRM .cse2 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= .cse3 ((_ to_fp 11 53) c_~CRM 1.0))))) (forall ((v_ULTIMATE.start_main_~main__x1~0_25 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_24 (_ BitVec 64))) (let ((.cse6 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_24))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_25) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_25)))) (or (not (= .cse4 (fp.div c_~CRM .cse5 .cse6))) (fp.eq .cse5 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse6) .cse5)) (not (fp.eq .cse4 .cse5)))))) is different from true [2020-11-23 23:51:11,592 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (or (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (forall ((v_ULTIMATE.start_main_~main__x1~0_24 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_24)))) (or (not (fp.eq .cse0 .cse1)) (not (= (fp.div c_~CRM .cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) .cse0)))))) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_20 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_21 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_22 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_21))) (.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_22) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_22) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_22))) (.cse4 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse5 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_20)))) (and (= .cse2 (fp.div c_~CRM .cse3 .cse4)) (= (fp.div c_~CRM .cse5 .cse4) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= .cse6 (fp.div c_~CRM .cse2 .cse4)) (= (fp.div c_~CRM .cse6 .cse4) .cse5) (= .cse3 ((_ to_fp 11 53) c_~CRM 1.0)))))) is different from false [2020-11-23 23:51:13,933 WARN L860 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (or (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (forall ((v_ULTIMATE.start_main_~main__x1~0_24 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_24) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_24)))) (or (not (fp.eq .cse0 .cse1)) (not (= (fp.div c_~CRM .cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) .cse0)))))) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_20 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_21 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_22 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_21))) (.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_22) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_22) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_22))) (.cse4 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse5 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_20)))) (and (= .cse2 (fp.div c_~CRM .cse3 .cse4)) (= (fp.div c_~CRM .cse5 .cse4) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= .cse6 (fp.div c_~CRM .cse2 .cse4)) (= (fp.div c_~CRM .cse6 .cse4) .cse5) (= .cse3 ((_ to_fp 11 53) c_~CRM 1.0)))))) is different from true [2020-11-23 23:51:16,778 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)))) (and (= (fp.div c_~CRM .cse0 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) .cse1) (= roundNearestTiesToEven c_~CRM) (or (fp.eq .cse0 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (fp.eq .cse1 .cse0))) (exists ((v_ULTIMATE.start_main_~main__x~0_20 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_21 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_22 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_23 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_21))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_22) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_22) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_22))) (.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_23))) (.cse4 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_20)))) (and (= .cse2 (fp.div c_~CRM .cse3 .cse4)) (= .cse5 (fp.div c_~CRM .cse2 .cse4)) (= (fp.div c_~CRM .cse5 .cse4) .cse6) (= (fp.div c_~CRM .cse6 .cse4) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= .cse3 ((_ to_fp 11 53) c_~CRM 1.0))))))) is different from false [2020-11-23 23:51:21,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-23 23:51:21,070 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-11-23 23:51:21,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-23 23:51:21,071 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 9 [2020-11-23 23:51:21,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-23 23:51:21,071 INFO L225 Difference]: With dead ends: 14 [2020-11-23 23:51:21,071 INFO L226 Difference]: Without dead ends: 11 [2020-11-23 23:51:21,072 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 63.0s TimeCoverageRelationStatistics Valid=41, Invalid=38, Unknown=19, NotChecked=322, Total=420 [2020-11-23 23:51:21,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-11-23 23:51:21,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-11-23 23:51:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-11-23 23:51:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2020-11-23 23:51:21,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2020-11-23 23:51:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-23 23:51:21,078 INFO L481 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2020-11-23 23:51:21,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-23 23:51:21,078 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2020-11-23 23:51:21,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-11-23 23:51:21,079 INFO L414 BasicCegarLoop]: Found error trace [2020-11-23 23:51:21,079 INFO L422 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2020-11-23 23:51:21,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-11-23 23:51:21,287 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-23 23:51:21,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-23 23:51:21,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1957592038, now seen corresponding path program 4 times [2020-11-23 23:51:21,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-23 23:51:21,290 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027766337] [2020-11-23 23:51:21,290 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-2/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 23:51:22,538 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-23 23:51:22,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-23 23:51:22,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-23 23:51:22,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-23 23:51:28,751 WARN L193 SmtUtils]: Spent 4.84 s on a formula simplification that was a NOOP. DAG size: 23 [2020-11-23 23:51:31,022 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_29 (_ BitVec 64))) (let ((.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_29)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= (fp.div c_~CRM .cse2 .cse1) .cse0) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse2))))) is different from false [2020-11-23 23:51:33,458 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_30 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_29 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_29))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_30) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_30) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_30))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse2) (= .cse3 (fp.div c_~CRM .cse2 .cse1)) (= (fp.div c_~CRM .cse3 .cse1) .cse0)))) (= roundNearestTiesToEven c_~CRM)) is different from false [2020-11-23 23:51:36,036 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_30 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_31 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_29 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_31) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_31) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_31))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_30) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_30) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_30))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_29))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= .cse2 (fp.div c_~CRM .cse3 .cse1)) (= (fp.div c_~CRM .cse2 .cse1) .cse0) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse4) (= .cse3 (fp.div c_~CRM .cse4 .cse1)))))) is different from false [2020-11-23 23:51:39,023 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_30 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_31 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_32 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_29 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_30) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_30) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_30))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_29))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_31) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_31) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_31))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_32) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_32) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_32)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= .cse2 (fp.div c_~CRM .cse3 .cse1)) (= (fp.div c_~CRM .cse4 .cse1) .cse0) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse5) (= .cse3 (fp.div c_~CRM .cse5 .cse1)) (= (fp.div c_~CRM .cse2 .cse1) .cse4))))) is different from false [2020-11-23 23:51:42,586 WARN L838 $PredicateComparison]: unable to prove that (and (= (fp.div roundNearestTiesToEven (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (exists ((v_ULTIMATE.start_main_~main__x~0_30 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_31 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_32 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_33 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_29 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_32) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_32) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_32))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_33) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_33) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_33))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_31) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_31) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_31))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_29))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_30) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_30) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_30)))) (and (= (fp.div roundNearestTiesToEven .cse0 .cse1) .cse2) (= (fp.div roundNearestTiesToEven .cse3 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= (fp.div roundNearestTiesToEven .cse2 .cse1) .cse3) (= .cse0 (fp.div roundNearestTiesToEven .cse4 .cse1)) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse5) (= (fp.div roundNearestTiesToEven .cse5 .cse1) .cse4))))) is different from false [2020-11-23 23:51:44,704 WARN L860 $PredicateComparison]: unable to prove that (and (= (fp.div roundNearestTiesToEven (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (exists ((v_ULTIMATE.start_main_~main__x~0_30 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_31 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_32 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_33 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_29 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_32) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_32) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_32))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_33) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_33) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_33))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_31) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_31) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_31))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_29))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 5.0 2.0))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_30) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_30) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_30)))) (and (= (fp.div roundNearestTiesToEven .cse0 .cse1) .cse2) (= (fp.div roundNearestTiesToEven .cse3 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))) (= (fp.div roundNearestTiesToEven .cse2 .cse1) .cse3) (= .cse0 (fp.div roundNearestTiesToEven .cse4 .cse1)) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) .cse5) (= (fp.div roundNearestTiesToEven .cse5 .cse1) .cse4))))) is different from true [2020-11-23 23:51:44,711 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 23:51:44,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-23 23:51:48,551 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_34 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_34))) (.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)))) (or (not (= .cse0 (fp.div c_~CRM .cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))))) (not (fp.eq .cse0 .cse1))))) is different from false [2020-11-23 23:51:50,674 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_34 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_34))) (.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)))) (or (not (= .cse0 (fp.div c_~CRM .cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))))) (not (fp.eq .cse0 .cse1))))) is different from true [2020-11-23 23:51:52,822 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_34 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_35 (_ BitVec 64))) (let ((.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_34))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_35)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse1) .cse0)) (not (fp.eq .cse2 .cse0))))) is different from false [2020-11-23 23:51:59,070 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_34 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_36 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_35 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_36) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_36) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_36))) (.cse2 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_34))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_35)))) (or (not (= .cse0 (fp.div c_~CRM .cse1 .cse2))) (not (= .cse1 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse2))) (not (= (fp.div c_~CRM .cse0 .cse2) .cse3)) (not (fp.eq .cse3 .cse0))))) is different from true [2020-11-23 23:52:01,217 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_34 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_36 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_35 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_37 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_34))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_35))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_36) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_36) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_36))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_37) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_37) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_37))) (.cse2 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)))) (or (not (= .cse0 (fp.div c_~CRM .cse1 .cse2))) (not (= .cse3 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse2))) (not (= (fp.div c_~CRM .cse0 .cse2) .cse4)) (not (fp.eq .cse4 .cse0)) (not (= .cse1 (fp.div c_~CRM .cse3 .cse2)))))) is different from false [2020-11-23 23:52:03,744 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_34 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_36 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_35 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_37 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_34))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_35))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_36) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_36) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_36))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_37) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_37) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_37))) (.cse2 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)))) (or (not (= .cse0 (fp.div c_~CRM .cse1 .cse2))) (not (= .cse3 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse2))) (not (= (fp.div c_~CRM .cse0 .cse2) .cse4)) (not (fp.eq .cse4 .cse0)) (not (= .cse1 (fp.div c_~CRM .cse3 .cse2)))))) is different from true [2020-11-23 23:52:05,921 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_34 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_36 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_35 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_38 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_37 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_34))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_35))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_36) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_36) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_36))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_38) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_38) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_38))) (.cse2 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_37) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_37) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_37)))) (or (not (= .cse0 (fp.div c_~CRM .cse1 .cse2))) (not (= (fp.div c_~CRM .cse0 .cse2) .cse3)) (not (fp.eq .cse3 .cse0)) (not (= .cse1 (fp.div c_~CRM .cse4 .cse2))) (not (= .cse5 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse2))) (not (= (fp.div c_~CRM .cse5 .cse2) .cse4))))) is different from false [2020-11-23 23:52:08,784 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_34 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_36 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_35 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_38 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_37 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_34))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_35))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_36) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_36) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_36))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_38) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_38) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_38))) (.cse2 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_37) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_37) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_37)))) (or (not (= .cse0 (fp.div c_~CRM .cse1 .cse2))) (not (= (fp.div c_~CRM .cse0 .cse2) .cse3)) (not (fp.eq .cse3 .cse0)) (not (= .cse1 (fp.div c_~CRM .cse4 .cse2))) (not (= .cse5 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse2))) (not (= (fp.div c_~CRM .cse5 .cse2) .cse4))))) is different from true [2020-11-23 23:52:12,281 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~main__x1~0_34 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_36 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_35 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_38 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_37 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_39 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_39 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_39) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_39) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_39))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_34))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_35))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_36) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_36) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_36))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_39) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_39) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_39))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_38) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_38) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_38))) (.cse2 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_37) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_37) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_37)))) (or (not (= .cse0 (fp.div c_~CRM .cse1 .cse2))) (not (= ((_ to_fp 11 53) c_~CRM 1.0) .cse3)) (not (= .cse4 (fp.div c_~CRM .cse3 .cse2))) (not (= (fp.div c_~CRM .cse0 .cse2) .cse5)) (not (fp.eq .cse5 .cse0)) (not (= .cse1 (fp.div c_~CRM .cse6 .cse2))) (not (= (fp.div c_~CRM .cse4 .cse2) .cse7)) (not (= (fp.div c_~CRM .cse7 .cse2) .cse6))))) is different from true [2020-11-23 23:52:12,284 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 23:52:12,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027766337] [2020-11-23 23:52:12,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-23 23:52:12,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2020-11-23 23:52:12,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980156133] [2020-11-23 23:52:12,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-23 23:52:12,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-23 23:52:12,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-23 23:52:12,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=19, Unknown=15, NotChecked=176, Total=240 [2020-11-23 23:52:12,286 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 16 states. [2020-11-23 23:52:23,460 WARN L193 SmtUtils]: Spent 3.51 s on a formula simplification that was a NOOP. DAG size: 67 [2020-11-23 23:52:27,330 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~main__x1~0_34 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_36 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_35 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_38 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_37 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_34))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_35))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_36) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_36) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_36))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_38) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_38) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_38))) (.cse2 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_37) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_37) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_37)))) (or (not (= .cse0 (fp.div c_~CRM .cse1 .cse2))) (not (= (fp.div c_~CRM .cse0 .cse2) .cse3)) (not (fp.eq .cse3 .cse0)) (not (= .cse1 (fp.div c_~CRM .cse4 .cse2))) (not (= .cse5 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse2))) (not (= (fp.div c_~CRM .cse5 .cse2) .cse4))))) (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (and (= (fp.div c_~CRM .cse6 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse6)))) (not (fp.eq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x~0))))) is different from true [2020-11-23 23:52:29,593 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~main__x1~0_34 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_36 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_35 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_37 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_34))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_35))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_36) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_36) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_36))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_37) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_37) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_37))) (.cse2 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)))) (or (not (= .cse0 (fp.div c_~CRM .cse1 .cse2))) (not (= .cse3 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse2))) (not (= (fp.div c_~CRM .cse0 .cse2) .cse4)) (not (fp.eq .cse4 .cse0)) (not (= .cse1 (fp.div c_~CRM .cse3 .cse2)))))) (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_29 (_ BitVec 64))) (let ((.cse6 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse5 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_29)))) (and (= (fp.div c_~CRM .cse5 .cse6) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= (fp.div c_~CRM .cse7 .cse6) .cse5) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse7))))) is different from false [2020-11-23 23:52:33,863 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~main__x1~0_34 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_36 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_35 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_37 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_34))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_35))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_36) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_36) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_36))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_37) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_37) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_37))) (.cse2 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)))) (or (not (= .cse0 (fp.div c_~CRM .cse1 .cse2))) (not (= .cse3 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse2))) (not (= (fp.div c_~CRM .cse0 .cse2) .cse4)) (not (fp.eq .cse4 .cse0)) (not (= .cse1 (fp.div c_~CRM .cse3 .cse2)))))) (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_29 (_ BitVec 64))) (let ((.cse6 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse5 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_29)))) (and (= (fp.div c_~CRM .cse5 .cse6) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= (fp.div c_~CRM .cse7 .cse6) .cse5) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse7))))) is different from true [2020-11-23 23:52:36,254 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_30 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_29 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_29))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_30) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_30) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_30))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse2) (= .cse3 (fp.div c_~CRM .cse2 .cse1)) (= (fp.div c_~CRM .cse3 .cse1) .cse0)))) (= roundNearestTiesToEven c_~CRM) (forall ((v_ULTIMATE.start_main_~main__x1~0_34 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_36 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_35 (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_36) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_36) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_36))) (.cse6 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_34))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_35)))) (or (not (= .cse4 (fp.div c_~CRM .cse5 .cse6))) (not (= .cse5 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse6))) (not (= (fp.div c_~CRM .cse4 .cse6) .cse7)) (not (fp.eq .cse7 .cse4)))))) is different from false [2020-11-23 23:52:39,979 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_30 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_29 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_29))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_30) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_30) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_30))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse2) (= .cse3 (fp.div c_~CRM .cse2 .cse1)) (= (fp.div c_~CRM .cse3 .cse1) .cse0)))) (= roundNearestTiesToEven c_~CRM) (forall ((v_ULTIMATE.start_main_~main__x1~0_34 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_36 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_35 (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_36) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_36) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_36))) (.cse6 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_34))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_35)))) (or (not (= .cse4 (fp.div c_~CRM .cse5 .cse6))) (not (= .cse5 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse6))) (not (= (fp.div c_~CRM .cse4 .cse6) .cse7)) (not (fp.eq .cse7 .cse4)))))) is different from true [2020-11-23 23:52:42,499 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~main__x1~0_34 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_35 (_ BitVec 64))) (let ((.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_34))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_35)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse1) .cse0)) (not (fp.eq .cse2 .cse0))))) (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_30 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_31 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_29 (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_31) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_31) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_31))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_30) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_30) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_30))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_29))) (.cse4 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)))) (and (= (fp.div c_~CRM .cse3 .cse4) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= .cse5 (fp.div c_~CRM .cse6 .cse4)) (= (fp.div c_~CRM .cse5 .cse4) .cse3) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse7) (= .cse6 (fp.div c_~CRM .cse7 .cse4)))))) is different from false [2020-11-23 23:52:44,837 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~main__x1~0_34 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x1~0_35 (_ BitVec 64))) (let ((.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_34))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_35) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_35)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) .cse2)) (not (= (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)) .cse1) .cse0)) (not (fp.eq .cse2 .cse0))))) (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_30 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_31 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_29 (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_31) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_31) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_31))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_30) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_30) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_30))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_29))) (.cse4 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0)))) (and (= (fp.div c_~CRM .cse3 .cse4) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= .cse5 (fp.div c_~CRM .cse6 .cse4)) (= (fp.div c_~CRM .cse5 .cse4) .cse3) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse7) (= .cse6 (fp.div c_~CRM .cse7 .cse4)))))) is different from true [2020-11-23 23:52:47,693 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((ULTIMATE.start_main_~main__x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_30 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_31 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_32 (_ BitVec 64)) (v_ULTIMATE.start_main_~main__x~0_29 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~main__x~0) ((_ extract 62 52) ULTIMATE.start_main_~main__x~0) ((_ extract 51 0) ULTIMATE.start_main_~main__x~0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_30) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_30) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_30))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_29) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_29))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_31) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_31) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_31))) (.cse1 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))) (.cse4 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x~0_32) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x~0_32) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x~0_32)))) (and (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0))) (= .cse2 (fp.div c_~CRM .cse3 .cse1)) (= (fp.div c_~CRM .cse4 .cse1) .cse0) (= ((_ to_fp 11 53) c_~CRM 1.0) .cse5) (= .cse3 (fp.div c_~CRM .cse5 .cse1)) (= (fp.div c_~CRM .cse2 .cse1) .cse4)))) (forall ((v_ULTIMATE.start_main_~main__x1~0_34 (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 62 52) v_ULTIMATE.start_main_~main__x1~0_34) ((_ extract 51 0) v_ULTIMATE.start_main_~main__x1~0_34))) (.cse7 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 62 52) c_ULTIMATE.start_main_~main__x1~0) ((_ extract 51 0) c_ULTIMATE.start_main_~main__x1~0)))) (or (not (= .cse6 (fp.div c_~CRM .cse7 ((_ to_fp 11 53) c_~CRM (/ 5.0 2.0))))) (not (fp.eq .cse6 .cse7)))))) is different from false [2020-11-23 23:52:51,431 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-11-23 23:52:51,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-23 23:52:51,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-11-23 23:52:51,634 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:226) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:829) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1064) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:966) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:187) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:743) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:674) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) ... 45 more [2020-11-23 23:52:51,641 INFO L168 Benchmark]: Toolchain (without parser) took 305511.00 ms. Allocated memory is still 56.6 MB. Free memory was 33.2 MB in the beginning and 36.5 MB in the end (delta: -3.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 23:52:51,642 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 41.9 MB. Free memory was 19.9 MB in the beginning and 19.8 MB in the end (delta: 70.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 23:52:51,643 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.57 ms. Allocated memory is still 56.6 MB. Free memory was 32.7 MB in the beginning and 35.9 MB in the end (delta: -3.2 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-11-23 23:52:51,643 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.88 ms. Allocated memory is still 56.6 MB. Free memory was 35.9 MB in the beginning and 34.5 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 23:52:51,645 INFO L168 Benchmark]: Boogie Preprocessor took 28.53 ms. Allocated memory is still 56.6 MB. Free memory was 34.5 MB in the beginning and 33.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-23 23:52:51,646 INFO L168 Benchmark]: RCFGBuilder took 1096.95 ms. Allocated memory is still 56.6 MB. Free memory was 33.4 MB in the beginning and 35.3 MB in the end (delta: -2.0 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. [2020-11-23 23:52:51,646 INFO L168 Benchmark]: TraceAbstraction took 303952.39 ms. Allocated memory is still 56.6 MB. Free memory was 34.9 MB in the beginning and 36.5 MB in the end (delta: -1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-23 23:52:51,653 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.26 ms. Allocated memory is still 41.9 MB. Free memory was 19.9 MB in the beginning and 19.8 MB in the end (delta: 70.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 377.57 ms. Allocated memory is still 56.6 MB. Free memory was 32.7 MB in the beginning and 35.9 MB in the end (delta: -3.2 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 39.88 ms. Allocated memory is still 56.6 MB. Free memory was 35.9 MB in the beginning and 34.5 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.53 ms. Allocated memory is still 56.6 MB. Free memory was 34.5 MB in the beginning and 33.4 MB in the end (delta: 1.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1096.95 ms. Allocated memory is still 56.6 MB. Free memory was 33.4 MB in the beginning and 35.3 MB in the end (delta: -2.0 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 303952.39 ms. Allocated memory is still 56.6 MB. Free memory was 34.9 MB in the beginning and 36.5 MB in the end (delta: -1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...