./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/zonotope_tight.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ee8e70e7 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/zonotope_tight.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/zonotope_tight.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 92269a31b3f4041d2f8501c63b7af13f5ed1a7b5 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-ee8e70e [2020-10-24 14:47:51,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 14:47:51,490 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 14:47:51,556 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 14:47:51,557 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 14:47:51,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 14:47:51,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 14:47:51,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 14:47:51,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 14:47:51,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 14:47:51,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 14:47:51,592 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 14:47:51,592 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 14:47:51,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 14:47:51,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 14:47:51,601 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 14:47:51,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 14:47:51,606 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 14:47:51,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 14:47:51,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 14:47:51,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 14:47:51,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 14:47:51,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 14:47:51,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 14:47:51,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 14:47:51,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 14:47:51,635 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 14:47:51,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 14:47:51,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 14:47:51,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 14:47:51,640 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 14:47:51,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 14:47:51,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 14:47:51,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 14:47:51,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 14:47:51,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 14:47:51,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 14:47:51,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 14:47:51,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 14:47:51,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 14:47:51,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 14:47:51,651 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-24 14:47:51,711 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 14:47:51,712 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 14:47:51,715 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 14:47:51,715 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 14:47:51,715 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 14:47:51,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 14:47:51,716 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 14:47:51,716 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 14:47:51,717 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 14:47:51,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 14:47:51,718 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 14:47:51,719 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 14:47:51,719 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 14:47:51,719 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 14:47:51,720 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 14:47:51,720 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 14:47:51,720 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 14:47:51,720 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 14:47:51,721 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 14:47:51,721 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 14:47:51,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 14:47:51,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 14:47:51,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 14:47:51,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 14:47:51,723 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 14:47:51,723 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-24 14:47:51,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-24 14:47:51,724 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 14:47:51,724 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 14:47:51,724 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 92269a31b3f4041d2f8501c63b7af13f5ed1a7b5 [2020-10-24 14:47:52,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 14:47:52,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 14:47:52,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 14:47:52,253 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 14:47:52,254 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 14:47:52,255 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/zonotope_tight.c [2020-10-24 14:47:52,337 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/74df863a9/33e8c627c0dd48458932762b1cc7f131/FLAGce5d64a7d [2020-10-24 14:47:52,909 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 14:47:52,910 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_tight.c [2020-10-24 14:47:52,917 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/74df863a9/33e8c627c0dd48458932762b1cc7f131/FLAGce5d64a7d [2020-10-24 14:47:53,313 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/74df863a9/33e8c627c0dd48458932762b1cc7f131 [2020-10-24 14:47:53,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 14:47:53,323 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 14:47:53,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 14:47:53,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 14:47:53,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 14:47:53,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:47:53" (1/1) ... [2020-10-24 14:47:53,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67e1d23a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:53, skipping insertion in model container [2020-10-24 14:47:53,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:47:53" (1/1) ... [2020-10-24 14:47:53,358 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 14:47:53,373 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-10-24 14:47:53,548 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 14:47:53,560 INFO L212 MainTranslator]: Completed pre-run [2020-10-24 14:47:53,579 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 14:47:53,597 INFO L217 MainTranslator]: Completed translation [2020-10-24 14:47:53,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:53 WrapperNode [2020-10-24 14:47:53,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 14:47:53,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 14:47:53,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 14:47:53,600 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 14:47:53,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:53" (1/1) ... [2020-10-24 14:47:53,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:53" (1/1) ... [2020-10-24 14:47:53,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 14:47:53,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 14:47:53,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 14:47:53,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 14:47:53,659 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:53" (1/1) ... [2020-10-24 14:47:53,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:53" (1/1) ... [2020-10-24 14:47:53,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:53" (1/1) ... [2020-10-24 14:47:53,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:53" (1/1) ... [2020-10-24 14:47:53,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:53" (1/1) ... [2020-10-24 14:47:53,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:53" (1/1) ... [2020-10-24 14:47:53,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:53" (1/1) ... [2020-10-24 14:47:53,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 14:47:53,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 14:47:53,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 14:47:53,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 14:47:53,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:53" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 14:47:53,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 14:47:53,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 14:47:53,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 14:47:53,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 14:47:54,226 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 14:47:54,227 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-24 14:47:54,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:47:54 BoogieIcfgContainer [2020-10-24 14:47:54,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 14:47:54,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 14:47:54,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 14:47:54,238 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 14:47:54,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:47:53" (1/3) ... [2020-10-24 14:47:54,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c3940a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:47:54, skipping insertion in model container [2020-10-24 14:47:54,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:53" (2/3) ... [2020-10-24 14:47:54,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c3940a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:47:54, skipping insertion in model container [2020-10-24 14:47:54,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:47:54" (3/3) ... [2020-10-24 14:47:54,244 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_tight.c [2020-10-24 14:47:54,259 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 14:47:54,265 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 14:47:54,281 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 14:47:54,332 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 14:47:54,333 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 14:47:54,333 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 14:47:54,333 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 14:47:54,334 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 14:47:54,334 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 14:47:54,334 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 14:47:54,334 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 14:47:54,353 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2020-10-24 14:47:54,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-24 14:47:54,362 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:47:54,365 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:47:54,366 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:47:54,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:47:54,374 INFO L82 PathProgramCache]: Analyzing trace with hash 119383821, now seen corresponding path program 1 times [2020-10-24 14:47:54,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 14:47:54,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168124158] [2020-10-24 14:47:54,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 14:47:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 14:47:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:47:54,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168124158] [2020-10-24 14:47:54,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 14:47:54,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-24 14:47:54,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070690239] [2020-10-24 14:47:54,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-24 14:47:54,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 14:47:54,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-24 14:47:54,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 14:47:54,626 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2020-10-24 14:47:54,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 14:47:54,648 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2020-10-24 14:47:54,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-24 14:47:54,650 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2020-10-24 14:47:54,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 14:47:54,661 INFO L225 Difference]: With dead ends: 24 [2020-10-24 14:47:54,661 INFO L226 Difference]: Without dead ends: 9 [2020-10-24 14:47:54,666 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-10-24 14:47:54,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-10-24 14:47:54,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-10-24 14:47:54,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-24 14:47:54,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2020-10-24 14:47:54,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 8 [2020-10-24 14:47:54,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 14:47:54,726 INFO L481 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2020-10-24 14:47:54,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-24 14:47:54,728 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-10-24 14:47:54,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-24 14:47:54,728 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:47:54,729 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:47:54,729 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 14:47:54,729 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:47:54,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:47:54,732 INFO L82 PathProgramCache]: Analyzing trace with hash 176642123, now seen corresponding path program 1 times [2020-10-24 14:47:54,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 14:47:54,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141925466] [2020-10-24 14:47:54,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 14:47:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 14:47:54,799 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 14:47:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 14:47:54,839 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 14:47:54,864 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-24 14:47:54,864 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 14:47:54,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 14:47:54,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:47:54 BoogieIcfgContainer [2020-10-24 14:47:54,897 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 14:47:54,898 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 14:47:54,898 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 14:47:54,898 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 14:47:54,899 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:47:54" (3/4) ... [2020-10-24 14:47:54,903 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-24 14:47:54,903 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 14:47:54,906 INFO L168 Benchmark]: Toolchain (without parser) took 1586.33 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 19.0 MB in the beginning and 33.0 MB in the end (delta: -14.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 14:47:54,907 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 41.9 MB. Free memory is still 24.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 14:47:54,908 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.01 ms. Allocated memory is still 41.9 MB. Free memory was 18.4 MB in the beginning and 18.2 MB in the end (delta: 181.9 kB). Peak memory consumption was 3.2 MB. Max. memory is 16.1 GB. [2020-10-24 14:47:54,909 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.32 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 18.2 MB in the beginning and 35.2 MB in the end (delta: -17.0 MB). Peak memory consumption was 4.6 MB. Max. memory is 16.1 GB. [2020-10-24 14:47:54,910 INFO L168 Benchmark]: Boogie Preprocessor took 25.35 ms. Allocated memory is still 50.3 MB. Free memory was 35.2 MB in the beginning and 34.1 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 14:47:54,911 INFO L168 Benchmark]: RCFGBuilder took 555.99 ms. Allocated memory is still 50.3 MB. Free memory was 34.1 MB in the beginning and 23.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-10-24 14:47:54,912 INFO L168 Benchmark]: TraceAbstraction took 664.07 ms. Allocated memory is still 50.3 MB. Free memory was 23.0 MB in the beginning and 33.3 MB in the end (delta: -10.2 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. [2020-10-24 14:47:54,913 INFO L168 Benchmark]: Witness Printer took 5.57 ms. Allocated memory is still 50.3 MB. Free memory was 33.3 MB in the beginning and 33.0 MB in the end (delta: 255.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 14:47:54,917 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 41.9 MB. Free memory is still 24.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 274.01 ms. Allocated memory is still 41.9 MB. Free memory was 18.4 MB in the beginning and 18.2 MB in the end (delta: 181.9 kB). Peak memory consumption was 3.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 48.32 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 18.2 MB in the beginning and 35.2 MB in the end (delta: -17.0 MB). Peak memory consumption was 4.6 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 25.35 ms. Allocated memory is still 50.3 MB. Free memory was 35.2 MB in the beginning and 34.1 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 555.99 ms. Allocated memory is still 50.3 MB. Free memory was 34.1 MB in the beginning and 23.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 664.07 ms. Allocated memory is still 50.3 MB. Free memory was 23.0 MB in the beginning and 33.3 MB in the end (delta: -10.2 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. * Witness Printer took 5.57 ms. Allocated memory is still 50.3 MB. Free memory was 33.3 MB in the beginning and 33.0 MB in the end (delta: 255.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryArithmeticDOUBLE_SMToperation at line 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) [L3] __assert_fail("0", "zonotope_tight.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.5s, 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=14occurred 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-ee8e70e [2020-10-24 14:47:57,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 14:47:57,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 14:47:57,589 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 14:47:57,589 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 14:47:57,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 14:47:57,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 14:47:57,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 14:47:57,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 14:47:57,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 14:47:57,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 14:47:57,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 14:47:57,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 14:47:57,628 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 14:47:57,630 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 14:47:57,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 14:47:57,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 14:47:57,641 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 14:47:57,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 14:47:57,654 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 14:47:57,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 14:47:57,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 14:47:57,662 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 14:47:57,664 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 14:47:57,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 14:47:57,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 14:47:57,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 14:47:57,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 14:47:57,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 14:47:57,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 14:47:57,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 14:47:57,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 14:47:57,680 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 14:47:57,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 14:47:57,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 14:47:57,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 14:47:57,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 14:47:57,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 14:47:57,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 14:47:57,688 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 14:47:57,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 14:47:57,690 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-24 14:47:57,752 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 14:47:57,753 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 14:47:57,756 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 14:47:57,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 14:47:57,757 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 14:47:57,757 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 14:47:57,757 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 14:47:57,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 14:47:57,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 14:47:57,758 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 14:47:57,760 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 14:47:57,760 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 14:47:57,760 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-24 14:47:57,760 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-24 14:47:57,761 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 14:47:57,761 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 14:47:57,761 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 14:47:57,761 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 14:47:57,762 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 14:47:57,762 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 14:47:57,763 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 14:47:57,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 14:47:57,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 14:47:57,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 14:47:57,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 14:47:57,764 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 14:47:57,764 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-24 14:47:57,765 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-24 14:47:57,765 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 14:47:57,765 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 14:47:57,765 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-24 14:47:57,766 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 92269a31b3f4041d2f8501c63b7af13f5ed1a7b5 [2020-10-24 14:47:58,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 14:47:58,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 14:47:58,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 14:47:58,242 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 14:47:58,243 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 14:47:58,244 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/zonotope_tight.c [2020-10-24 14:47:58,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0b5d0648f/ff43b24a1efa4ff7a4ba7a0b0d01b67e/FLAG7dceeff1c [2020-10-24 14:47:58,983 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 14:47:58,984 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_tight.c [2020-10-24 14:47:58,993 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0b5d0648f/ff43b24a1efa4ff7a4ba7a0b0d01b67e/FLAG7dceeff1c [2020-10-24 14:47:59,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/0b5d0648f/ff43b24a1efa4ff7a4ba7a0b0d01b67e [2020-10-24 14:47:59,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 14:47:59,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 14:47:59,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 14:47:59,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 14:47:59,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 14:47:59,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:47:59" (1/1) ... [2020-10-24 14:47:59,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@231b1ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:59, skipping insertion in model container [2020-10-24 14:47:59,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:47:59" (1/1) ... [2020-10-24 14:47:59,395 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 14:47:59,411 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-10-24 14:47:59,616 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 14:47:59,635 INFO L212 MainTranslator]: Completed pre-run [2020-10-24 14:47:59,656 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 14:47:59,677 INFO L217 MainTranslator]: Completed translation [2020-10-24 14:47:59,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:59 WrapperNode [2020-10-24 14:47:59,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 14:47:59,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 14:47:59,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 14:47:59,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 14:47:59,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:59" (1/1) ... [2020-10-24 14:47:59,711 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:59" (1/1) ... [2020-10-24 14:47:59,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 14:47:59,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 14:47:59,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 14:47:59,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 14:47:59,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:59" (1/1) ... [2020-10-24 14:47:59,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:59" (1/1) ... [2020-10-24 14:47:59,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:59" (1/1) ... [2020-10-24 14:47:59,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:59" (1/1) ... [2020-10-24 14:47:59,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:59" (1/1) ... [2020-10-24 14:47:59,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:59" (1/1) ... [2020-10-24 14:47:59,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:59" (1/1) ... [2020-10-24 14:47:59,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 14:47:59,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 14:47:59,773 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 14:47:59,773 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 14:47:59,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:59" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 14:47:59,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.float_to_bitvec_DOUBLE [2020-10-24 14:47:59,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-24 14:47:59,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 14:47:59,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 14:47:59,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 14:48:02,910 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 14:48:02,911 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-24 14:48:02,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:48:02 BoogieIcfgContainer [2020-10-24 14:48:02,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 14:48:02,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 14:48:02,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 14:48:02,919 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 14:48:02,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:47:59" (1/3) ... [2020-10-24 14:48:02,920 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb94ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:48:02, skipping insertion in model container [2020-10-24 14:48:02,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:47:59" (2/3) ... [2020-10-24 14:48:02,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eb94ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:48:02, skipping insertion in model container [2020-10-24 14:48:02,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:48:02" (3/3) ... [2020-10-24 14:48:02,923 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_tight.c [2020-10-24 14:48:02,936 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 14:48:02,942 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 14:48:02,957 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 14:48:02,982 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 14:48:02,983 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 14:48:02,983 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 14:48:02,983 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 14:48:02,983 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 14:48:02,983 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 14:48:02,984 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 14:48:02,984 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 14:48:02,996 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-10-24 14:48:03,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-24 14:48:03,002 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:48:03,003 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:48:03,004 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:48:03,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:48:03,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1657916917, now seen corresponding path program 1 times [2020-10-24 14:48:03,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 14:48:03,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781756348] [2020-10-24 14:48:03,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-24 14:48:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 14:48:04,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-24 14:48:04,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 14:48:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:48:04,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 14:48:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:48:04,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781756348] [2020-10-24 14:48:04,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 14:48:04,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-24 14:48:04,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678447336] [2020-10-24 14:48:04,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-24 14:48:04,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 14:48:04,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-24 14:48:04,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 14:48:04,409 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2020-10-24 14:48:04,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 14:48:04,427 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-10-24 14:48:04,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-24 14:48:04,429 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-10-24 14:48:04,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 14:48:04,439 INFO L225 Difference]: With dead ends: 30 [2020-10-24 14:48:04,439 INFO L226 Difference]: Without dead ends: 13 [2020-10-24 14:48:04,442 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-10-24 14:48:04,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-10-24 14:48:04,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-10-24 14:48:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-24 14:48:04,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2020-10-24 14:48:04,480 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 12 [2020-10-24 14:48:04,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 14:48:04,481 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2020-10-24 14:48:04,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-24 14:48:04,482 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2020-10-24 14:48:04,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-24 14:48:04,483 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:48:04,483 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:48:04,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-24 14:48:04,698 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:48:04,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:48:04,700 INFO L82 PathProgramCache]: Analyzing trace with hash 848570291, now seen corresponding path program 1 times [2020-10-24 14:48:04,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 14:48:04,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1198647951] [2020-10-24 14:48:04,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-24 14:48:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 14:48:06,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-24 14:48:06,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 14:48:06,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:48:06,474 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2020-10-24 14:48:06,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:48:06,698 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-10-24 14:48:06,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:48:09,083 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-10-24 14:48:09,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:48:11,303 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-10-24 14:48:13,400 WARN L860 $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 true [2020-10-24 14:48:13,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:48:20,274 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-10-24 14:48:22,406 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-10-24 14:48:22,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:48:32,715 WARN L838 $PredicateComparison]: unable to prove that (or (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (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)))) is different from false [2020-10-24 14:48:39,197 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-10-24 14:48:41,293 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-10-24 14:48:41,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:48:41,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 14:48:44,209 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-10-24 14:48:46,439 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-10-24 14:48:46,460 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-24 14:48:46,460 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 14:48:48,699 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-10-24 14:48:50,809 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-10-24 14:48:53,006 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-10-24 14:48:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:48:53,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1198647951] [2020-10-24 14:48:53,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 14:48:53,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2020-10-24 14:48:53,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175454036] [2020-10-24 14:48:53,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-24 14:48:53,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 14:48:53,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-24 14:48:53,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=75, Unknown=13, NotChecked=216, Total=342 [2020-10-24 14:48:53,030 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 19 states. [2020-10-24 14:48:55,220 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-10-24 14:49:11,874 WARN L193 SmtUtils]: Spent 11.75 s on a formula simplification that was a NOOP. DAG size: 66 [2020-10-24 14:49:46,571 WARN L193 SmtUtils]: Spent 32.23 s on a formula simplification. DAG size of input: 83 DAG size of output: 83 [2020-10-24 14:49:56,188 WARN L193 SmtUtils]: Spent 9.36 s on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2020-10-24 14:50:00,458 WARN L860 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((v_prenex_1 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1)))) (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)) .cse0) (= .cse0 ((_ to_fp 11 53) c_~CRM 10.0))))) (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))))))) is different from true [2020-10-24 14:50:02,685 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-10-24 14:50:09,504 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-10-24 14:50:11,785 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-10-24 14:50:14,278 WARN L193 SmtUtils]: Spent 2.36 s on a formula simplification. DAG size of input: 58 DAG size of output: 5 [2020-10-24 14:50:14,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 14:50:14,364 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-10-24 14:50:14,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 14:50:14,365 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 12 [2020-10-24 14:50:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 14:50:14,366 INFO L225 Difference]: With dead ends: 27 [2020-10-24 14:50:14,366 INFO L226 Difference]: Without dead ends: 23 [2020-10-24 14:50:14,369 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 104.9s TimeCoverageRelationStatistics Valid=68, Invalid=149, Unknown=21, NotChecked=518, Total=756 [2020-10-24 14:50:14,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-10-24 14:50:14,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2020-10-24 14:50:14,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-24 14:50:14,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2020-10-24 14:50:14,374 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2020-10-24 14:50:14,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 14:50:14,375 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2020-10-24 14:50:14,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-24 14:50:14,375 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2020-10-24 14:50:14,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-24 14:50:14,376 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:50:14,376 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:50:14,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-24 14:50:14,578 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:50:14,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:50:14,579 INFO L82 PathProgramCache]: Analyzing trace with hash 848629873, now seen corresponding path program 1 times [2020-10-24 14:50:14,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 14:50:14,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [70735704] [2020-10-24 14:50:14,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 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-10-24 14:50:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 14:50:15,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-24 14:50:15,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 14:50:15,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:50:16,007 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2020-10-24 14:50:16,433 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 15 [2020-10-24 14:50:16,702 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2020-10-24 14:50:16,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:50:18,983 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-10-24 14:50:21,068 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-10-24 14:50:21,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:50:26,289 WARN L838 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short20| (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))))))) is different from false [2020-10-24 14:50:28,375 WARN L860 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short20| (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))))))) is different from true [2020-10-24 14:50:34,908 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-10-24 14:50:36,989 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-10-24 14:50:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:50:45,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 14:50:48,211 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-10-24 14:50:50,460 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-10-24 14:50:50,466 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-24 14:50:50,466 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 14:50:52,749 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-10-24 14:50:54,982 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-10-24 14:51:01,349 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-10-24 14:51:03,569 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-10-24 14:51:03,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:51:03,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [70735704] [2020-10-24 14:51:03,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 14:51:03,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 15 [2020-10-24 14:51:03,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19121139] [2020-10-24 14:51:03,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 14:51:03,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 14:51:03,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 14:51:03,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=34, Unknown=12, NotChecked=136, Total=210 [2020-10-24 14:51:03,575 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 15 states. [2020-10-24 14:51:40,680 WARN L193 SmtUtils]: Spent 34.71 s on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2020-10-24 14:51:43,531 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-10-24 14:51:45,832 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (let ((.cse0 (exists ((|ULTIMATE.start_main_#t~nondet8| (_ BitVec 64))) (let ((.cse2 (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)) .cse2) (= (_ +zero 11 53) .cse2)))))) (or (and .cse0 .cse1) (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .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 ((.cse3 (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|))) (.cse4 (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))) (.cse5 (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)) .cse3) .cse4)) (not (= .cse3 ((_ to_fp 11 53) ~CRM 10.0))) (not (= (_ +zero 11 53) .cse5)) (fp.geq .cse4 .cse5)))) .cse1))) is different from true [2020-10-24 14:51:48,250 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-10-24 14:51:52,632 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-10-24 14:51:59,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 14:51:59,150 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-10-24 14:51:59,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 14:51:59,151 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2020-10-24 14:51:59,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 14:51:59,152 INFO L225 Difference]: With dead ends: 23 [2020-10-24 14:51:59,152 INFO L226 Difference]: Without dead ends: 17 [2020-10-24 14:51:59,153 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 74.4s TimeCoverageRelationStatistics Valid=39, Invalid=48, Unknown=17, NotChecked=276, Total=380 [2020-10-24 14:51:59,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-10-24 14:51:59,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-10-24 14:51:59,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-10-24 14:51:59,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-10-24 14:51:59,157 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2020-10-24 14:51:59,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 14:51:59,157 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-10-24 14:51:59,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 14:51:59,157 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-10-24 14:51:59,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-24 14:51:59,158 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:51:59,159 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:51:59,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-24 14:51:59,367 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:51:59,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:51:59,369 INFO L82 PathProgramCache]: Analyzing trace with hash 905828593, now seen corresponding path program 1 times [2020-10-24 14:51:59,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 14:51:59,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317491697] [2020-10-24 14:51:59,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 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-10-24 14:51:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 14:51:59,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-24 14:51:59,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 14:51:59,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:52:00,231 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2020-10-24 14:52:00,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:52:00,651 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-10-24 14:52:00,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:52:01,131 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-10-24 14:52:01,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:52:01,522 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2020-10-24 14:52:29,796 WARN L193 SmtUtils]: Spent 13.53 s on a formula simplification that was a NOOP. DAG size: 46 [2020-10-24 14:52:31,868 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (v_prenex_4 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64))) (let ((.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)))) (let ((.cse3 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse4 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4))) (.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|))) (.cse5 (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 .cse2 .cse2)) (.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)))) (and (= .cse0 .cse1) (fp.geq .cse2 .cse3) (= .cse4 ((_ to_fp 11 53) c_~CRM 10.0)) (= (_ +zero 11 53) .cse3) (= ((_ to_fp 11 53) c_~CRM 2.0) .cse5) (fp.leq .cse2 .cse4) (= (fp.add c_~CRM .cse0 .cse5) (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 .cse6) (= .cse7 (fp.sub c_~CRM .cse6 .cse2)) (not (fp.geq .cse7 ((_ to_fp 11 53) c_~CRM (_ bv0 32))))))))) is different from false [2020-10-24 14:52:31,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:52:31,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:52:31,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:52:38,188 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (v_prenex_4 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ 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))) (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)))) (let ((.cse2 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse3 (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|))) (.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 .cse1 .cse1)) (.cse4 (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_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse0) (fp.geq .cse1 .cse2) (= .cse3 (fp.sub roundNearestTiesToEven .cse4 .cse1)) (= (_ +zero 11 53) .cse2) (fp.leq .cse5 .cse6) (fp.leq .cse1 .cse7) (not (fp.geq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (= .cse8 .cse9) (= .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= (fp.add roundNearestTiesToEven .cse8 .cse0) .cse5) (= .cse9 .cse4) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse7))))) |c_ULTIMATE.start_main_#t~short20|) (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (v_prenex_4 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ 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))) (let ((.cse11 (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 ((.cse12 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse13 (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|))) (.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 .cse11 .cse11)) (.cse14 (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|))) (.cse15 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse10) (fp.geq .cse11 .cse12) (= .cse13 (fp.sub roundNearestTiesToEven .cse14 .cse11)) (= (_ +zero 11 53) .cse12) (fp.leq .cse11 .cse15) (not (fp.geq .cse13 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.leq .cse16 .cse17)) (= .cse18 .cse19) (= .cse17 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= (fp.add roundNearestTiesToEven .cse18 .cse10) .cse16) (= .cse19 .cse14) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse15))))))) is different from false [2020-10-24 14:52:40,245 WARN L860 $PredicateComparison]: unable to prove that (or (and (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (v_prenex_4 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ 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))) (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)))) (let ((.cse2 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse3 (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|))) (.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 .cse1 .cse1)) (.cse4 (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_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse0) (fp.geq .cse1 .cse2) (= .cse3 (fp.sub roundNearestTiesToEven .cse4 .cse1)) (= (_ +zero 11 53) .cse2) (fp.leq .cse5 .cse6) (fp.leq .cse1 .cse7) (not (fp.geq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (= .cse8 .cse9) (= .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= (fp.add roundNearestTiesToEven .cse8 .cse0) .cse5) (= .cse9 .cse4) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse7))))) |c_ULTIMATE.start_main_#t~short20|) (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (v_prenex_4 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ 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))) (let ((.cse11 (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 ((.cse12 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse13 (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|))) (.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 .cse11 .cse11)) (.cse14 (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|))) (.cse15 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse10) (fp.geq .cse11 .cse12) (= .cse13 (fp.sub roundNearestTiesToEven .cse14 .cse11)) (= (_ +zero 11 53) .cse12) (fp.leq .cse11 .cse15) (not (fp.geq .cse13 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.leq .cse16 .cse17)) (= .cse18 .cse19) (= .cse17 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= (fp.add roundNearestTiesToEven .cse18 .cse10) .cse16) (= .cse19 .cse14) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse15))))))) is different from true [2020-10-24 14:52:40,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:52:54,769 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_6 (_ BitVec 64)) (v_prenex_7 (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (v_prenex_8 (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9)))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse1 (fp.mul roundNearestTiesToEven .cse7 .cse7)) (.cse8 (fp ((_ extract 63 63) v_prenex_6) ((_ extract 62 52) v_prenex_6) ((_ extract 51 0) v_prenex_6))) (.cse4 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (.cse6 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse3 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13))) (.cse2 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5))) (.cse5 (fp ((_ extract 63 63) v_prenex_8) ((_ extract 62 52) v_prenex_8) ((_ extract 51 0) v_prenex_8))) (.cse9 (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7)))) (and (= .cse0 .cse1) (not (fp.geq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (= (fp.add roundNearestTiesToEven .cse0 .cse3) .cse4) (= .cse5 .cse1) (= ((_ to_fp 11 53) roundNearestTiesToEven 4.0) .cse6) (fp.leq .cse7 .cse8) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse8) (not (fp.leq .cse4 .cse6)) (fp.geq .cse7 .cse9) (= .cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (= .cse2 (fp.sub roundNearestTiesToEven .cse5 .cse7)) (= (_ +zero 11 53) .cse9))))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (and (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (v_prenex_4 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ 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))) (let ((.cse11 (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 ((.cse12 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse13 (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))) (.cse16 (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|))) (.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|))) (.cse15 (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 .cse11 .cse11)) (.cse14 (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|))) (.cse17 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse10) (fp.geq .cse11 .cse12) (= .cse13 (fp.sub roundNearestTiesToEven .cse14 .cse11)) (= (_ +zero 11 53) .cse12) (fp.leq .cse15 .cse16) (fp.leq .cse11 .cse17) (not (fp.geq .cse13 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (= .cse18 .cse19) (= .cse16 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= (fp.add roundNearestTiesToEven .cse18 .cse10) .cse15) (= .cse19 .cse14) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse17))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)))) is different from false [2020-10-24 14:53:00,990 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 (_ BitVec 64)) (v_prenex_7 (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (v_prenex_8 (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9)))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse1 (fp.mul roundNearestTiesToEven .cse7 .cse7)) (.cse8 (fp ((_ extract 63 63) v_prenex_6) ((_ extract 62 52) v_prenex_6) ((_ extract 51 0) v_prenex_6))) (.cse4 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (.cse6 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse3 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13))) (.cse2 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5))) (.cse5 (fp ((_ extract 63 63) v_prenex_8) ((_ extract 62 52) v_prenex_8) ((_ extract 51 0) v_prenex_8))) (.cse9 (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7)))) (and (= .cse0 .cse1) (not (fp.geq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (= (fp.add roundNearestTiesToEven .cse0 .cse3) .cse4) (= .cse5 .cse1) (= ((_ to_fp 11 53) roundNearestTiesToEven 4.0) .cse6) (fp.leq .cse7 .cse8) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse8) (not (fp.leq .cse4 .cse6)) (fp.geq .cse7 .cse9) (= .cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (= .cse2 (fp.sub roundNearestTiesToEven .cse5 .cse7)) (= (_ +zero 11 53) .cse9))))) is different from false [2020-10-24 14:53:03,038 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_prenex_6 (_ BitVec 64)) (v_prenex_7 (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (v_prenex_8 (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9)))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse1 (fp.mul roundNearestTiesToEven .cse7 .cse7)) (.cse8 (fp ((_ extract 63 63) v_prenex_6) ((_ extract 62 52) v_prenex_6) ((_ extract 51 0) v_prenex_6))) (.cse4 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (.cse6 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse3 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13))) (.cse2 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5))) (.cse5 (fp ((_ extract 63 63) v_prenex_8) ((_ extract 62 52) v_prenex_8) ((_ extract 51 0) v_prenex_8))) (.cse9 (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7)))) (and (= .cse0 .cse1) (not (fp.geq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (= (fp.add roundNearestTiesToEven .cse0 .cse3) .cse4) (= .cse5 .cse1) (= ((_ to_fp 11 53) roundNearestTiesToEven 4.0) .cse6) (fp.leq .cse7 .cse8) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse8) (not (fp.leq .cse4 .cse6)) (fp.geq .cse7 .cse9) (= .cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (= .cse2 (fp.sub roundNearestTiesToEven .cse5 .cse7)) (= (_ +zero 11 53) .cse9))))) is different from true [2020-10-24 14:53:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:53:03,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 14:53:12,342 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-10-24 14:53:45,100 WARN L193 SmtUtils]: Spent 10.44 s on a formula simplification that was a NOOP. DAG size: 64 [2020-10-24 14:54:19,289 WARN L193 SmtUtils]: Spent 12.29 s on a formula simplification that was a NOOP. DAG size: 66 [2020-10-24 14:54:19,297 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-24 14:54:19,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 14:54:21,393 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-10-24 14:54:23,492 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-10-24 14:54:25,564 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-10-24 14:54:27,618 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-10-24 14:54:27,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:54:27,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317491697] [2020-10-24 14:54:27,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 14:54:27,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 20 [2020-10-24 14:54:27,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981141564] [2020-10-24 14:54:27,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-24 14:54:27,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 14:54:27,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-24 14:54:27,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=107, Unknown=35, NotChecked=232, Total=420 [2020-10-24 14:54:27,624 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 21 states. [2020-10-24 14:54:33,558 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-10-24 14:55:08,441 WARN L193 SmtUtils]: Spent 25.10 s on a formula simplification that was a NOOP. DAG size: 98 [2020-10-24 14:55:39,699 WARN L193 SmtUtils]: Spent 19.90 s on a formula simplification that was a NOOP. DAG size: 96 [2020-10-24 14:56:54,772 WARN L193 SmtUtils]: Spent 1.09 m on a formula simplification. DAG size of input: 121 DAG size of output: 112 [2020-10-24 14:57:24,973 WARN L193 SmtUtils]: Spent 15.46 s on a formula simplification that was a NOOP. DAG size: 88 [2020-10-24 14:57:31,795 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_3 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3)))) (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)))) (= 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_4 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4)))) (and (= .cse3 ((_ to_fp 11 53) c_~CRM 10.0)) (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)))) (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 ((.cse5 (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) 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~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 .cse4 .cse5) .cse6)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse5)) (not (= .cse7 ((_ to_fp 11 53) c_~CRM 4.0))) (fp.leq .cse6 .cse7) (not (= .cse4 (let ((.cse8 (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 .cse8 .cse8))))))) (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 false [2020-10-24 14:57:33,848 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_3 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3)))) (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)))) (= 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_4 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4)))) (and (= .cse3 ((_ to_fp 11 53) c_~CRM 10.0)) (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)))) (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 ((.cse5 (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) 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~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 .cse4 .cse5) .cse6)) (not (= ((_ to_fp 11 53) c_~CRM 2.0) .cse5)) (not (= .cse7 ((_ to_fp 11 53) c_~CRM 4.0))) (fp.leq .cse6 .cse7) (not (= .cse4 (let ((.cse8 (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 .cse8 .cse8))))))) (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-10-24 14:57:42,888 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_prenex_4 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ 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_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse5 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4))) (.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|))) (.cse6 (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 .cse3 .cse3)) (.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|))) (.cse8 (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)))) (and (= .cse1 .cse2) (fp.geq .cse3 .cse4) (= .cse5 ((_ to_fp 11 53) c_~CRM 10.0)) (= (_ +zero 11 53) .cse4) (= ((_ to_fp 11 53) c_~CRM 2.0) .cse6) (fp.leq .cse3 .cse5) (= (fp.add c_~CRM .cse1 .cse6) (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 .cse7) (= .cse8 (fp.sub c_~CRM .cse7 .cse3)) (not (fp.geq .cse8 ((_ to_fp 11 53) c_~CRM (_ bv0 32))))))))) is different from false [2020-10-24 14:57:49,816 WARN L838 $PredicateComparison]: unable to prove that (and |c_ULTIMATE.start_main_#t~short20| (or (and (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (v_prenex_4 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ 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))) (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)))) (let ((.cse2 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse3 (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|))) (.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 .cse1 .cse1)) (.cse4 (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_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse0) (fp.geq .cse1 .cse2) (= .cse3 (fp.sub roundNearestTiesToEven .cse4 .cse1)) (= (_ +zero 11 53) .cse2) (fp.leq .cse5 .cse6) (fp.leq .cse1 .cse7) (not (fp.geq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (= .cse8 .cse9) (= .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= (fp.add roundNearestTiesToEven .cse8 .cse0) .cse5) (= .cse9 .cse4) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse7))))) |c_ULTIMATE.start_main_#t~short20|) (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (v_prenex_4 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ 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))) (let ((.cse11 (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 ((.cse12 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse13 (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|))) (.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 .cse11 .cse11)) (.cse14 (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|))) (.cse15 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse10) (fp.geq .cse11 .cse12) (= .cse13 (fp.sub roundNearestTiesToEven .cse14 .cse11)) (= (_ +zero 11 53) .cse12) (fp.leq .cse11 .cse15) (not (fp.geq .cse13 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.leq .cse16 .cse17)) (= .cse18 .cse19) (= .cse17 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= (fp.add roundNearestTiesToEven .cse18 .cse10) .cse16) (= .cse19 .cse14) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse15)))))))) is different from false [2020-10-24 14:57:54,112 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (not .cse0) (or (and (exists ((v_prenex_6 (_ BitVec 64)) (v_prenex_7 (_ BitVec 64)) (v_prenex_5 (_ BitVec 64)) (v_prenex_12 (_ BitVec 64)) (v_prenex_11 (_ BitVec 64)) (v_prenex_13 (_ BitVec 64)) (v_prenex_10 (_ BitVec 64)) (v_prenex_8 (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse8 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9)))) (let ((.cse1 (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12))) (.cse2 (fp.mul roundNearestTiesToEven .cse8 .cse8)) (.cse9 (fp ((_ extract 63 63) v_prenex_6) ((_ extract 62 52) v_prenex_6) ((_ extract 51 0) v_prenex_6))) (.cse5 (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (.cse7 (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (.cse4 (fp ((_ extract 63 63) v_prenex_13) ((_ extract 62 52) v_prenex_13) ((_ extract 51 0) v_prenex_13))) (.cse3 (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5))) (.cse6 (fp ((_ extract 63 63) v_prenex_8) ((_ extract 62 52) v_prenex_8) ((_ extract 51 0) v_prenex_8))) (.cse10 (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7)))) (and (= .cse1 .cse2) (not (fp.geq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (= (fp.add roundNearestTiesToEven .cse1 .cse4) .cse5) (= .cse6 .cse2) (= ((_ to_fp 11 53) roundNearestTiesToEven 4.0) .cse7) (fp.leq .cse8 .cse9) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse9) (not (fp.leq .cse5 .cse7)) (fp.geq .cse8 .cse10) (= .cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (= .cse3 (fp.sub roundNearestTiesToEven .cse6 .cse8)) (= (_ +zero 11 53) .cse10))))) .cse0) (and (exists ((v_ULTIMATE.start_main_~y~0_19 (_ BitVec 64)) (v_prenex_4 (_ BitVec 64)) (v_prenex_3 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet11_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ 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))) (let ((.cse12 (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 ((.cse13 (fp ((_ extract 63 63) v_prenex_3) ((_ extract 62 52) v_prenex_3) ((_ extract 51 0) v_prenex_3))) (.cse14 (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|))) (.cse19 (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|))) (.cse11 (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))) (.cse20 (fp.mul roundNearestTiesToEven .cse12 .cse12)) (.cse15 (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|))) (.cse18 (fp ((_ extract 63 63) v_prenex_4) ((_ extract 62 52) v_prenex_4) ((_ extract 51 0) v_prenex_4)))) (and (= ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse11) (fp.geq .cse12 .cse13) (= .cse14 (fp.sub roundNearestTiesToEven .cse15 .cse12)) (= (_ +zero 11 53) .cse13) (fp.leq .cse16 .cse17) (fp.leq .cse12 .cse18) (not (fp.geq .cse14 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (= .cse19 .cse20) (= .cse17 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (= (fp.add roundNearestTiesToEven .cse19 .cse11) .cse16) (= .cse20 .cse15) (= ((_ to_fp 11 53) roundNearestTiesToEven 10.0) .cse18))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)))))) is different from false [2020-10-24 14:57:54,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 14:57:54,238 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-10-24 14:57:54,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 14:57:54,245 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 12 [2020-10-24 14:57:54,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 14:57:54,247 INFO L225 Difference]: With dead ends: 23 [2020-10-24 14:57:54,247 INFO L226 Difference]: Without dead ends: 19 [2020-10-24 14:57:54,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 299.1s TimeCoverageRelationStatistics Valid=76, Invalid=194, Unknown=54, NotChecked=546, Total=870 [2020-10-24 14:57:54,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-10-24 14:57:54,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-10-24 14:57:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-24 14:57:54,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-10-24 14:57:54,254 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2020-10-24 14:57:54,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 14:57:54,254 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-10-24 14:57:54,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-24 14:57:54,254 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-10-24 14:57:54,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-24 14:57:54,255 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 14:57:54,255 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 14:57:54,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-24 14:57:54,456 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 14:57:54,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 14:57:54,457 INFO L82 PathProgramCache]: Analyzing trace with hash 905888175, now seen corresponding path program 1 times [2020-10-24 14:57:54,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 14:57:54,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970398913] [2020-10-24 14:57:54,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 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-10-24 14:57:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 14:57:54,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-24 14:57:54,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 14:57:56,991 WARN L193 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 28 DAG size of output: 20 [2020-10-24 14:57:56,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:57:58,862 WARN L193 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2020-10-24 14:57:58,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:57:59,564 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2020-10-24 14:58:01,638 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_prenex_14 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ 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)) (= .cse0 (fp.mul roundNearestTiesToEven .cse2 .cse2)) (fp.leq .cse2 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14)))))) is different from false [2020-10-24 14:58:02,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 14:58:09,131 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_14 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ 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|))) (.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))) (.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.add roundNearestTiesToEven .cse0 .cse1) .cse2) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (fp.geq .cse2 .cse3) (= .cse0 (fp.mul roundNearestTiesToEven .cse4 .cse4)) (fp.leq .cse4 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14))) (= (_ +zero 11 53) .cse3)))) |c_ULTIMATE.start_main_#t~short20|) (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((v_prenex_14 (_ BitVec 64)) (|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_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)) (= .cse5 (fp.mul roundNearestTiesToEven .cse8 .cse8)) (fp.leq .cse8 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14))) (= (_ +zero 11 53) .cse9) (not (fp.geq .cse7 .cse9))))))) is different from false [2020-10-24 14:58:11,176 WARN L860 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_14 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ 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|))) (.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))) (.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.add roundNearestTiesToEven .cse0 .cse1) .cse2) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (fp.geq .cse2 .cse3) (= .cse0 (fp.mul roundNearestTiesToEven .cse4 .cse4)) (fp.leq .cse4 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14))) (= (_ +zero 11 53) .cse3)))) |c_ULTIMATE.start_main_#t~short20|) (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((v_prenex_14 (_ BitVec 64)) (|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_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)) (= .cse5 (fp.mul roundNearestTiesToEven .cse8 .cse8)) (fp.leq .cse8 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14))) (= (_ +zero 11 53) .cse9) (not (fp.geq .cse7 .cse9))))))) is different from true [2020-10-24 14:58:17,369 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_prenex_14 (_ BitVec 64)) (|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_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)) (= .cse0 (fp.mul roundNearestTiesToEven .cse3 .cse3)) (fp.leq .cse3 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14))) (= (_ +zero 11 53) .cse4) (not (fp.geq .cse2 .cse4))))) is different from false [2020-10-24 14:58:19,416 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_prenex_14 (_ BitVec 64)) (|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_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)) (= .cse0 (fp.mul roundNearestTiesToEven .cse3 .cse3)) (fp.leq .cse3 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14))) (= (_ +zero 11 53) .cse4) (not (fp.geq .cse2 .cse4))))) is different from true [2020-10-24 14:58:27,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:58:27,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 14:58:41,711 WARN L193 SmtUtils]: Spent 687.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2020-10-24 14:58:43,818 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-10-24 14:58:43,824 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-24 14:58:43,824 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 14:58:45,913 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-10-24 14:58:47,994 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-10-24 14:58:50,042 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-10-24 14:58:50,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 14:58:50,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970398913] [2020-10-24 14:58:50,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 14:58:50,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 14 [2020-10-24 14:58:50,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080880791] [2020-10-24 14:58:50,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 14:58:50,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 14:58:50,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 14:58:50,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=55, Unknown=10, NotChecked=114, Total=210 [2020-10-24 14:58:50,055 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 15 states. [2020-10-24 14:58:53,758 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-10-24 14:59:16,573 WARN L193 SmtUtils]: Spent 15.66 s on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-10-24 14:59:39,975 WARN L193 SmtUtils]: Spent 17.82 s on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2020-10-24 14:59:45,563 WARN L193 SmtUtils]: Spent 4.71 s on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2020-10-24 14:59:53,923 WARN L193 SmtUtils]: Spent 4.35 s on a formula simplification. DAG size of input: 52 DAG size of output: 45 [2020-10-24 14:59:58,159 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_prenex_14 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ 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)) (= .cse1 (fp.mul roundNearestTiesToEven .cse3 .cse3)) (fp.leq .cse3 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14))))))) is different from false [2020-10-24 15:00:04,198 WARN L838 $PredicateComparison]: unable to prove that (and |c_ULTIMATE.start_main_#t~short20| (or (and (exists ((v_prenex_14 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_10| (_ BitVec 64)) (|ULTIMATE.start_main_#t~nondet18| (_ BitVec 64)) (ULTIMATE.start_main_~x~0 (_ BitVec 64)) (ULTIMATE.start_main_~y~0 (_ 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|))) (.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))) (.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.add roundNearestTiesToEven .cse0 .cse1) .cse2) (= .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (fp.geq .cse2 .cse3) (= .cse0 (fp.mul roundNearestTiesToEven .cse4 .cse4)) (fp.leq .cse4 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14))) (= (_ +zero 11 53) .cse3)))) |c_ULTIMATE.start_main_#t~short20|) (and (not |c_ULTIMATE.start_main_#t~short20|) (exists ((v_prenex_14 (_ BitVec 64)) (|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_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)) (= .cse5 (fp.mul roundNearestTiesToEven .cse8 .cse8)) (fp.leq .cse8 (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14))) (= (_ +zero 11 53) .cse9) (not (fp.geq .cse7 .cse9)))))))) is different from false [2020-10-24 15:00:05,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:00:05,930 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-10-24 15:00:05,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 15:00:05,932 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2020-10-24 15:00:05,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:00:05,932 INFO L225 Difference]: With dead ends: 23 [2020-10-24 15:00:05,932 INFO L226 Difference]: Without dead ends: 13 [2020-10-24 15:00:05,933 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 101.2s TimeCoverageRelationStatistics Valid=63, Invalid=113, Unknown=16, NotChecked=270, Total=462 [2020-10-24 15:00:05,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-10-24 15:00:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-10-24 15:00:05,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-24 15:00:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-10-24 15:00:05,936 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2020-10-24 15:00:05,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:00:05,936 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-10-24 15:00:05,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 15:00:05,936 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-10-24 15:00:05,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-24 15:00:05,936 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:00:05,937 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:00:06,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-24 15:00:06,138 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:00:06,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:00:06,139 INFO L82 PathProgramCache]: Analyzing trace with hash 455543281, now seen corresponding path program 1 times [2020-10-24 15:00:06,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:00:06,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979268842] [2020-10-24 15:00:06,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 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-10-24 15:00:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:00:07,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-24 15:00:07,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:00:07,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:00:07,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:00:07,669 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-24 15:00:07,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 15:00:07,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-10-24 15:00:07,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979268842] [2020-10-24 15:00:07,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:00:07,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-24 15:00:07,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178004136] [2020-10-24 15:00:07,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:00:07,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:00:07,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:00:07,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:00:07,685 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 4 states. [2020-10-24 15:00:07,963 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2020-10-24 15:00:07,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:00:07,964 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-10-24 15:00:07,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:00:07,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-24 15:00:07,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:00:07,964 INFO L225 Difference]: With dead ends: 13 [2020-10-24 15:00:07,965 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 15:00:07,965 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-10-24 15:00:07,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 15:00:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 15:00:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 15:00:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 15:00:07,966 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2020-10-24 15:00:07,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:00:07,967 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 15:00:07,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:00:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 15:00:07,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 15:00:08,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-24 15:00:08,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 15:00:08,221 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-24 15:00:08,221 INFO L274 CegarLoopResult]: For program point L27(line 27) no Hoare annotation was computed. [2020-10-24 15:00:08,221 INFO L274 CegarLoopResult]: For program point L27-2(line 27) no Hoare annotation was computed. [2020-10-24 15:00:08,221 INFO L274 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-10-24 15:00:08,221 INFO L274 CegarLoopResult]: For program point L21-2(line 21) no Hoare annotation was computed. [2020-10-24 15:00:08,221 INFO L274 CegarLoopResult]: For program point L11(lines 11 13) no Hoare annotation was computed. [2020-10-24 15:00:08,221 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-24 15:00:08,222 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-24 15:00:08,222 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-24 15:00:08,222 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-24 15:00:08,223 INFO L277 CegarLoopResult]: At program point L28(lines 16 29) the Hoare annotation is: true [2020-10-24 15:00:08,223 INFO L274 CegarLoopResult]: For program point L24(lines 24 25) no Hoare annotation was computed. [2020-10-24 15:00:08,223 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-24 15:00:08,223 INFO L274 CegarLoopResult]: For program point L24-2(lines 24 25) no Hoare annotation was computed. [2020-10-24 15:00:08,223 INFO L274 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-10-24 15:00:08,223 INFO L274 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-10-24 15:00:08,223 INFO L274 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-10-24 15:00:08,223 INFO L277 CegarLoopResult]: At program point L14-3(line 14) the Hoare annotation is: true [2020-10-24 15:00:08,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:00:08 BoogieIcfgContainer [2020-10-24 15:00:08,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 15:00:08,233 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 15:00:08,233 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 15:00:08,234 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 15:00:08,234 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:48:02" (3/4) ... [2020-10-24 15:00:08,238 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-24 15:00:08,250 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-10-24 15:00:08,250 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-10-24 15:00:08,251 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-10-24 15:00:08,251 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-24 15:00:08,303 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-24 15:00:08,303 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 15:00:08,305 INFO L168 Benchmark]: Toolchain (without parser) took 728949.77 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 18.9 MB in the beginning and 22.3 MB in the end (delta: -3.3 MB). Peak memory consumption was 8.7 MB. Max. memory is 16.1 GB. [2020-10-24 15:00:08,305 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 41.9 MB. Free memory is still 24.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 15:00:08,306 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.67 ms. Allocated memory is still 41.9 MB. Free memory was 18.3 MB in the beginning and 17.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. [2020-10-24 15:00:08,307 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.69 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 17.1 MB in the beginning and 33.5 MB in the end (delta: -16.4 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. [2020-10-24 15:00:08,307 INFO L168 Benchmark]: Boogie Preprocessor took 34.08 ms. Allocated memory is still 50.3 MB. Free memory was 33.5 MB in the beginning and 32.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 15:00:08,308 INFO L168 Benchmark]: RCFGBuilder took 3140.85 ms. Allocated memory is still 50.3 MB. Free memory was 32.0 MB in the beginning and 29.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 11.4 MB. Max. memory is 16.1 GB. [2020-10-24 15:00:08,309 INFO L168 Benchmark]: TraceAbstraction took 725317.64 ms. Allocated memory is still 50.3 MB. Free memory was 29.7 MB in the beginning and 24.7 MB in the end (delta: 4.9 MB). Peak memory consumption was 3.7 MB. Max. memory is 16.1 GB. [2020-10-24 15:00:08,310 INFO L168 Benchmark]: Witness Printer took 69.89 ms. Allocated memory is still 50.3 MB. Free memory was 24.7 MB in the beginning and 22.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 15:00:08,313 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.29 ms. Allocated memory is still 41.9 MB. Free memory is still 24.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 312.67 ms. Allocated memory is still 41.9 MB. Free memory was 18.3 MB in the beginning and 17.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 57.69 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 17.1 MB in the beginning and 33.5 MB in the end (delta: -16.4 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.08 ms. Allocated memory is still 50.3 MB. Free memory was 33.5 MB in the beginning and 32.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3140.85 ms. Allocated memory is still 50.3 MB. Free memory was 32.0 MB in the beginning and 29.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 11.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 725317.64 ms. Allocated memory is still 50.3 MB. Free memory was 29.7 MB in the beginning and 24.7 MB in the end (delta: 4.9 MB). Peak memory consumption was 3.7 MB. Max. memory is 16.1 GB. * Witness Printer took 69.89 ms. Allocated memory is still 50.3 MB. Free memory was 24.7 MB in the beginning and 22.3 MB in the end (delta: 2.5 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: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() 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, 18 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 725.1s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 419.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 59 SDtfs, 23 SDslu, 159 SDs, 0 SdLazy, 138 SolverSat, 3 SolverUnsat, 18 SolverUnknown, 0 SolverNotchecked, 62.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 48 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 580.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.6s SatisfiabilityAnalysisTime, 298.1s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 132 ConstructedInterpolants, 68 QuantifiedInterpolants, 76472 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...