./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/float-benchs/zonotope_tight.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2880296f Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/zonotope_tight.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 92269a31b3f4041d2f8501c63b7af13f5ed1a7b5 .............................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/zonotope_tight.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 92269a31b3f4041d2f8501c63b7af13f5ed1a7b5 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-2880296 [2020-12-02 14:58:39,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 14:58:39,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 14:58:39,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 14:58:39,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 14:58:39,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 14:58:39,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 14:58:39,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 14:58:39,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 14:58:39,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 14:58:39,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 14:58:39,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 14:58:39,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 14:58:39,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 14:58:39,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 14:58:39,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 14:58:39,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 14:58:39,548 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 14:58:39,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 14:58:39,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 14:58:39,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 14:58:39,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 14:58:39,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 14:58:39,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 14:58:39,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 14:58:39,565 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 14:58:39,565 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 14:58:39,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 14:58:39,567 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 14:58:39,568 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 14:58:39,568 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 14:58:39,569 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 14:58:39,570 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 14:58:39,571 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 14:58:39,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 14:58:39,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 14:58:39,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 14:58:39,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 14:58:39,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 14:58:39,575 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 14:58:39,576 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 14:58:39,577 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 14:58:39,619 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 14:58:39,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 14:58:39,624 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 14:58:39,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 14:58:39,626 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 14:58:39,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 14:58:39,627 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 14:58:39,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 14:58:39,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 14:58:39,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 14:58:39,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 14:58:39,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 14:58:39,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 14:58:39,629 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 14:58:39,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 14:58:39,629 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 14:58:39,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 14:58:39,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 14:58:39,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 14:58:39,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 14:58:39,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 14:58:39,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 14:58:39,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 14:58:39,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 14:58:39,631 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 14:58:39,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 14:58:39,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 14:58:39,631 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 14:58:39,632 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 14:58:39,632 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 92269a31b3f4041d2f8501c63b7af13f5ed1a7b5 [2020-12-02 14:58:40,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 14:58:40,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 14:58:40,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 14:58:40,088 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 14:58:40,089 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 14:58:40,090 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/zonotope_tight.c [2020-12-02 14:58:40,169 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d9d2ec6c/402d6974f80e4cc092a62491f4c76a6d/FLAG0bf5f438a [2020-12-02 14:58:40,781 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 14:58:40,782 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/zonotope_tight.c [2020-12-02 14:58:40,790 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d9d2ec6c/402d6974f80e4cc092a62491f4c76a6d/FLAG0bf5f438a [2020-12-02 14:58:41,174 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d9d2ec6c/402d6974f80e4cc092a62491f4c76a6d [2020-12-02 14:58:41,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 14:58:41,186 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 14:58:41,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 14:58:41,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 14:58:41,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 14:58:41,197 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:58:41" (1/1) ... [2020-12-02 14:58:41,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@781cefce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:41, skipping insertion in model container [2020-12-02 14:58:41,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:58:41" (1/1) ... [2020-12-02 14:58:41,213 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 14:58:41,233 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-12-02 14:58:41,439 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/zonotope_tight.c[577,590] [2020-12-02 14:58:41,452 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 14:58:41,463 INFO L212 MainTranslator]: Completed pre-run [2020-12-02 14:58:41,475 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/zonotope_tight.c[577,590] [2020-12-02 14:58:41,479 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 14:58:41,496 INFO L217 MainTranslator]: Completed translation [2020-12-02 14:58:41,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:41 WrapperNode [2020-12-02 14:58:41,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 14:58:41,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 14:58:41,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 14:58:41,498 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 14:58:41,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:41" (1/1) ... [2020-12-02 14:58:41,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:41" (1/1) ... [2020-12-02 14:58:41,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 14:58:41,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 14:58:41,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 14:58:41,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 14:58:41,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:41" (1/1) ... [2020-12-02 14:58:41,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:41" (1/1) ... [2020-12-02 14:58:41,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:41" (1/1) ... [2020-12-02 14:58:41,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:41" (1/1) ... [2020-12-02 14:58:41,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:41" (1/1) ... [2020-12-02 14:58:41,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:41" (1/1) ... [2020-12-02 14:58:41,557 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:41" (1/1) ... [2020-12-02 14:58:41,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 14:58:41,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 14:58:41,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 14:58:41,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 14:58:41,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 14:58:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-02 14:58:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 14:58:41,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 14:58:41,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 14:58:41,906 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 14:58:41,907 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-12-02 14:58:41,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:58:41 BoogieIcfgContainer [2020-12-02 14:58:41,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 14:58:41,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 14:58:41,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 14:58:41,915 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 14:58:41,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:58:41" (1/3) ... [2020-12-02 14:58:41,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2766c8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:58:41, skipping insertion in model container [2020-12-02 14:58:41,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:41" (2/3) ... [2020-12-02 14:58:41,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2766c8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:58:41, skipping insertion in model container [2020-12-02 14:58:41,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:58:41" (3/3) ... [2020-12-02 14:58:41,920 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_tight.c [2020-12-02 14:58:41,937 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 14:58:41,942 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-02 14:58:41,956 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-02 14:58:41,990 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 14:58:41,991 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 14:58:41,991 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 14:58:41,992 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 14:58:41,992 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 14:58:41,992 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 14:58:41,993 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 14:58:41,993 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 14:58:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2020-12-02 14:58:42,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-02 14:58:42,018 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:58:42,019 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:58:42,020 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:58:42,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:58:42,029 INFO L82 PathProgramCache]: Analyzing trace with hash 119383821, now seen corresponding path program 1 times [2020-12-02 14:58:42,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 14:58:42,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657737644] [2020-12-02 14:58:42,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 14:58:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 14:58:42,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:58:42,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657737644] [2020-12-02 14:58:42,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 14:58:42,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 14:58:42,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394763547] [2020-12-02 14:58:42,344 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-02 14:58:42,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 14:58:42,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-02 14:58:42,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-02 14:58:42,375 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2020-12-02 14:58:42,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 14:58:42,396 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-12-02 14:58:42,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-02 14:58:42,399 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2020-12-02 14:58:42,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 14:58:42,419 INFO L225 Difference]: With dead ends: 23 [2020-12-02 14:58:42,419 INFO L226 Difference]: Without dead ends: 9 [2020-12-02 14:58:42,434 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-02 14:58:42,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-12-02 14:58:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-12-02 14:58:42,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-12-02 14:58:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2020-12-02 14:58:42,483 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 8 [2020-12-02 14:58:42,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 14:58:42,485 INFO L481 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2020-12-02 14:58:42,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-02 14:58:42,486 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-12-02 14:58:42,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-12-02 14:58:42,486 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:58:42,487 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:58:42,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-02 14:58:42,487 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:58:42,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:58:42,495 INFO L82 PathProgramCache]: Analyzing trace with hash 176642123, now seen corresponding path program 1 times [2020-12-02 14:58:42,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 14:58:42,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25947097] [2020-12-02 14:58:42,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 14:58:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 14:58:42,562 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 14:58:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 14:58:42,616 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 14:58:42,654 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-02 14:58:42,654 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 14:58:42,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-02 14:58:42,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:58:42 BoogieIcfgContainer [2020-12-02 14:58:42,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 14:58:42,698 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 14:58:42,699 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 14:58:42,699 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 14:58:42,699 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:58:41" (3/4) ... [2020-12-02 14:58:42,703 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-02 14:58:42,703 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 14:58:42,708 INFO L168 Benchmark]: Toolchain (without parser) took 1519.74 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 23.0 MB in the beginning and 28.0 MB in the end (delta: -5.0 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. [2020-12-02 14:58:42,710 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 46.1 MB. Free memory was 29.1 MB in the beginning and 29.0 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 14:58:42,712 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.98 ms. Allocated memory is still 46.1 MB. Free memory was 22.8 MB in the beginning and 28.2 MB in the end (delta: -5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2020-12-02 14:58:42,714 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.02 ms. Allocated memory is still 46.1 MB. Free memory was 28.2 MB in the beginning and 26.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 14:58:42,715 INFO L168 Benchmark]: Boogie Preprocessor took 22.67 ms. Allocated memory is still 46.1 MB. Free memory was 26.7 MB in the beginning and 25.7 MB in the end (delta: 988.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 14:58:42,717 INFO L168 Benchmark]: RCFGBuilder took 348.94 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 25.7 MB in the beginning and 34.5 MB in the end (delta: -8.8 MB). Peak memory consumption was 9.5 MB. Max. memory is 16.1 GB. [2020-12-02 14:58:42,719 INFO L168 Benchmark]: TraceAbstraction took 786.83 ms. Allocated memory is still 56.6 MB. Free memory was 34.1 MB in the beginning and 28.5 MB in the end (delta: 5.6 MB). Peak memory consumption was 4.7 MB. Max. memory is 16.1 GB. [2020-12-02 14:58:42,720 INFO L168 Benchmark]: Witness Printer took 5.07 ms. Allocated memory is still 56.6 MB. Free memory was 28.3 MB in the beginning and 28.0 MB in the end (delta: 256.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 14:58:42,737 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.33 ms. Allocated memory is still 46.1 MB. Free memory was 29.1 MB in the beginning and 29.0 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 306.98 ms. Allocated memory is still 46.1 MB. Free memory was 22.8 MB in the beginning and 28.2 MB in the end (delta: -5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 38.02 ms. Allocated memory is still 46.1 MB. Free memory was 28.2 MB in the beginning and 26.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 22.67 ms. Allocated memory is still 46.1 MB. Free memory was 26.7 MB in the beginning and 25.7 MB in the end (delta: 988.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 348.94 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 25.7 MB in the beginning and 34.5 MB in the end (delta: -8.8 MB). Peak memory consumption was 9.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 786.83 ms. Allocated memory is still 56.6 MB. Free memory was 34.1 MB in the beginning and 28.5 MB in the end (delta: 5.6 MB). Peak memory consumption was 4.7 MB. Max. memory is 16.1 GB. * Witness Printer took 5.07 ms. Allocated memory is still 56.6 MB. Free memory was 28.3 MB in the beginning and 28.0 MB in the end (delta: 256.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 14]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLE_SMToperation at line 24, overapproximation of someBinaryDOUBLE_SMTComparisonOperation at line 27. Possible FailurePath: [L18] double x,y; [L20] x = __VERIFIER_nondet_double() [L12] COND FALSE !(!cond) [L23] y = x*x - x [L24] COND TRUE y >= 0 [L24] y = x / 10. [L14] COND TRUE !(cond) [L14] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 13 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred 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: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 49 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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-2880296 [2020-12-02 14:58:45,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 14:58:45,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 14:58:45,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 14:58:45,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 14:58:45,539 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 14:58:45,541 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 14:58:45,544 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 14:58:45,546 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 14:58:45,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 14:58:45,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 14:58:45,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 14:58:45,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 14:58:45,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 14:58:45,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 14:58:45,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 14:58:45,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 14:58:45,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 14:58:45,562 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 14:58:45,564 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 14:58:45,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 14:58:45,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 14:58:45,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 14:58:45,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 14:58:45,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 14:58:45,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 14:58:45,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 14:58:45,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 14:58:45,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 14:58:45,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 14:58:45,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 14:58:45,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 14:58:45,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 14:58:45,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 14:58:45,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 14:58:45,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 14:58:45,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 14:58:45,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 14:58:45,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 14:58:45,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 14:58:45,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 14:58:45,602 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-12-02 14:58:45,638 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 14:58:45,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 14:58:45,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 14:58:45,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 14:58:45,640 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 14:58:45,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 14:58:45,641 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 14:58:45,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 14:58:45,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 14:58:45,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 14:58:45,642 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 14:58:45,642 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 14:58:45,642 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-02 14:58:45,642 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-02 14:58:45,642 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 14:58:45,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 14:58:45,643 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 14:58:45,643 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 14:58:45,643 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 14:58:45,643 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 14:58:45,643 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 14:58:45,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 14:58:45,644 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 14:58:45,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 14:58:45,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 14:58:45,644 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 14:58:45,645 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-12-02 14:58:45,645 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-12-02 14:58:45,645 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 14:58:45,645 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 14:58:45,645 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-02 14:58:45,646 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 92269a31b3f4041d2f8501c63b7af13f5ed1a7b5 [2020-12-02 14:58:46,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 14:58:46,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 14:58:46,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 14:58:46,167 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 14:58:46,168 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 14:58:46,170 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/zonotope_tight.c [2020-12-02 14:58:46,250 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c92fe235/f57b35ca86544a7eb85555d5400f2102/FLAG1e05c968f [2020-12-02 14:58:46,888 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 14:58:46,889 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/zonotope_tight.c [2020-12-02 14:58:46,898 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c92fe235/f57b35ca86544a7eb85555d5400f2102/FLAG1e05c968f [2020-12-02 14:58:47,283 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c92fe235/f57b35ca86544a7eb85555d5400f2102 [2020-12-02 14:58:47,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 14:58:47,293 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 14:58:47,296 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 14:58:47,297 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 14:58:47,301 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 14:58:47,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:58:47" (1/1) ... [2020-12-02 14:58:47,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64cd1c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:47, skipping insertion in model container [2020-12-02 14:58:47,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:58:47" (1/1) ... [2020-12-02 14:58:47,336 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 14:58:47,354 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-12-02 14:58:47,560 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/zonotope_tight.c[577,590] [2020-12-02 14:58:47,578 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 14:58:47,598 INFO L212 MainTranslator]: Completed pre-run [2020-12-02 14:58:47,614 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/zonotope_tight.c[577,590] [2020-12-02 14:58:47,620 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 14:58:47,642 INFO L217 MainTranslator]: Completed translation [2020-12-02 14:58:47,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:47 WrapperNode [2020-12-02 14:58:47,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 14:58:47,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 14:58:47,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 14:58:47,645 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 14:58:47,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:47" (1/1) ... [2020-12-02 14:58:47,666 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:47" (1/1) ... [2020-12-02 14:58:47,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 14:58:47,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 14:58:47,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 14:58:47,695 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 14:58:47,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:47" (1/1) ... [2020-12-02 14:58:47,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:47" (1/1) ... [2020-12-02 14:58:47,709 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:47" (1/1) ... [2020-12-02 14:58:47,710 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:47" (1/1) ... [2020-12-02 14:58:47,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:47" (1/1) ... [2020-12-02 14:58:47,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:47" (1/1) ... [2020-12-02 14:58:47,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:47" (1/1) ... [2020-12-02 14:58:47,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 14:58:47,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 14:58:47,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 14:58:47,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 14:58:47,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 14:58:47,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.float_to_bitvec_DOUBLE [2020-12-02 14:58:47,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-02 14:58:47,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 14:58:47,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 14:58:47,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 14:58:54,466 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 14:58:54,467 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-12-02 14:58:54,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:58:54 BoogieIcfgContainer [2020-12-02 14:58:54,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 14:58:54,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 14:58:54,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 14:58:54,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 14:58:54,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:58:47" (1/3) ... [2020-12-02 14:58:54,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d818cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:58:54, skipping insertion in model container [2020-12-02 14:58:54,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:58:47" (2/3) ... [2020-12-02 14:58:54,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d818cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:58:54, skipping insertion in model container [2020-12-02 14:58:54,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:58:54" (3/3) ... [2020-12-02 14:58:54,491 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_tight.c [2020-12-02 14:58:54,505 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 14:58:54,509 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-02 14:58:54,519 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-02 14:58:54,551 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 14:58:54,551 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 14:58:54,551 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 14:58:54,552 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 14:58:54,552 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 14:58:54,552 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 14:58:54,558 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 14:58:54,559 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 14:58:54,572 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-12-02 14:58:54,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-02 14:58:54,577 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:58:54,577 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:58:54,578 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:58:54,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:58:54,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1657916917, now seen corresponding path program 1 times [2020-12-02 14:58:54,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:58:54,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002197812] [2020-12-02 14:58:54,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-02 14:58:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 14:58:55,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2020-12-02 14:58:55,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:58:55,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:58:55,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 14:58:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:58:55,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002197812] [2020-12-02 14:58:55,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 14:58:55,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-12-02 14:58:55,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250153131] [2020-12-02 14:58:55,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-02 14:58:55,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 14:58:55,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-02 14:58:55,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-02 14:58:55,884 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2020-12-02 14:58:55,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 14:58:55,904 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2020-12-02 14:58:55,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-02 14:58:55,906 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-12-02 14:58:55,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 14:58:55,915 INFO L225 Difference]: With dead ends: 29 [2020-12-02 14:58:55,916 INFO L226 Difference]: Without dead ends: 13 [2020-12-02 14:58:55,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-02 14:58:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-12-02 14:58:55,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-12-02 14:58:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-12-02 14:58:55,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2020-12-02 14:58:55,957 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 12 [2020-12-02 14:58:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 14:58:55,957 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-12-02 14:58:55,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-02 14:58:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-12-02 14:58:55,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-02 14:58:55,959 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:58:55,959 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:58:56,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-02 14:58:56,174 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:58:56,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:58:56,176 INFO L82 PathProgramCache]: Analyzing trace with hash 848570291, now seen corresponding path program 1 times [2020-12-02 14:58:56,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:58:56,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070061174] [2020-12-02 14:58:56,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-02 14:58:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 14:58:57,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-02 14:58:57,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:58:57,634 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:58:57,841 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2020-12-02 14:58:57,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:58:58,102 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-12-02 14:59:00,474 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse3 ((_ to_fp 11 53) c_~CRM 10.0)) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|)))) (and (fp.leq .cse0 .cse1) (= .cse2 .cse3) (= .cse1 .cse3) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) (fp.div c_~CRM .cse0 .cse2))))) (= roundNearestTiesToEven c_~CRM)) is different from false [2020-12-02 14:59:00,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:59:02,714 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse7 ((_ to_fp 11 53) c_~CRM 10.0)) (.cse4 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|)))) (and (fp.leq .cse4 .cse5) (= .cse6 .cse7) (= .cse5 .cse7) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) (fp.div c_~CRM .cse4 .cse6)))))) (.cse1 (= roundNearestTiesToEven c_~CRM))) (or (and (not |c_ULTIMATE.start_main_#t~short20|) .cse0 .cse1 (exists ((|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (= (_ +zero 11 53) .cse2) (not (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) .cse2)))))) (and .cse0 (exists ((|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) .cse3) (= (_ +zero 11 53) .cse3)))) .cse1 |c_ULTIMATE.start_main_#t~short20|))) is different from false [2020-12-02 14:59:02,741 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:59:02,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 14:59:02,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-12-02 14:59:13,558 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse5 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (.cse1 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1)))) (and (fp.leq .cse0 .cse1) (= (fp.div roundNearestTiesToEven .cse0 .cse2) .cse3) (fp.leq .cse3 .cse4) (fp.geq .cse3 .cse5) (= .cse6 .cse2) (= (_ +zero 11 53) .cse5) (= .cse4 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= .cse6 .cse1)))) |c_ULTIMATE.start_main_#t~short20|) (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse10 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse11 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|))) (.cse13 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse12 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (.cse8 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1)))) (and (fp.leq .cse7 .cse8) (= (fp.div roundNearestTiesToEven .cse7 .cse9) .cse10) (fp.geq .cse10 .cse11) (= .cse12 .cse9) (not (fp.leq .cse10 .cse13)) (= (_ +zero 11 53) .cse11) (= .cse13 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= .cse12 .cse8)))))) is different from false [2020-12-02 14:59:15,641 WARN L860 $PredicateComparison]: unable to prove that (or (and (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse5 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (.cse1 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1)))) (and (fp.leq .cse0 .cse1) (= (fp.div roundNearestTiesToEven .cse0 .cse2) .cse3) (fp.leq .cse3 .cse4) (fp.geq .cse3 .cse5) (= .cse6 .cse2) (= (_ +zero 11 53) .cse5) (= .cse4 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= .cse6 .cse1)))) |c_ULTIMATE.start_main_#t~short20|) (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse10 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse11 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|))) (.cse13 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse12 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (.cse8 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1)))) (and (fp.leq .cse7 .cse8) (= (fp.div roundNearestTiesToEven .cse7 .cse9) .cse10) (fp.geq .cse10 .cse11) (= .cse12 .cse9) (not (fp.leq .cse10 .cse13)) (= (_ +zero 11 53) .cse11) (= .cse13 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= .cse12 .cse8)))))) is different from true [2020-12-02 14:59:15,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:59:31,522 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|))) (.cse6 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (.cse1 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1)))) (and (fp.leq .cse0 .cse1) (= (fp.div roundNearestTiesToEven .cse0 .cse2) .cse3) (fp.geq .cse3 .cse4) (= .cse5 .cse2) (not (fp.leq .cse3 .cse6)) (= (_ +zero 11 53) .cse4) (= .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= .cse5 .cse1)))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_6 (_ BitVec 64)) (v_prenex_7 (_ BitVec 64)) (v_prenex_4 (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_prenex_2 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5))) (.cse9 (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7))) (.cse11 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (.cse12 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4))) (.cse13 (fp ((_ extract 63 63) v_prenex_2) ((_ extract 62 52) v_prenex_2) ((_ extract 51 0) v_prenex_2))) (.cse7 (fp ((_ extract 63 63) v_prenex_6) ((_ extract 62 52) v_prenex_6) ((_ extract 51 0) v_prenex_6)))) (and (fp.geq .cse7 .cse8) (= (_ +zero 11 53) .cse8) (fp.leq .cse7 .cse9) (= .cse10 .cse11) (= ((_ to_fp 11 53) roundNearestTiesToEven 4.0) .cse9) (fp.leq .cse12 .cse11) (= .cse10 .cse13) (= (fp.div roundNearestTiesToEven .cse12 .cse13) .cse7)))))) is different from false [2020-12-02 14:59:38,007 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|))) (.cse6 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (.cse1 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1)))) (and (fp.leq .cse0 .cse1) (= (fp.div roundNearestTiesToEven .cse0 .cse2) .cse3) (fp.geq .cse3 .cse4) (= .cse5 .cse2) (not (fp.leq .cse3 .cse6)) (= (_ +zero 11 53) .cse4) (= .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= .cse5 .cse1)))) is different from false [2020-12-02 14:59:40,093 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|))) (.cse6 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (.cse1 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1)))) (and (fp.leq .cse0 .cse1) (= (fp.div roundNearestTiesToEven .cse0 .cse2) .cse3) (fp.geq .cse3 .cse4) (= .cse5 .cse2) (not (fp.leq .cse3 .cse6)) (= (_ +zero 11 53) .cse4) (= .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= .cse5 .cse1)))) is different from true [2020-12-02 14:59:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:59:40,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 14:59:43,066 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_13))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|)))) (or (not (= (_ +zero 11 53) .cse0)) (not (fp.geq .cse1 .cse0)) (not (= .cse1 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse2))) (not (= ((_ to_fp 11 53) c_~CRM 4.0) .cse3)) (fp.leq .cse1 .cse3) (not (= .cse2 ((_ to_fp 11 53) c_~CRM 10.0)))))) is different from true [2020-12-02 14:59:45,330 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_13))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|)))) (or (not (= (_ +zero 11 53) .cse0)) (not (fp.geq .cse1 .cse0)) (not (= .cse1 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse2))) (not (= ((_ to_fp 11 53) c_~CRM 4.0) .cse3)) (fp.leq .cse1 .cse3) (not (= .cse2 ((_ to_fp 11 53) c_~CRM 10.0)))))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from true [2020-12-02 14:59:45,372 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-02 14:59:45,373 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 14:59:47,645 WARN L860 $PredicateComparison]: unable to prove that (or (not |c_ULTIMATE.start_main_#t~short10|) (forall ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_13))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|)))) (or (not (= (_ +zero 11 53) .cse0)) (not (fp.geq .cse1 .cse0)) (not (= .cse1 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse2))) (not (= ((_ to_fp 11 53) c_~CRM 4.0) .cse3)) (fp.leq .cse1 .cse3) (not (= .cse2 ((_ to_fp 11 53) c_~CRM 10.0))))))) is different from true [2020-12-02 14:59:49,750 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet9_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_13))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse6 ((_ to_fp 11 53) c_~CRM 10.0)) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_6|)))) (or (not (= (_ +zero 11 53) .cse0)) (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse3 .cse0)) (not (= .cse3 (fp.div c_~CRM .cse1 .cse4))) (not (= ((_ to_fp 11 53) c_~CRM 4.0) .cse5)) (fp.leq .cse3 .cse5) (not (= .cse4 .cse6)) (not (= .cse6 .cse2))))) is different from false [2020-12-02 14:59:51,968 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet9_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_13))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse6 ((_ to_fp 11 53) c_~CRM 10.0)) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_6|)))) (or (not (= (_ +zero 11 53) .cse0)) (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse3 .cse0)) (not (= .cse3 (fp.div c_~CRM .cse1 .cse4))) (not (= ((_ to_fp 11 53) c_~CRM 4.0) .cse5)) (fp.leq .cse3 .cse5) (not (= .cse4 .cse6)) (not (= .cse6 .cse2))))) is different from true [2020-12-02 14:59:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:59:51,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1070061174] [2020-12-02 14:59:51,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 14:59:51,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2020-12-02 14:59:51,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980810974] [2020-12-02 14:59:51,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-02 14:59:51,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 14:59:51,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-02 14:59:51,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=76, Unknown=12, NotChecked=216, Total=342 [2020-12-02 14:59:51,993 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 19 states. [2020-12-02 14:59:54,197 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet9_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_13))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse6 ((_ to_fp 11 53) c_~CRM 10.0)) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_6|)))) (or (not (= (_ +zero 11 53) .cse0)) (not (fp.leq .cse1 .cse2)) (not (fp.geq .cse3 .cse0)) (not (= .cse3 (fp.div c_~CRM .cse1 .cse4))) (not (= ((_ to_fp 11 53) c_~CRM 4.0) .cse5)) (fp.leq .cse3 .cse5) (not (= .cse4 .cse6)) (not (= .cse6 .cse2))))) (= roundNearestTiesToEven c_~CRM)) is different from false [2020-12-02 14:59:56,941 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not |c_ULTIMATE.start_main_#t~short10|))) (and (or .cse0 (forall ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_13) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_13) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_13))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|)))) (or (not (= (_ +zero 11 53) .cse1)) (not (fp.geq .cse2 .cse1)) (not (= .cse2 (fp.div c_~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse3))) (not (= ((_ to_fp 11 53) c_~CRM 4.0) .cse4)) (fp.leq .cse2 .cse4) (not (= .cse3 ((_ to_fp 11 53) c_~CRM 10.0))))))) (let ((.cse6 (= roundNearestTiesToEven c_~CRM))) (or (and (exists ((|ULTIMATE.start_main_#t~nondet9| (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet9|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet9|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet9|)))) (and (= ((_ to_fp 11 53) c_~CRM 10.0) .cse5) (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse5)))) .cse6 |c_ULTIMATE.start_main_#t~short10|) (and .cse6 .cse0 (exists ((|ULTIMATE.start_main_#t~nondet9| (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet9|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet9|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet9|)))) (and (= ((_ to_fp 11 53) c_~CRM 10.0) .cse7) (not (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse7)))))))))) is different from true [2020-12-02 15:00:12,098 WARN L197 SmtUtils]: Spent 12.74 s on a formula simplification that was a NOOP. DAG size: 76 [2020-12-02 15:00:22,457 WARN L197 SmtUtils]: Spent 10.06 s on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2020-12-02 15:00:38,193 WARN L197 SmtUtils]: Spent 7.21 s on a formula simplification that was a NOOP. DAG size: 57 [2020-12-02 15:00:43,003 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse3 ((_ to_fp 11 53) c_~CRM 10.0)) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|)))) (and (fp.leq .cse0 .cse1) (= .cse2 .cse3) (= .cse1 .cse3) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) (fp.div c_~CRM .cse0 .cse2))))) (= roundNearestTiesToEven c_~CRM) (or (forall ((|v_ULTIMATE.start_main_#t~nondet18_5| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_5|)))) (or (not (= (_ +zero 11 53) .cse4)) (not (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) .cse4))))) (forall ((|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|)))) (or (not (= ((_ to_fp 11 53) c_~CRM 4.0) .cse5)) (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) .cse5)))))) is different from false [2020-12-02 15:00:47,390 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (not |c_ULTIMATE.start_main_#t~short20|))) (and (or .cse0 (forall ((|v_ULTIMATE.start_main_#t~nondet19_5| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_5|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_5|)))) (or (not (= ((_ to_fp 11 53) c_~CRM 4.0) .cse1)) (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) .cse1))))) (let ((.cse2 (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse9 ((_ to_fp 11 53) c_~CRM 10.0)) (.cse6 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse8 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|)))) (and (fp.leq .cse6 .cse7) (= .cse8 .cse9) (= .cse7 .cse9) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) (fp.div c_~CRM .cse6 .cse8)))))) (.cse3 (= roundNearestTiesToEven c_~CRM))) (or (and .cse0 .cse2 .cse3 (exists ((|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (= (_ +zero 11 53) .cse4) (not (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) .cse4)))))) (and .cse2 (exists ((|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) .cse5) (= (_ +zero 11 53) .cse5)))) .cse3 |c_ULTIMATE.start_main_#t~short20|))))) is different from false [2020-12-02 15:00:49,663 WARN L838 $PredicateComparison]: unable to prove that (and |c_ULTIMATE.start_main_#t~short20| (or (and (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse5 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (.cse1 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1)))) (and (fp.leq .cse0 .cse1) (= (fp.div roundNearestTiesToEven .cse0 .cse2) .cse3) (fp.leq .cse3 .cse4) (fp.geq .cse3 .cse5) (= .cse6 .cse2) (= (_ +zero 11 53) .cse5) (= .cse4 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= .cse6 .cse1)))) |c_ULTIMATE.start_main_#t~short20|) (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse10 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse11 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|))) (.cse13 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse12 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (.cse8 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1)))) (and (fp.leq .cse7 .cse8) (= (fp.div roundNearestTiesToEven .cse7 .cse9) .cse10) (fp.geq .cse10 .cse11) (= .cse12 .cse9) (not (fp.leq .cse10 .cse13)) (= (_ +zero 11 53) .cse11) (= .cse13 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= .cse12 .cse8))))))) is different from false [2020-12-02 15:00:51,913 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (not .cse0) (or (and (exists ((|v_ULTIMATE.start_main_#t~nondet13_6| (_ BitVec 64)) (v_prenex_1 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_6|))) (.cse4 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse5 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|))) (.cse7 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (.cse2 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1)))) (and (fp.leq .cse1 .cse2) (= (fp.div roundNearestTiesToEven .cse1 .cse3) .cse4) (fp.geq .cse4 .cse5) (= .cse6 .cse3) (not (fp.leq .cse4 .cse7)) (= (_ +zero 11 53) .cse5) (= .cse7 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= .cse6 .cse2)))) .cse0) (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_6 (_ BitVec 64)) (v_prenex_7 (_ BitVec 64)) (v_prenex_4 (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_prenex_2 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64))) (let ((.cse9 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5))) (.cse10 (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7))) (.cse12 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse11 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (.cse13 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4))) (.cse14 (fp ((_ extract 63 63) v_prenex_2) ((_ extract 62 52) v_prenex_2) ((_ extract 51 0) v_prenex_2))) (.cse8 (fp ((_ extract 63 63) v_prenex_6) ((_ extract 62 52) v_prenex_6) ((_ extract 51 0) v_prenex_6)))) (and (fp.geq .cse8 .cse9) (= (_ +zero 11 53) .cse9) (fp.leq .cse8 .cse10) (= .cse11 .cse12) (= ((_ to_fp 11 53) roundNearestTiesToEven 4.0) .cse10) (fp.leq .cse13 .cse12) (= .cse11 .cse14) (= (fp.div roundNearestTiesToEven .cse13 .cse14) .cse8)))))))) is different from false [2020-12-02 15:00:52,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 15:00:52,009 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-12-02 15:00:52,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-02 15:00:52,010 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 12 [2020-12-02 15:00:52,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 15:00:52,011 INFO L225 Difference]: With dead ends: 27 [2020-12-02 15:00:52,011 INFO L226 Difference]: Without dead ends: 23 [2020-12-02 15:00:52,012 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 81.5s TimeCoverageRelationStatistics Valid=65, Invalid=130, Unknown=21, NotChecked=540, Total=756 [2020-12-02 15:00:52,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-12-02 15:00:52,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2020-12-02 15:00:52,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-12-02 15:00:52,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2020-12-02 15:00:52,018 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2020-12-02 15:00:52,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 15:00:52,018 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2020-12-02 15:00:52,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-02 15:00:52,019 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2020-12-02 15:00:52,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-02 15:00:52,020 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:00:52,020 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:00:52,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-02 15:00:52,221 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:00:52,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:00:52,222 INFO L82 PathProgramCache]: Analyzing trace with hash 848629873, now seen corresponding path program 1 times [2020-12-02 15:00:52,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 15:00:52,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287424071] [2020-12-02 15:00:52,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-02 15:00:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:00:53,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 12 conjunts are in the unsatisfiable core [2020-12-02 15:00:53,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 15:00:53,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 15:00:53,617 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2020-12-02 15:00:54,050 WARN L197 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-12-02 15:00:54,311 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2020-12-02 15:00:56,552 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 64)) (~CRM RoundingMode) (|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|)))) (and (fp.geq .cse0 .cse1) (= (_ +zero 11 53) .cse1) (= (fp.div ~CRM .cse0 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0))) (= .cse2 ((_ to_fp 11 53) ~CRM 10.0))))) is different from false [2020-12-02 15:00:58,844 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 64)) (~CRM RoundingMode) (|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|)))) (and (fp.geq .cse0 .cse1) (= (_ +zero 11 53) .cse1) (= (fp.div ~CRM .cse0 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0))) (= .cse2 ((_ to_fp 11 53) ~CRM 10.0))))) is different from true [2020-12-02 15:00:58,849 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 15:00:58,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 15:00:58,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-02 15:01:10,450 WARN L838 $PredicateComparison]: unable to prove that (or (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (~CRM RoundingMode) (|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (fp.geq .cse0 .cse1) (= (_ +zero 11 53) .cse1) (= (fp.div ~CRM .cse0 .cse2) .cse3) (= .cse2 ((_ to_fp 11 53) ~CRM 10.0)) (= (_ +zero 11 53) .cse4) (not (fp.geq .cse3 .cse4)))))) (and |c_ULTIMATE.start_main_#t~short20| (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (~CRM RoundingMode) (|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|))) (.cse5 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse8 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse9 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (fp.geq .cse5 .cse6) (= (_ +zero 11 53) .cse6) (= (fp.div ~CRM .cse5 .cse7) .cse8) (fp.geq .cse8 .cse9) (= .cse7 ((_ to_fp 11 53) ~CRM 10.0)) (= (_ +zero 11 53) .cse9)))))) is different from false [2020-12-02 15:01:12,552 WARN L860 $PredicateComparison]: unable to prove that (or (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (~CRM RoundingMode) (|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (fp.geq .cse0 .cse1) (= (_ +zero 11 53) .cse1) (= (fp.div ~CRM .cse0 .cse2) .cse3) (= .cse2 ((_ to_fp 11 53) ~CRM 10.0)) (= (_ +zero 11 53) .cse4) (not (fp.geq .cse3 .cse4)))))) (and |c_ULTIMATE.start_main_#t~short20| (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (~CRM RoundingMode) (|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|))) (.cse5 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse8 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse9 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (fp.geq .cse5 .cse6) (= (_ +zero 11 53) .cse6) (= (fp.div ~CRM .cse5 .cse7) .cse8) (fp.geq .cse8 .cse9) (= .cse7 ((_ to_fp 11 53) ~CRM 10.0)) (= (_ +zero 11 53) .cse9)))))) is different from true [2020-12-02 15:01:19,051 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (~CRM RoundingMode) (|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (fp.geq .cse0 .cse1) (= (_ +zero 11 53) .cse1) (= (fp.div ~CRM .cse0 .cse2) .cse3) (= .cse2 ((_ to_fp 11 53) ~CRM 10.0)) (= (_ +zero 11 53) .cse4) (not (fp.geq .cse3 .cse4))))) is different from false [2020-12-02 15:01:21,141 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (~CRM RoundingMode) (|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (fp.geq .cse0 .cse1) (= (_ +zero 11 53) .cse1) (= (fp.div ~CRM .cse0 .cse2) .cse3) (= .cse2 ((_ to_fp 11 53) ~CRM 10.0)) (= (_ +zero 11 53) .cse4) (not (fp.geq .cse3 .cse4))))) is different from true [2020-12-02 15:01:29,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:01:29,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 15:01:32,500 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~y~0_16 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_7| (_ BitVec 64)) (~CRM RoundingMode) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_16))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_7|)))) (or (not (= (fp.div ~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse0) .cse1)) (not (= .cse0 ((_ to_fp 11 53) ~CRM 10.0))) (not (= (_ +zero 11 53) .cse2)) (fp.geq .cse1 .cse2)))) is different from true [2020-12-02 15:01:34,778 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_main_~y~0_16 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_7| (_ BitVec 64)) (~CRM RoundingMode) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_16))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_7|)))) (or (not (= (fp.div ~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse0) .cse1)) (not (= .cse0 ((_ to_fp 11 53) ~CRM 10.0))) (not (= (_ +zero 11 53) .cse2)) (fp.geq .cse1 .cse2)))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from true [2020-12-02 15:01:34,789 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-02 15:01:34,789 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 15:01:37,033 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_main_~y~0_16 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_7| (_ BitVec 64)) (~CRM RoundingMode) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_16))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_7|)))) (or (not (= (fp.div ~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse0) .cse1)) (not (= .cse0 ((_ to_fp 11 53) ~CRM 10.0))) (not (= (_ +zero 11 53) .cse2)) (fp.geq .cse1 .cse2)))) (not |c_ULTIMATE.start_main_#t~short10|)) is different from true [2020-12-02 15:01:39,295 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet9_9| (_ BitVec 64))) (not (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_9|))))) (forall ((v_ULTIMATE.start_main_~y~0_16 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_7| (_ BitVec 64)) (~CRM RoundingMode) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_16))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_7|)))) (or (not (= (fp.div ~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse0) .cse1)) (not (= .cse0 ((_ to_fp 11 53) ~CRM 10.0))) (not (= (_ +zero 11 53) .cse2)) (fp.geq .cse1 .cse2)))) (not |c_ULTIMATE.start_main_#t~short10|)) is different from true [2020-12-02 15:01:45,649 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_11 (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_16 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_7| (_ BitVec 64)) (~CRM RoundingMode) (|v_ULTIMATE.start_main_#t~nondet9_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_16))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_7|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_9|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_11) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_11) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_11)))) (or (not (= .cse0 ((_ to_fp 11 53) ~CRM 10.0))) (not (= (fp.div ~CRM .cse1 .cse0) .cse2)) (not (= (_ +zero 11 53) .cse3)) (fp.geq .cse2 .cse3) (not (fp.geq .cse1 .cse4)) (not (= (_ +zero 11 53) .cse4)) (not (fp.leq .cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_9|))))))) is different from false [2020-12-02 15:01:47,866 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_11 (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_16 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_7| (_ BitVec 64)) (~CRM RoundingMode) (|v_ULTIMATE.start_main_#t~nondet9_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_16))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_7|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_9|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_11) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_11) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_11)))) (or (not (= .cse0 ((_ to_fp 11 53) ~CRM 10.0))) (not (= (fp.div ~CRM .cse1 .cse0) .cse2)) (not (= (_ +zero 11 53) .cse3)) (fp.geq .cse2 .cse3) (not (fp.geq .cse1 .cse4)) (not (= (_ +zero 11 53) .cse4)) (not (fp.leq .cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_9|))))))) is different from true [2020-12-02 15:01:47,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:01:47,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287424071] [2020-12-02 15:01:47,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:01:47,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 15 [2020-12-02 15:01:47,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990509212] [2020-12-02 15:01:47,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-02 15:01:47,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 15:01:47,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-02 15:01:47,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=34, Unknown=12, NotChecked=136, Total=210 [2020-12-02 15:01:47,872 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 15 states. [2020-12-02 15:02:22,093 WARN L197 SmtUtils]: Spent 30.89 s on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2020-12-02 15:02:24,427 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|)))) (and (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse0) (= (_ +zero 11 53) .cse0)))) (or (forall ((v_ULTIMATE.start_main_~y~0_16 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_7| (_ BitVec 64)) (~CRM RoundingMode) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_16))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_7|)))) (or (not (= (fp.div ~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse1) .cse2)) (not (= .cse1 ((_ to_fp 11 53) ~CRM 10.0))) (not (= (_ +zero 11 53) .cse3)) (fp.geq .cse2 .cse3)))) (not |c_ULTIMATE.start_main_#t~short10|))) is different from true [2020-12-02 15:02:40,948 WARN L197 SmtUtils]: Spent 14.15 s on a formula simplification that was a NOOP. DAG size: 53 [2020-12-02 15:02:43,299 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~y~0_16 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_7| (_ BitVec 64)) (~CRM RoundingMode) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_16))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_7|)))) (or (not (= (fp.div ~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse0) .cse1)) (not (= .cse0 ((_ to_fp 11 53) ~CRM 10.0))) (not (= (_ +zero 11 53) .cse2)) (fp.geq .cse1 .cse2)))) (let ((.cse3 (exists ((|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|)))) (and (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse4) (= (_ +zero 11 53) .cse4)))))) (or (and .cse3 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse3)))) is different from true [2020-12-02 15:02:45,897 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~y~0_16 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_7| (_ BitVec 64)) (~CRM RoundingMode) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_16) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_16) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_16))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_7|)))) (or (not (= (fp.div ~CRM (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse0) .cse1)) (not (= .cse0 ((_ to_fp 11 53) ~CRM 10.0))) (not (= (_ +zero 11 53) .cse2)) (fp.geq .cse1 .cse2)))) (exists ((|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|)))) (and (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse3) (= (_ +zero 11 53) .cse3))))) is different from true [2020-12-02 15:02:50,281 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 64)) (~CRM RoundingMode) (|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|)))) (and (fp.geq .cse0 .cse1) (= (_ +zero 11 53) .cse1) (= (fp.div ~CRM .cse0 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0))) (= .cse2 ((_ to_fp 11 53) ~CRM 10.0))))) (forall ((|v_ULTIMATE.start_main_#t~nondet18_7| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_7|)))) (or (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) .cse3) (not (= (_ +zero 11 53) .cse3)))))) is different from false [2020-12-02 15:03:09,240 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (~CRM RoundingMode) (|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|))) (.cse0 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (fp.geq .cse0 .cse1) (= (_ +zero 11 53) .cse1) (= (fp.div ~CRM .cse0 .cse2) .cse3) (= .cse2 ((_ to_fp 11 53) ~CRM 10.0)) (= (_ +zero 11 53) .cse4) (not (fp.geq .cse3 .cse4)))))) (and |c_ULTIMATE.start_main_#t~short20| (exists ((ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (~CRM RoundingMode) (|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet13_9| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|))) (.cse5 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse8 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet13_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet13_9|))) (.cse9 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (fp.geq .cse5 .cse6) (= (_ +zero 11 53) .cse6) (= (fp.div ~CRM .cse5 .cse7) .cse8) (fp.geq .cse8 .cse9) (= .cse7 ((_ to_fp 11 53) ~CRM 10.0)) (= (_ +zero 11 53) .cse9)))))) |c_ULTIMATE.start_main_#t~short20|) is different from false [2020-12-02 15:03:09,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 15:03:09,337 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-12-02 15:03:09,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-02 15:03:09,338 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2020-12-02 15:03:09,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 15:03:09,339 INFO L225 Difference]: With dead ends: 23 [2020-12-02 15:03:09,339 INFO L226 Difference]: Without dead ends: 17 [2020-12-02 15:03:09,340 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 91.0s TimeCoverageRelationStatistics Valid=45, Invalid=60, Unknown=19, NotChecked=338, Total=462 [2020-12-02 15:03:09,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-12-02 15:03:09,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-12-02 15:03:09,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-12-02 15:03:09,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-12-02 15:03:09,344 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2020-12-02 15:03:09,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 15:03:09,344 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-12-02 15:03:09,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-02 15:03:09,345 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-12-02 15:03:09,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-02 15:03:09,345 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:03:09,346 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:03:09,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-02 15:03:09,553 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:03:09,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:03:09,554 INFO L82 PathProgramCache]: Analyzing trace with hash 905828593, now seen corresponding path program 1 times [2020-12-02 15:03:09,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 15:03:09,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839321072] [2020-12-02 15:03:09,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-02 15:03:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:03:10,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-02 15:03:10,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 15:03:10,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 15:03:10,559 WARN L197 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2020-12-02 15:03:10,567 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 15:03:11,202 WARN L197 SmtUtils]: Spent 522.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-12-02 15:03:11,212 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 15:03:11,822 WARN L197 SmtUtils]: Spent 450.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-12-02 15:03:12,197 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2020-12-02 15:03:14,248 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_9 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9)))) (and (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse0) (= .cse0 (_ +zero 11 53))))) (= roundNearestTiesToEven c_~CRM) (exists ((|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (and (= (fp.mul c_~CRM .cse1 .cse1) .cse2) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) (fp.sub c_~CRM .cse2 .cse1))))) (exists ((v_prenex_10 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10)))) (and (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse3) (= ((_ to_fp 11 53) c_~CRM 10.0) .cse3))))) is different from false [2020-12-02 15:03:16,358 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (v_prenex_9 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (let ((.cse4 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse1 (fp.mul c_~CRM .cse3 .cse3)) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_19))) (.cse7 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10)))) (and (= .cse0 .cse1) (= ((_ to_fp 11 53) c_~CRM 2.0) .cse2) (fp.geq .cse3 .cse4) (= .cse4 (_ +zero 11 53)) (= (fp.add c_~CRM .cse0 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0))) (= .cse1 .cse5) (= .cse6 (fp.sub c_~CRM .cse5 .cse3)) (fp.leq .cse3 .cse7) (not (fp.geq .cse6 ((_ to_fp 11 53) c_~CRM (_ bv0 32)))) (= ((_ to_fp 11 53) c_~CRM 10.0) .cse7)))))) is different from false [2020-12-02 15:03:16,389 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 15:03:16,390 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 15:03:16,392 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2020-12-02 15:03:26,985 WARN L838 $PredicateComparison]: unable to prove that (or (and |c_ULTIMATE.start_main_#t~short20| (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (let ((.cse4 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_19))) (.cse6 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse7 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (.cse8 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse5 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse9 (fp.mul roundNearestTiesToEven .cse3 .cse3)) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse0) (= .cse1 (fp.sub roundNearestTiesToEven .cse2 .cse3)) (fp.geq .cse3 .cse4) (fp.leq .cse5 .cse6) (= .cse4 (_ +zero 11 53)) (not (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.leq .cse3 .cse7) (= .cse8 .cse9) (= .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse7) (= (fp.add roundNearestTiesToEven .cse8 .cse0) .cse5) (= .cse9 .cse2)))))) (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse13 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (let ((.cse14 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse11 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_19))) (.cse17 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse15 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (.cse18 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse10 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse16 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse19 (fp.mul roundNearestTiesToEven .cse13 .cse13)) (.cse12 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse10) (= .cse11 (fp.sub roundNearestTiesToEven .cse12 .cse13)) (fp.geq .cse13 .cse14) (= .cse14 (_ +zero 11 53)) (not (fp.geq .cse11 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.leq .cse13 .cse15) (not (fp.leq .cse16 .cse17)) (= .cse18 .cse19) (= .cse17 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse15) (= (fp.add roundNearestTiesToEven .cse18 .cse10) .cse16) (= .cse19 .cse12))))))) is different from false [2020-12-02 15:03:29,033 WARN L860 $PredicateComparison]: unable to prove that (or (and |c_ULTIMATE.start_main_#t~short20| (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (let ((.cse4 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_19))) (.cse6 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse7 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (.cse8 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse5 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse9 (fp.mul roundNearestTiesToEven .cse3 .cse3)) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse0) (= .cse1 (fp.sub roundNearestTiesToEven .cse2 .cse3)) (fp.geq .cse3 .cse4) (fp.leq .cse5 .cse6) (= .cse4 (_ +zero 11 53)) (not (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.leq .cse3 .cse7) (= .cse8 .cse9) (= .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse7) (= (fp.add roundNearestTiesToEven .cse8 .cse0) .cse5) (= .cse9 .cse2)))))) (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse13 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (let ((.cse14 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse11 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_19))) (.cse17 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse15 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (.cse18 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse10 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse16 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse19 (fp.mul roundNearestTiesToEven .cse13 .cse13)) (.cse12 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse10) (= .cse11 (fp.sub roundNearestTiesToEven .cse12 .cse13)) (fp.geq .cse13 .cse14) (= .cse14 (_ +zero 11 53)) (not (fp.geq .cse11 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.leq .cse13 .cse15) (not (fp.leq .cse16 .cse17)) (= .cse18 .cse19) (= .cse17 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse15) (= (fp.add roundNearestTiesToEven .cse18 .cse10) .cse16) (= .cse19 .cse12))))))) is different from true [2020-12-02 15:03:29,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 15:03:43,511 WARN L838 $PredicateComparison]: unable to prove that (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (let ((.cse4 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_19))) (.cse6 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse7 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (.cse8 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse5 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse9 (fp.mul roundNearestTiesToEven .cse3 .cse3)) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse0) (= .cse1 (fp.sub roundNearestTiesToEven .cse2 .cse3)) (fp.geq .cse3 .cse4) (fp.leq .cse5 .cse6) (= .cse4 (_ +zero 11 53)) (not (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.leq .cse3 .cse7) (= .cse8 .cse9) (= .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse7) (= (fp.add roundNearestTiesToEven .cse8 .cse0) .cse5) (= .cse9 .cse2)))))) (and (exists ((v_prenex_16 (_ BitVec 64)) (v_prenex_15 (_ BitVec 64)) (v_prenex_18 (_ BitVec 64)) (v_prenex_17 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_14 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (v_prenex_19 (_ BitVec 64))) (let ((.cse10 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13)))) (let ((.cse18 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14))) (.cse17 (fp.mul roundNearestTiesToEven .cse10 .cse10)) (.cse12 (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))) (.cse16 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse19 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse11 (fp ((_ extract 63 63) v_prenex_18) ((_ extract 62 52) v_prenex_18) ((_ extract 51 0) v_prenex_18))) (.cse14 (fp ((_ extract 63 63) v_prenex_15) ((_ extract 62 52) v_prenex_15) ((_ extract 51 0) v_prenex_15))) (.cse15 (fp ((_ extract 63 63) v_prenex_16) ((_ extract 62 52) v_prenex_16) ((_ extract 51 0) v_prenex_16))) (.cse13 (fp ((_ extract 63 63) v_prenex_19) ((_ extract 62 52) v_prenex_19) ((_ extract 51 0) v_prenex_19)))) (and (fp.geq .cse10 .cse11) (= (fp.add roundNearestTiesToEven .cse12 .cse13) .cse14) (= ((_ to_fp 11 53) roundNearestTiesToEven 4.0) .cse15) (= .cse16 .cse17) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse18) (not (fp.geq .cse19 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.leq .cse10 .cse18) (= .cse17 .cse12) (= (fp.sub roundNearestTiesToEven .cse16 .cse10) .cse19) (= (_ +zero 11 53) .cse11) (not (fp.leq .cse14 .cse15)) (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse13))))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) is different from false [2020-12-02 15:03:49,709 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_prenex_16 (_ BitVec 64)) (v_prenex_15 (_ BitVec 64)) (v_prenex_18 (_ BitVec 64)) (v_prenex_17 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_14 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (v_prenex_19 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13)))) (let ((.cse8 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14))) (.cse7 (fp.mul roundNearestTiesToEven .cse0 .cse0)) (.cse2 (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))) (.cse6 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse9 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse1 (fp ((_ extract 63 63) v_prenex_18) ((_ extract 62 52) v_prenex_18) ((_ extract 51 0) v_prenex_18))) (.cse4 (fp ((_ extract 63 63) v_prenex_15) ((_ extract 62 52) v_prenex_15) ((_ extract 51 0) v_prenex_15))) (.cse5 (fp ((_ extract 63 63) v_prenex_16) ((_ extract 62 52) v_prenex_16) ((_ extract 51 0) v_prenex_16))) (.cse3 (fp ((_ extract 63 63) v_prenex_19) ((_ extract 62 52) v_prenex_19) ((_ extract 51 0) v_prenex_19)))) (and (fp.geq .cse0 .cse1) (= (fp.add roundNearestTiesToEven .cse2 .cse3) .cse4) (= ((_ to_fp 11 53) roundNearestTiesToEven 4.0) .cse5) (= .cse6 .cse7) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse8) (not (fp.geq .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.leq .cse0 .cse8) (= .cse7 .cse2) (= (fp.sub roundNearestTiesToEven .cse6 .cse0) .cse9) (= (_ +zero 11 53) .cse1) (not (fp.leq .cse4 .cse5)) (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse3))))) is different from false [2020-12-02 15:03:51,755 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_prenex_16 (_ BitVec 64)) (v_prenex_15 (_ BitVec 64)) (v_prenex_18 (_ BitVec 64)) (v_prenex_17 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_14 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (v_prenex_19 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13)))) (let ((.cse8 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14))) (.cse7 (fp.mul roundNearestTiesToEven .cse0 .cse0)) (.cse2 (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))) (.cse6 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse9 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse1 (fp ((_ extract 63 63) v_prenex_18) ((_ extract 62 52) v_prenex_18) ((_ extract 51 0) v_prenex_18))) (.cse4 (fp ((_ extract 63 63) v_prenex_15) ((_ extract 62 52) v_prenex_15) ((_ extract 51 0) v_prenex_15))) (.cse5 (fp ((_ extract 63 63) v_prenex_16) ((_ extract 62 52) v_prenex_16) ((_ extract 51 0) v_prenex_16))) (.cse3 (fp ((_ extract 63 63) v_prenex_19) ((_ extract 62 52) v_prenex_19) ((_ extract 51 0) v_prenex_19)))) (and (fp.geq .cse0 .cse1) (= (fp.add roundNearestTiesToEven .cse2 .cse3) .cse4) (= ((_ to_fp 11 53) roundNearestTiesToEven 4.0) .cse5) (= .cse6 .cse7) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse8) (not (fp.geq .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.leq .cse0 .cse8) (= .cse7 .cse2) (= (fp.sub roundNearestTiesToEven .cse6 .cse0) .cse9) (= (_ +zero 11 53) .cse1) (not (fp.leq .cse4 .cse5)) (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse3))))) is different from true [2020-12-02 15:03:51,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:03:51,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 15:03:54,475 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_20 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_20))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|)))) (or (not (= (fp.add c_~CRM .cse0 .cse1) .cse2)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse1)) (not (= .cse3 ((_ to_fp 11 53) c_~CRM 4.0))) (fp.leq .cse2 .cse3) (not (= .cse0 (let ((.cse4 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (fp.mul c_~CRM .cse4 .cse4))))))) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32)))) is different from true [2020-12-02 15:03:56,561 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_20 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_20))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|)))) (or (not (= (fp.add c_~CRM .cse0 .cse1) .cse2)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse1)) (not (= .cse3 ((_ to_fp 11 53) c_~CRM 4.0))) (fp.leq .cse2 .cse3) (not (= .cse0 (let ((.cse4 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (fp.mul c_~CRM .cse4 .cse4))))))) (forall ((|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_21 (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_21))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse5 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (or (not (= (fp.mul c_~CRM .cse5 .cse5) .cse6)) (fp.geq .cse7 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse7 (fp.sub c_~CRM .cse6 .cse5))))))) is different from true [2020-12-02 15:03:58,643 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_20 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_20))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|)))) (or (not (= (fp.add c_~CRM .cse0 .cse1) .cse2)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse1)) (not (= .cse3 ((_ to_fp 11 53) c_~CRM 4.0))) (fp.leq .cse2 .cse3) (not (= .cse0 (let ((.cse4 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (fp.mul c_~CRM .cse4 .cse4))))))) (forall ((|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_21 (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_21))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse5 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (or (not (= (fp.mul c_~CRM .cse5 .cse5) .cse6)) (fp.geq .cse7 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse7 (fp.sub c_~CRM .cse6 .cse5)))))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from true [2020-12-02 15:03:58,655 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-02 15:03:58,655 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 15:04:00,728 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_20 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_20))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|)))) (or (not (= (fp.add c_~CRM .cse0 .cse1) .cse2)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse1)) (not (= .cse3 ((_ to_fp 11 53) c_~CRM 4.0))) (fp.leq .cse2 .cse3) (not (= .cse0 (let ((.cse4 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (fp.mul c_~CRM .cse4 .cse4))))))) (not |c_ULTIMATE.start_main_#t~short10|) (forall ((|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_21 (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_21))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse5 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (or (not (= (fp.mul c_~CRM .cse5 .cse5) .cse6)) (fp.geq .cse7 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse7 (fp.sub c_~CRM .cse6 .cse5))))))) is different from true [2020-12-02 15:04:02,812 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_20 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_20))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|)))) (or (not (= (fp.add c_~CRM .cse0 .cse1) .cse2)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse1)) (not (= .cse3 ((_ to_fp 11 53) c_~CRM 4.0))) (fp.leq .cse2 .cse3) (not (= .cse0 (let ((.cse4 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (fp.mul c_~CRM .cse4 .cse4))))))) (not |c_ULTIMATE.start_main_#t~short10|) (forall ((|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_21 (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_21))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse5 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (or (not (= (fp.mul c_~CRM .cse5 .cse5) .cse6)) (fp.geq .cse7 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse7 (fp.sub c_~CRM .cse6 .cse5)))))) (forall ((|v_ULTIMATE.start_main_#t~nondet9_12| (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_12|)))) (or (not (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse8)) (not (= ((_ to_fp 11 53) c_~CRM 10.0) .cse8)))))) is different from true [2020-12-02 15:04:04,877 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_12 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet9_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_21 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_20 (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_12) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_12) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_12)))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_20))) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_11|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_12|))) (.cse1 (fp.mul c_~CRM .cse8 .cse8)) (.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_21)))) (or (not (= .cse0 .cse1)) (not (= (fp.add c_~CRM .cse0 .cse2) .cse3)) (not (= (_ +zero 11 53) .cse4)) (not (= ((_ to_fp 11 53) c_~CRM 10.0) .cse5)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse2)) (fp.geq .cse6 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse7 ((_ to_fp 11 53) c_~CRM 4.0))) (fp.leq .cse3 .cse7) (not (fp.geq .cse8 .cse4)) (not (fp.leq .cse8 .cse5)) (not (= .cse1 .cse9)) (not (= (fp.sub c_~CRM .cse9 .cse8) .cse6)))))) is different from false [2020-12-02 15:04:06,935 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_12 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet9_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_21 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_20 (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_12) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_12) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_12)))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_20))) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_11|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_12|))) (.cse1 (fp.mul c_~CRM .cse8 .cse8)) (.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_21)))) (or (not (= .cse0 .cse1)) (not (= (fp.add c_~CRM .cse0 .cse2) .cse3)) (not (= (_ +zero 11 53) .cse4)) (not (= ((_ to_fp 11 53) c_~CRM 10.0) .cse5)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse2)) (fp.geq .cse6 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse7 ((_ to_fp 11 53) c_~CRM 4.0))) (fp.leq .cse3 .cse7) (not (fp.geq .cse8 .cse4)) (not (fp.leq .cse8 .cse5)) (not (= .cse1 .cse9)) (not (= (fp.sub c_~CRM .cse9 .cse8) .cse6)))))) is different from true [2020-12-02 15:04:06,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:04:06,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839321072] [2020-12-02 15:04:06,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:04:06,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 20 [2020-12-02 15:04:06,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558817916] [2020-12-02 15:04:06,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-02 15:04:06,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 15:04:06,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-02 15:04:06,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=77, Unknown=14, NotChecked=286, Total=420 [2020-12-02 15:04:06,942 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 21 states. [2020-12-02 15:04:09,144 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~x~0_12 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet8_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet9_12| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_21 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_20 (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~x~0_12) ((_ extract 62 52) v_ULTIMATE.start_main_~x~0_12) ((_ extract 51 0) v_ULTIMATE.start_main_~x~0_12)))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_20))) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet8_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet8_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet8_11|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_12|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_12|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_12|))) (.cse1 (fp.mul c_~CRM .cse8 .cse8)) (.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse6 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_21)))) (or (not (= .cse0 .cse1)) (not (= (fp.add c_~CRM .cse0 .cse2) .cse3)) (not (= (_ +zero 11 53) .cse4)) (not (= ((_ to_fp 11 53) c_~CRM 10.0) .cse5)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse2)) (fp.geq .cse6 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse7 ((_ to_fp 11 53) c_~CRM 4.0))) (fp.leq .cse3 .cse7) (not (fp.geq .cse8 .cse4)) (not (fp.leq .cse8 .cse5)) (not (= .cse1 .cse9)) (not (= (fp.sub c_~CRM .cse9 .cse8) .cse6)))))) (= roundNearestTiesToEven c_~CRM)) is different from false [2020-12-02 15:04:31,876 WARN L197 SmtUtils]: Spent 20.14 s on a formula simplification that was a NOOP. DAG size: 98 [2020-12-02 15:04:45,455 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (not |c_ULTIMATE.start_main_#t~short10|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_20 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_20))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|)))) (or (not (= (fp.add c_~CRM .cse0 .cse1) .cse2)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse1)) (not (= .cse3 ((_ to_fp 11 53) c_~CRM 4.0))) (fp.leq .cse2 .cse3) (not (= .cse0 (let ((.cse4 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (fp.mul c_~CRM .cse4 .cse4))))))) .cse5 (forall ((|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_21 (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_21))) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse6 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (or (not (= (fp.mul c_~CRM .cse6 .cse6) .cse7)) (fp.geq .cse8 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse8 (fp.sub c_~CRM .cse7 .cse6))))))) (let ((.cse9 (= roundNearestTiesToEven c_~CRM)) (.cse10 (exists ((|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64))) (let ((.cse13 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|)))) (and (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse13) (= (_ +zero 11 53) .cse13)))))) (or (and .cse9 .cse5 .cse10 (exists ((|ULTIMATE.start_main_#t~nondet9| (_ BitVec 64))) (let ((.cse11 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet9|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet9|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet9|)))) (and (= ((_ to_fp 11 53) c_~CRM 10.0) .cse11) (not (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse11)))))) (and (exists ((|ULTIMATE.start_main_#t~nondet9| (_ BitVec 64))) (let ((.cse12 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet9|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet9|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet9|)))) (and (= ((_ to_fp 11 53) c_~CRM 10.0) .cse12) (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse12)))) .cse9 .cse10 |c_ULTIMATE.start_main_#t~short10|))))) is different from true [2020-12-02 15:04:47,797 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (let ((.cse0 (= roundNearestTiesToEven c_~CRM))) (or (and .cse0 (exists ((|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet8|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet8|)))) (and (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse1) (= (_ +zero 11 53) .cse1)))) (exists ((|ULTIMATE.start_main_#t~nondet9| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet9|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet9|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet9|)))) (and (= ((_ to_fp 11 53) c_~CRM 10.0) .cse2) (not (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse2))))) .cse3) (and (exists ((v_prenex_9 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9)))) (and (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse4) (= .cse4 (_ +zero 11 53))))) .cse0 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (exists ((v_prenex_10 (_ BitVec 64))) (let ((.cse5 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10)))) (and (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse5) (= ((_ to_fp 11 53) c_~CRM 10.0) .cse5))))))) (or (forall ((|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_20 (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse8 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_20))) (.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|)))) (or (not (= (fp.add c_~CRM .cse6 .cse7) .cse8)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse7)) (not (= .cse9 ((_ to_fp 11 53) c_~CRM 4.0))) (fp.leq .cse8 .cse9) (not (= .cse6 (let ((.cse10 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (fp.mul c_~CRM .cse10 .cse10))))))) (forall ((|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_21 (_ BitVec 64))) (let ((.cse13 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_21))) (.cse12 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse11 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (or (not (= (fp.mul c_~CRM .cse11 .cse11) .cse12)) (fp.geq .cse13 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse13 (fp.sub c_~CRM .cse12 .cse11)))))) .cse3))) is different from true [2020-12-02 15:04:50,109 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_9 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9)))) (and (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse0) (= .cse0 (_ +zero 11 53))))) (= roundNearestTiesToEven c_~CRM) (or (forall ((|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_20 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_20))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|)))) (or (not (= (fp.add c_~CRM .cse1 .cse2) .cse3)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse2)) (not (= .cse4 ((_ to_fp 11 53) c_~CRM 4.0))) (fp.leq .cse3 .cse4) (not (= .cse1 (let ((.cse5 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (fp.mul c_~CRM .cse5 .cse5))))))) (forall ((|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_21 (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_21) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_21) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_21))) (.cse7 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse6 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (or (not (= (fp.mul c_~CRM .cse6 .cse6) .cse7)) (fp.geq .cse8 ((_ to_fp 11 53) c_~CRM (_ bv0 32))) (not (= .cse8 (fp.sub c_~CRM .cse7 .cse6))))))) (exists ((v_prenex_10 (_ BitVec 64))) (let ((.cse9 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10)))) (and (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse9) (= ((_ to_fp 11 53) c_~CRM 10.0) .cse9))))) is different from true [2020-12-02 15:04:52,190 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_9 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9)))) (and (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse0) (= .cse0 (_ +zero 11 53))))) (= roundNearestTiesToEven c_~CRM) (exists ((|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (and (= (fp.mul c_~CRM .cse1 .cse1) .cse2) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) (fp.sub c_~CRM .cse2 .cse1))))) (or (forall ((|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_20 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_20))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|)))) (or (not (= (fp.add c_~CRM .cse3 .cse4) .cse5)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse4)) (not (= .cse6 ((_ to_fp 11 53) c_~CRM 4.0))) (fp.leq .cse5 .cse6) (not (= .cse3 (let ((.cse7 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (fp.mul c_~CRM .cse7 .cse7))))))) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32)))) (exists ((v_prenex_10 (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10)))) (and (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse8) (= ((_ to_fp 11 53) c_~CRM 10.0) .cse8))))) is different from false [2020-12-02 15:04:54,225 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_9 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9)))) (and (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse0) (= .cse0 (_ +zero 11 53))))) (= roundNearestTiesToEven c_~CRM) (exists ((|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse1 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (and (= (fp.mul c_~CRM .cse1 .cse1) .cse2) (= (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) (fp.sub c_~CRM .cse2 .cse1))))) (or (forall ((|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_20 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse5 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_20) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_20) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_20))) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|)))) (or (not (= (fp.add c_~CRM .cse3 .cse4) .cse5)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse4)) (not (= .cse6 ((_ to_fp 11 53) c_~CRM 4.0))) (fp.leq .cse5 .cse6) (not (= .cse3 (let ((.cse7 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (fp.mul c_~CRM .cse7 .cse7))))))) (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) ((_ to_fp 11 53) c_~CRM (_ bv0 32)))) (exists ((v_prenex_10 (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10)))) (and (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) .cse8) (= ((_ to_fp 11 53) c_~CRM 10.0) .cse8))))) is different from true [2020-12-02 15:04:58,457 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|)))) (or (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) .cse0) (not (= .cse0 ((_ to_fp 11 53) c_~CRM 4.0)))))) (= roundNearestTiesToEven c_~CRM) (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (v_prenex_9 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (let ((.cse5 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse2 (fp.mul c_~CRM .cse4 .cse4)) (.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|))) (.cse7 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_19))) (.cse8 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10)))) (and (= .cse1 .cse2) (= ((_ to_fp 11 53) c_~CRM 2.0) .cse3) (fp.geq .cse4 .cse5) (= .cse5 (_ +zero 11 53)) (= (fp.add c_~CRM .cse1 .cse3) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0))) (= .cse2 .cse6) (= .cse7 (fp.sub c_~CRM .cse6 .cse4)) (fp.leq .cse4 .cse8) (not (fp.geq .cse7 ((_ to_fp 11 53) c_~CRM (_ bv0 32)))) (= ((_ to_fp 11 53) c_~CRM 10.0) .cse8)))))) is different from false [2020-12-02 15:05:17,383 WARN L838 $PredicateComparison]: unable to prove that (and (or (and |c_ULTIMATE.start_main_#t~short20| (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (let ((.cse4 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse1 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_19))) (.cse6 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse7 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (.cse8 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse5 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse9 (fp.mul roundNearestTiesToEven .cse3 .cse3)) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse0) (= .cse1 (fp.sub roundNearestTiesToEven .cse2 .cse3)) (fp.geq .cse3 .cse4) (fp.leq .cse5 .cse6) (= .cse4 (_ +zero 11 53)) (not (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.leq .cse3 .cse7) (= .cse8 .cse9) (= .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse7) (= (fp.add roundNearestTiesToEven .cse8 .cse0) .cse5) (= .cse9 .cse2)))))) (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse13 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (let ((.cse14 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse11 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_19))) (.cse17 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse15 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (.cse18 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse10 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse16 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse19 (fp.mul roundNearestTiesToEven .cse13 .cse13)) (.cse12 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse10) (= .cse11 (fp.sub roundNearestTiesToEven .cse12 .cse13)) (fp.geq .cse13 .cse14) (= .cse14 (_ +zero 11 53)) (not (fp.geq .cse11 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.leq .cse13 .cse15) (not (fp.leq .cse16 .cse17)) (= .cse18 .cse19) (= .cse17 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse15) (= (fp.add roundNearestTiesToEven .cse18 .cse10) .cse16) (= .cse19 .cse12))))))) |c_ULTIMATE.start_main_#t~short20|) is different from false [2020-12-02 15:05:19,579 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (not .cse0) (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet19| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (let ((.cse5 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_19) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_19) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_19))) (.cse7 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet19|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet19|))) (.cse8 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (.cse9 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse6 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse10 (fp.mul roundNearestTiesToEven .cse4 .cse4)) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet11_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet11_10|)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse1) (= .cse2 (fp.sub roundNearestTiesToEven .cse3 .cse4)) (fp.geq .cse4 .cse5) (fp.leq .cse6 .cse7) (= .cse5 (_ +zero 11 53)) (not (fp.geq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.leq .cse4 .cse8) (= .cse9 .cse10) (= .cse7 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse8) (= (fp.add roundNearestTiesToEven .cse9 .cse1) .cse6) (= .cse10 .cse3)))))) (and (exists ((v_prenex_16 (_ BitVec 64)) (v_prenex_15 (_ BitVec 64)) (v_prenex_18 (_ BitVec 64)) (v_prenex_17 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_14 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (v_prenex_19 (_ BitVec 64))) (let ((.cse11 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13)))) (let ((.cse19 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14))) (.cse18 (fp.mul roundNearestTiesToEven .cse11 .cse11)) (.cse13 (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17))) (.cse17 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse20 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse12 (fp ((_ extract 63 63) v_prenex_18) ((_ extract 62 52) v_prenex_18) ((_ extract 51 0) v_prenex_18))) (.cse15 (fp ((_ extract 63 63) v_prenex_15) ((_ extract 62 52) v_prenex_15) ((_ extract 51 0) v_prenex_15))) (.cse16 (fp ((_ extract 63 63) v_prenex_16) ((_ extract 62 52) v_prenex_16) ((_ extract 51 0) v_prenex_16))) (.cse14 (fp ((_ extract 63 63) v_prenex_19) ((_ extract 62 52) v_prenex_19) ((_ extract 51 0) v_prenex_19)))) (and (fp.geq .cse11 .cse12) (= (fp.add roundNearestTiesToEven .cse13 .cse14) .cse15) (= ((_ to_fp 11 53) roundNearestTiesToEven 4.0) .cse16) (= .cse17 .cse18) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse19) (not (fp.geq .cse20 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.leq .cse11 .cse19) (= .cse18 .cse13) (= (fp.sub roundNearestTiesToEven .cse17 .cse11) .cse20) (= (_ +zero 11 53) .cse12) (not (fp.leq .cse15 .cse16)) (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse14))))) .cse0)))) is different from false [2020-12-02 15:05:19,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 15:05:19,693 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-12-02 15:05:19,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-02 15:05:19,693 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 12 [2020-12-02 15:05:19,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 15:05:19,694 INFO L225 Difference]: With dead ends: 23 [2020-12-02 15:05:19,694 INFO L226 Difference]: Without dead ends: 19 [2020-12-02 15:05:19,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 73.4s TimeCoverageRelationStatistics Valid=63, Invalid=99, Unknown=24, NotChecked=684, Total=870 [2020-12-02 15:05:19,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-12-02 15:05:19,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-12-02 15:05:19,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-12-02 15:05:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-12-02 15:05:19,702 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2020-12-02 15:05:19,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 15:05:19,703 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-12-02 15:05:19,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-02 15:05:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-12-02 15:05:19,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-02 15:05:19,703 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:05:19,704 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:05:19,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-02 15:05:19,905 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:05:19,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:05:19,906 INFO L82 PathProgramCache]: Analyzing trace with hash 905888175, now seen corresponding path program 1 times [2020-12-02 15:05:19,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 15:05:19,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618592003] [2020-12-02 15:05:19,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-12-02 15:05:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:05:20,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-02 15:05:20,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 15:05:22,082 WARN L197 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 28 DAG size of output: 20 [2020-12-02 15:05:22,086 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 15:05:23,613 WARN L197 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2020-12-02 15:05:24,272 WARN L197 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2020-12-02 15:05:26,323 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (v_prenex_20 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (and (= (fp.add roundNearestTiesToEven .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0))) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (fp.leq .cse2 (fp ((_ extract 63 63) v_prenex_20) ((_ extract 62 52) v_prenex_20) ((_ extract 51 0) v_prenex_20))) (= .cse0 (fp.mul roundNearestTiesToEven .cse2 .cse2))))) is different from false [2020-12-02 15:05:28,375 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (v_prenex_20 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (and (= (fp.add roundNearestTiesToEven .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0))) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (fp.leq .cse2 (fp ((_ extract 63 63) v_prenex_20) ((_ extract 62 52) v_prenex_20) ((_ extract 51 0) v_prenex_20))) (= .cse0 (fp.mul roundNearestTiesToEven .cse2 .cse2))))) is different from true [2020-12-02 15:05:28,380 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 15:05:28,381 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 15:05:28,382 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-02 15:05:38,656 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (v_prenex_20 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (= (fp.add roundNearestTiesToEven .cse0 .cse1) .cse2) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (fp.leq .cse3 (fp ((_ extract 63 63) v_prenex_20) ((_ extract 62 52) v_prenex_20) ((_ extract 51 0) v_prenex_20))) (fp.geq .cse2 .cse4) (= .cse0 (fp.mul roundNearestTiesToEven .cse3 .cse3)) (= (_ +zero 11 53) .cse4)))) |c_ULTIMATE.start_main_#t~short20|) (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (v_prenex_20 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse8 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse7 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse9 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (= (fp.add roundNearestTiesToEven .cse5 .cse6) .cse7) (= .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (fp.leq .cse8 (fp ((_ extract 63 63) v_prenex_20) ((_ extract 62 52) v_prenex_20) ((_ extract 51 0) v_prenex_20))) (= .cse5 (fp.mul roundNearestTiesToEven .cse8 .cse8)) (= (_ +zero 11 53) .cse9) (not (fp.geq .cse7 .cse9))))))) is different from false [2020-12-02 15:05:40,697 WARN L860 $PredicateComparison]: unable to prove that (or (and (exists ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (v_prenex_20 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (= (fp.add roundNearestTiesToEven .cse0 .cse1) .cse2) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (fp.leq .cse3 (fp ((_ extract 63 63) v_prenex_20) ((_ extract 62 52) v_prenex_20) ((_ extract 51 0) v_prenex_20))) (fp.geq .cse2 .cse4) (= .cse0 (fp.mul roundNearestTiesToEven .cse3 .cse3)) (= (_ +zero 11 53) .cse4)))) |c_ULTIMATE.start_main_#t~short20|) (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (v_prenex_20 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse8 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse7 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse9 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (= (fp.add roundNearestTiesToEven .cse5 .cse6) .cse7) (= .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (fp.leq .cse8 (fp ((_ extract 63 63) v_prenex_20) ((_ extract 62 52) v_prenex_20) ((_ extract 51 0) v_prenex_20))) (= .cse5 (fp.mul roundNearestTiesToEven .cse8 .cse8)) (= (_ +zero 11 53) .cse9) (not (fp.geq .cse7 .cse9))))))) is different from true [2020-12-02 15:05:46,854 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (v_prenex_20 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (= (fp.add roundNearestTiesToEven .cse0 .cse1) .cse2) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (fp.leq .cse3 (fp ((_ extract 63 63) v_prenex_20) ((_ extract 62 52) v_prenex_20) ((_ extract 51 0) v_prenex_20))) (= .cse0 (fp.mul roundNearestTiesToEven .cse3 .cse3)) (= (_ +zero 11 53) .cse4) (not (fp.geq .cse2 .cse4))))) is different from false [2020-12-02 15:05:48,894 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (v_prenex_20 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (= (fp.add roundNearestTiesToEven .cse0 .cse1) .cse2) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (fp.leq .cse3 (fp ((_ extract 63 63) v_prenex_20) ((_ extract 62 52) v_prenex_20) ((_ extract 51 0) v_prenex_20))) (= .cse0 (fp.mul roundNearestTiesToEven .cse3 .cse3)) (= (_ +zero 11 53) .cse4) (not (fp.geq .cse2 .cse4))))) is different from true [2020-12-02 15:05:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:05:57,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 15:05:59,782 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_23 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_23))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 2.0))) (not (= (_ +zero 11 53) .cse1)) (fp.geq .cse2 .cse1) (not (= (let ((.cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (fp.mul c_~CRM .cse3 .cse3)) .cse4)) (not (= .cse2 (fp.add c_~CRM .cse4 .cse0)))))) is different from true [2020-12-02 15:06:01,872 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_23 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_23))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 2.0))) (not (= (_ +zero 11 53) .cse1)) (fp.geq .cse2 .cse1) (not (= (let ((.cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (fp.mul c_~CRM .cse3 .cse3)) .cse4)) (not (= .cse2 (fp.add c_~CRM .cse4 .cse0)))))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from true [2020-12-02 15:06:01,881 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-02 15:06:01,881 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 15:06:03,965 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_23 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_23))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 2.0))) (not (= (_ +zero 11 53) .cse1)) (fp.geq .cse2 .cse1) (not (= (let ((.cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (fp.mul c_~CRM .cse3 .cse3)) .cse4)) (not (= .cse2 (fp.add c_~CRM .cse4 .cse0)))))) (not |c_ULTIMATE.start_main_#t~short10|)) is different from true [2020-12-02 15:06:06,012 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet9_15| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_23 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_23))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 2.0))) (not (= (_ +zero 11 53) .cse1)) (fp.geq .cse2 .cse1) (not (= (fp.mul c_~CRM .cse3 .cse3) .cse4)) (not (= .cse2 (fp.add c_~CRM .cse4 .cse0))) (not (fp.leq .cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_15|))))))) is different from false [2020-12-02 15:06:08,055 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet9_15| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_23 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_23))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 2.0))) (not (= (_ +zero 11 53) .cse1)) (fp.geq .cse2 .cse1) (not (= (fp.mul c_~CRM .cse3 .cse3) .cse4)) (not (= .cse2 (fp.add c_~CRM .cse4 .cse0))) (not (fp.leq .cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_15|))))))) is different from true [2020-12-02 15:06:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:06:08,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618592003] [2020-12-02 15:06:08,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:06:08,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 14 [2020-12-02 15:06:08,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076840327] [2020-12-02 15:06:08,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-02 15:06:08,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 15:06:08,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-02 15:06:08,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=42, Unknown=11, NotChecked=126, Total=210 [2020-12-02 15:06:08,069 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 15 states. [2020-12-02 15:06:10,231 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (forall ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet9_15| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_23 (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_23))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 2.0))) (not (= (_ +zero 11 53) .cse1)) (fp.geq .cse2 .cse1) (not (= (fp.mul c_~CRM .cse3 .cse3) .cse4)) (not (= .cse2 (fp.add c_~CRM .cse4 .cse0))) (not (fp.leq .cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet9_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet9_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet9_15|)))))))) is different from false [2020-12-02 15:06:12,435 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (not |c_ULTIMATE.start_main_#t~short10|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_23 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_23))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 2.0))) (not (= (_ +zero 11 53) .cse1)) (fp.geq .cse2 .cse1) (not (= (let ((.cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (fp.mul c_~CRM .cse3 .cse3)) .cse4)) (not (= .cse2 (fp.add c_~CRM .cse4 .cse0)))))) .cse5) (let ((.cse6 (= roundNearestTiesToEven c_~CRM))) (or (and .cse6 .cse5) (and (exists ((v_prenex_20 (_ BitVec 64))) (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) (fp ((_ extract 63 63) v_prenex_20) ((_ extract 62 52) v_prenex_20) ((_ extract 51 0) v_prenex_20)))) .cse6))))) is different from true [2020-12-02 15:06:14,510 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (or (forall ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_23 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_23))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 2.0))) (not (= (_ +zero 11 53) .cse1)) (fp.geq .cse2 .cse1) (not (= (let ((.cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (fp.mul c_~CRM .cse3 .cse3)) .cse4)) (not (= .cse2 (fp.add c_~CRM .cse4 .cse0)))))) .cse5) (let ((.cse6 (= roundNearestTiesToEven c_~CRM))) (or (and .cse6 .cse5) (and (exists ((v_prenex_20 (_ BitVec 64))) (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) (fp ((_ extract 63 63) v_prenex_20) ((_ extract 62 52) v_prenex_20) ((_ extract 51 0) v_prenex_20)))) .cse6 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond)))))) is different from true [2020-12-02 15:06:16,664 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_20 (_ BitVec 64))) (fp.leq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)) (fp ((_ extract 63 63) v_prenex_20) ((_ extract 62 52) v_prenex_20) ((_ extract 51 0) v_prenex_20)))) (forall ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (v_ULTIMATE.start_main_~y~0_23 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse2 (fp ((_ extract 63 63) v_ULTIMATE.start_main_~y~0_23) ((_ extract 62 52) v_ULTIMATE.start_main_~y~0_23) ((_ extract 51 0) v_ULTIMATE.start_main_~y~0_23))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|)))) (or (not (= .cse0 ((_ to_fp 11 53) c_~CRM 2.0))) (not (= (_ +zero 11 53) .cse1)) (fp.geq .cse2 .cse1) (not (= (let ((.cse3 (fp ((_ extract 63 63) c_ULTIMATE.start_main_~x~0) ((_ extract 62 52) c_ULTIMATE.start_main_~x~0) ((_ extract 51 0) c_ULTIMATE.start_main_~x~0)))) (fp.mul c_~CRM .cse3 .cse3)) .cse4)) (not (= .cse2 (fp.add c_~CRM .cse4 .cse0)))))) (= roundNearestTiesToEven c_~CRM)) is different from true [2020-12-02 15:06:24,903 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|)))) (or (fp.geq (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0)) .cse0) (not (= (_ +zero 11 53) .cse0))))) (exists ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (v_prenex_20 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0)))) (and (= (fp.add roundNearestTiesToEven .cse1 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start_main_~y~0) ((_ extract 62 52) c_ULTIMATE.start_main_~y~0) ((_ extract 51 0) c_ULTIMATE.start_main_~y~0))) (= .cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (fp.leq .cse3 (fp ((_ extract 63 63) v_prenex_20) ((_ extract 62 52) v_prenex_20) ((_ extract 51 0) v_prenex_20))) (= .cse1 (fp.mul roundNearestTiesToEven .cse3 .cse3)))))) is different from false [2020-12-02 15:06:39,750 WARN L838 $PredicateComparison]: unable to prove that (and |c_ULTIMATE.start_main_#t~short20| (or (and (exists ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (v_prenex_20 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse2 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse3 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse4 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (= (fp.add roundNearestTiesToEven .cse0 .cse1) .cse2) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (fp.leq .cse3 (fp ((_ extract 63 63) v_prenex_20) ((_ extract 62 52) v_prenex_20) ((_ extract 51 0) v_prenex_20))) (fp.geq .cse2 .cse4) (= .cse0 (fp.mul roundNearestTiesToEven .cse3 .cse3)) (= (_ +zero 11 53) .cse4)))) |c_ULTIMATE.start_main_#t~short20|) (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ BitVec 64)) (v_prenex_20 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_10| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_10|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_10|))) (.cse8 (fp ((_ extract 63 63) ULTIMATE.start_main_~x~0) ((_ extract 62 52) ULTIMATE.start_main_~x~0) ((_ extract 51 0) ULTIMATE.start_main_~x~0))) (.cse7 (fp ((_ extract 63 63) ULTIMATE.start_main_~y~0) ((_ extract 62 52) ULTIMATE.start_main_~y~0) ((_ extract 51 0) ULTIMATE.start_main_~y~0))) (.cse9 (fp ((_ extract 63 63) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 62 52) |ULTIMATE.start_main_#t~nondet18|) ((_ extract 51 0) |ULTIMATE.start_main_#t~nondet18|)))) (and (= (fp.add roundNearestTiesToEven .cse5 .cse6) .cse7) (= .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (fp.leq .cse8 (fp ((_ extract 63 63) v_prenex_20) ((_ extract 62 52) v_prenex_20) ((_ extract 51 0) v_prenex_20))) (= .cse5 (fp.mul roundNearestTiesToEven .cse8 .cse8)) (= (_ +zero 11 53) .cse9) (not (fp.geq .cse7 .cse9)))))))) is different from false [2020-12-02 15:06:40,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 15:06:40,065 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-12-02 15:06:40,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 15:06:40,066 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2020-12-02 15:06:40,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 15:06:40,067 INFO L225 Difference]: With dead ends: 23 [2020-12-02 15:06:40,067 INFO L226 Difference]: Without dead ends: 13 [2020-12-02 15:06:40,068 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 39.7s TimeCoverageRelationStatistics Valid=43, Invalid=48, Unknown=17, NotChecked=312, Total=420 [2020-12-02 15:06:40,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-12-02 15:06:40,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-12-02 15:06:40,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-12-02 15:06:40,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-12-02 15:06:40,071 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2020-12-02 15:06:40,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 15:06:40,071 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-12-02 15:06:40,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-02 15:06:40,072 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-12-02 15:06:40,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-02 15:06:40,072 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 15:06:40,073 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 15:06:40,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-02 15:06:40,284 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 15:06:40,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 15:06:40,285 INFO L82 PathProgramCache]: Analyzing trace with hash 455543281, now seen corresponding path program 1 times [2020-12-02 15:06:40,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 15:06:40,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743306611] [2020-12-02 15:06:40,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-12-02 15:06:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 15:06:41,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-02 15:06:41,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 15:06:41,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:06:41,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 15:06:41,692 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-02 15:06:41,692 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 15:06:41,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 15:06:41,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743306611] [2020-12-02 15:06:41,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 15:06:41,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-12-02 15:06:41,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420320445] [2020-12-02 15:06:41,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 15:06:41,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 15:06:41,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 15:06:41,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 15:06:41,699 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 4 states. [2020-12-02 15:06:42,003 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2020-12-02 15:06:42,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 15:06:42,005 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-12-02 15:06:42,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 15:06:42,005 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-02 15:06:42,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 15:06:42,006 INFO L225 Difference]: With dead ends: 13 [2020-12-02 15:06:42,006 INFO L226 Difference]: Without dead ends: 0 [2020-12-02 15:06:42,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 15:06:42,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-02 15:06:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-02 15:06:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-02 15:06:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-02 15:06:42,011 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2020-12-02 15:06:42,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 15:06:42,012 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-02 15:06:42,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 15:06:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-02 15:06:42,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-02 15:06:42,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-02 15:06:42,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-02 15:06:42,252 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-02 15:06:42,252 INFO L262 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2020-12-02 15:06:42,252 INFO L262 CegarLoopResult]: For program point L27-2(line 27) no Hoare annotation was computed. [2020-12-02 15:06:42,253 INFO L262 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-12-02 15:06:42,253 INFO L262 CegarLoopResult]: For program point L21-2(line 21) no Hoare annotation was computed. [2020-12-02 15:06:42,253 INFO L262 CegarLoopResult]: For program point L11(lines 11 13) no Hoare annotation was computed. [2020-12-02 15:06:42,253 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-02 15:06:42,253 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-02 15:06:42,253 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-02 15:06:42,254 INFO L265 CegarLoopResult]: At program point L28(lines 16 29) the Hoare annotation is: true [2020-12-02 15:06:42,254 INFO L262 CegarLoopResult]: For program point L24(lines 24 25) no Hoare annotation was computed. [2020-12-02 15:06:42,254 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2020-12-02 15:06:42,254 INFO L262 CegarLoopResult]: For program point L24-2(lines 24 25) no Hoare annotation was computed. [2020-12-02 15:06:42,254 INFO L262 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-12-02 15:06:42,254 INFO L262 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-12-02 15:06:42,254 INFO L262 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-12-02 15:06:42,254 INFO L265 CegarLoopResult]: At program point L14-3(line 14) the Hoare annotation is: true [2020-12-02 15:06:42,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:06:42 BoogieIcfgContainer [2020-12-02 15:06:42,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 15:06:42,262 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 15:06:42,263 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 15:06:42,263 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 15:06:42,263 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:58:54" (3/4) ... [2020-12-02 15:06:42,267 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-02 15:06:42,281 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-12-02 15:06:42,281 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-02 15:06:42,281 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-02 15:06:42,281 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-02 15:06:42,331 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-02 15:06:42,332 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 15:06:42,333 INFO L168 Benchmark]: Toolchain (without parser) took 475040.04 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 16.6 MB in the beginning and 24.4 MB in the end (delta: -7.8 MB). Peak memory consumption was 2.2 MB. Max. memory is 16.1 GB. [2020-12-02 15:06:42,334 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 39.8 MB. Free memory was 26.1 MB in the beginning and 26.1 MB in the end (delta: 25.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 15:06:42,334 INFO L168 Benchmark]: CACSL2BoogieTranslator took 347.48 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 16.3 MB in the beginning and 23.4 MB in the end (delta: -7.0 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2020-12-02 15:06:42,335 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.27 ms. Allocated memory is still 48.2 MB. Free memory was 23.4 MB in the beginning and 21.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-02 15:06:42,336 INFO L168 Benchmark]: Boogie Preprocessor took 65.24 ms. Allocated memory is still 48.2 MB. Free memory was 21.6 MB in the beginning and 32.2 MB in the end (delta: -10.6 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. [2020-12-02 15:06:42,336 INFO L168 Benchmark]: RCFGBuilder took 6708.54 ms. Allocated memory is still 48.2 MB. Free memory was 32.2 MB in the beginning and 29.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 16.1 GB. [2020-12-02 15:06:42,337 INFO L168 Benchmark]: TraceAbstraction took 467790.22 ms. Allocated memory is still 48.2 MB. Free memory was 28.9 MB in the beginning and 27.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.2 MB. Max. memory is 16.1 GB. [2020-12-02 15:06:42,338 INFO L168 Benchmark]: Witness Printer took 69.17 ms. Allocated memory is still 48.2 MB. Free memory was 27.1 MB in the beginning and 24.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 15:06:42,341 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.20 ms. Allocated memory is still 39.8 MB. Free memory was 26.1 MB in the beginning and 26.1 MB in the end (delta: 25.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 347.48 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 16.3 MB in the beginning and 23.4 MB in the end (delta: -7.0 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 49.27 ms. Allocated memory is still 48.2 MB. Free memory was 23.4 MB in the beginning and 21.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 65.24 ms. Allocated memory is still 48.2 MB. Free memory was 21.6 MB in the beginning and 32.2 MB in the end (delta: -10.6 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. * RCFGBuilder took 6708.54 ms. Allocated memory is still 48.2 MB. Free memory was 32.2 MB in the beginning and 29.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 467790.22 ms. Allocated memory is still 48.2 MB. Free memory was 28.9 MB in the beginning and 27.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.2 MB. Max. memory is 16.1 GB. * Witness Printer took 69.17 ms. Allocated memory is still 48.2 MB. Free memory was 27.1 MB in the beginning and 24.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 467.6s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 246.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 64 SDtfs, 16 SDslu, 154 SDs, 0 SdLazy, 98 SolverSat, 3 SolverUnsat, 35 SolverUnknown, 0 SolverNotchecked, 74.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 60 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 286.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 5.2s SatisfiabilityAnalysisTime, 214.1s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 132 ConstructedInterpolants, 68 QuantifiedInterpolants, 78672 SizeOfPredicates, 48 NumberOfNonLiveVariables, 266 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...