./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/float-benchs/zonotope_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2880296f Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/zonotope_3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a5dffb498932fa19bfb8df7529bb98a7b6aae21c ................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/zonotope_3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a5dffb498932fa19bfb8df7529bb98a7b6aae21c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.0-2880296 [2020-12-02 14:55:59,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 14:55:59,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 14:55:59,420 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 14:55:59,420 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 14:55:59,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 14:55:59,424 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 14:55:59,427 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 14:55:59,429 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 14:55:59,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 14:55:59,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 14:55:59,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 14:55:59,435 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 14:55:59,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 14:55:59,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 14:55:59,439 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 14:55:59,441 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 14:55:59,442 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 14:55:59,444 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 14:55:59,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 14:55:59,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 14:55:59,452 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 14:55:59,453 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 14:55:59,454 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 14:55:59,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 14:55:59,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 14:55:59,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 14:55:59,460 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 14:55:59,461 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 14:55:59,462 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 14:55:59,462 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 14:55:59,463 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 14:55:59,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 14:55:59,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 14:55:59,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 14:55:59,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 14:55:59,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 14:55:59,482 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 14:55:59,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 14:55:59,484 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 14:55:59,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 14:55:59,486 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 14:55:59,514 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 14:55:59,515 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 14:55:59,517 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 14:55:59,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 14:55:59,517 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 14:55:59,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 14:55:59,518 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 14:55:59,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 14:55:59,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 14:55:59,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 14:55:59,519 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 14:55:59,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 14:55:59,520 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 14:55:59,520 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 14:55:59,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 14:55:59,521 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 14:55:59,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 14:55:59,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 14:55:59,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 14:55:59,522 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 14:55:59,522 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 14:55:59,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 14:55:59,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 14:55:59,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 14:55:59,523 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 14:55:59,523 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 14:55:59,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 14:55:59,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 14:55:59,524 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 14:55:59,524 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a5dffb498932fa19bfb8df7529bb98a7b6aae21c [2020-12-02 14:55:59,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 14:55:59,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 14:55:59,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 14:55:59,992 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 14:55:59,994 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 14:55:59,996 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/zonotope_3.c [2020-12-02 14:56:00,088 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85949492f/93df7e40f6294e38938ac055a31ceff5/FLAG3af212df6 [2020-12-02 14:56:00,806 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 14:56:00,807 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/zonotope_3.c [2020-12-02 14:56:00,817 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85949492f/93df7e40f6294e38938ac055a31ceff5/FLAG3af212df6 [2020-12-02 14:56:01,142 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85949492f/93df7e40f6294e38938ac055a31ceff5 [2020-12-02 14:56:01,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 14:56:01,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 14:56:01,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 14:56:01,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 14:56:01,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 14:56:01,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:56:01" (1/1) ... [2020-12-02 14:56:01,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74418adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:01, skipping insertion in model container [2020-12-02 14:56:01,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:56:01" (1/1) ... [2020-12-02 14:56:01,178 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 14:56:01,206 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-12-02 14:56:01,392 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/zonotope_3.c[604,617] [2020-12-02 14:56:01,404 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: conversion from bitvector to float not supported in non-bitprecise translation at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.transformBitvectorToFloat(IntegerTranslation.java:919) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.ExpressionTranslation.constructUnaryExpression(ExpressionTranslation.java:141) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CExpressionTranslator.handleUnaryArithmeticOperators(CExpressionTranslator.java:407) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2351) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:303) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:704) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleReturnStatement(FunctionHandler.java:540) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1970) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1044) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1422) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3209) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2291) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:578) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:201) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:116) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-02 14:56:01,411 INFO L168 Benchmark]: Toolchain (without parser) took 262.28 ms. Allocated memory is still 41.9 MB. Free memory was 20.1 MB in the beginning and 21.3 MB in the end (delta: -1.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2020-12-02 14:56:01,413 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 41.9 MB. Free memory was 22.6 MB in the beginning and 22.5 MB in the end (delta: 70.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 14:56:01,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.56 ms. Allocated memory is still 41.9 MB. Free memory was 19.8 MB in the beginning and 21.3 MB in the end (delta: -1.5 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2020-12-02 14:56:01,417 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.48 ms. Allocated memory is still 41.9 MB. Free memory was 22.6 MB in the beginning and 22.5 MB in the end (delta: 70.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 258.56 ms. Allocated memory is still 41.9 MB. Free memory was 19.8 MB in the beginning and 21.3 MB in the end (delta: -1.5 MB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: conversion from bitvector to float not supported in non-bitprecise translation de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: conversion from bitvector to float not supported in non-bitprecise translation: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.transformBitvectorToFloat(IntegerTranslation.java:919) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-2880296 [2020-12-02 14:56:04,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 14:56:04,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 14:56:04,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 14:56:04,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 14:56:04,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 14:56:04,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 14:56:04,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 14:56:04,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 14:56:04,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 14:56:04,062 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 14:56:04,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 14:56:04,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 14:56:04,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 14:56:04,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 14:56:04,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 14:56:04,071 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 14:56:04,072 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 14:56:04,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 14:56:04,078 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 14:56:04,080 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 14:56:04,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 14:56:04,087 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 14:56:04,089 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 14:56:04,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 14:56:04,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 14:56:04,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 14:56:04,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 14:56:04,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 14:56:04,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 14:56:04,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 14:56:04,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 14:56:04,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 14:56:04,118 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 14:56:04,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 14:56:04,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 14:56:04,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 14:56:04,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 14:56:04,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 14:56:04,125 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 14:56:04,126 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 14:56:04,128 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-12-02 14:56:04,201 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 14:56:04,202 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 14:56:04,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 14:56:04,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 14:56:04,208 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 14:56:04,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 14:56:04,208 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 14:56:04,208 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 14:56:04,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 14:56:04,209 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 14:56:04,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 14:56:04,210 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 14:56:04,211 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-02 14:56:04,211 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-02 14:56:04,211 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 14:56:04,211 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 14:56:04,212 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 14:56:04,212 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 14:56:04,212 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 14:56:04,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 14:56:04,213 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-02 14:56:04,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 14:56:04,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 14:56:04,214 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 14:56:04,214 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 14:56:04,214 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 14:56:04,214 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-12-02 14:56:04,215 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-12-02 14:56:04,215 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 14:56:04,215 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 14:56:04,215 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-02 14:56:04,216 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a5dffb498932fa19bfb8df7529bb98a7b6aae21c [2020-12-02 14:56:04,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 14:56:04,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 14:56:04,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 14:56:04,694 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 14:56:04,695 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 14:56:04,697 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/zonotope_3.c [2020-12-02 14:56:04,780 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/035a812be/25981b25be0d4ac8bf7156237fae4ddf/FLAG8c23c9233 [2020-12-02 14:56:05,394 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 14:56:05,395 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/zonotope_3.c [2020-12-02 14:56:05,403 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/035a812be/25981b25be0d4ac8bf7156237fae4ddf/FLAG8c23c9233 [2020-12-02 14:56:05,753 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/035a812be/25981b25be0d4ac8bf7156237fae4ddf [2020-12-02 14:56:05,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 14:56:05,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 14:56:05,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 14:56:05,773 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 14:56:05,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 14:56:05,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:56:05" (1/1) ... [2020-12-02 14:56:05,784 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ad98e5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:05, skipping insertion in model container [2020-12-02 14:56:05,784 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:56:05" (1/1) ... [2020-12-02 14:56:05,796 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 14:56:05,820 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-12-02 14:56:06,008 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/zonotope_3.c[604,617] [2020-12-02 14:56:06,037 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 14:56:06,056 INFO L212 MainTranslator]: Completed pre-run [2020-12-02 14:56:06,074 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/zonotope_3.c[604,617] [2020-12-02 14:56:06,086 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-12-02 14:56:06,108 INFO L217 MainTranslator]: Completed translation [2020-12-02 14:56:06,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:06 WrapperNode [2020-12-02 14:56:06,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 14:56:06,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 14:56:06,111 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 14:56:06,111 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 14:56:06,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:06" (1/1) ... [2020-12-02 14:56:06,135 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:06" (1/1) ... [2020-12-02 14:56:06,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 14:56:06,193 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 14:56:06,194 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 14:56:06,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 14:56:06,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:06" (1/1) ... [2020-12-02 14:56:06,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:06" (1/1) ... [2020-12-02 14:56:06,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:06" (1/1) ... [2020-12-02 14:56:06,235 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:06" (1/1) ... [2020-12-02 14:56:06,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:06" (1/1) ... [2020-12-02 14:56:06,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:06" (1/1) ... [2020-12-02 14:56:06,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:06" (1/1) ... [2020-12-02 14:56:06,297 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 14:56:06,298 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 14:56:06,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 14:56:06,301 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 14:56:06,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 14:56:06,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-02 14:56:06,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 14:56:06,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 14:56:06,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 14:56:06,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.float_to_bitvec_FLOAT [2020-12-02 14:56:10,649 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 14:56:10,649 INFO L298 CfgBuilder]: Removed 25 assume(true) statements. [2020-12-02 14:56:10,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:56:10 BoogieIcfgContainer [2020-12-02 14:56:10,652 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 14:56:10,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 14:56:10,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 14:56:10,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 14:56:10,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:56:05" (1/3) ... [2020-12-02 14:56:10,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18955d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:56:10, skipping insertion in model container [2020-12-02 14:56:10,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:56:06" (2/3) ... [2020-12-02 14:56:10,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18955d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:56:10, skipping insertion in model container [2020-12-02 14:56:10,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:56:10" (3/3) ... [2020-12-02 14:56:10,662 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_3.c [2020-12-02 14:56:10,678 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 14:56:10,683 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-02 14:56:10,696 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-02 14:56:10,725 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 14:56:10,725 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 14:56:10,725 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 14:56:10,725 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 14:56:10,726 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 14:56:10,726 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 14:56:10,726 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 14:56:10,726 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 14:56:10,742 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2020-12-02 14:56:10,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-02 14:56:10,748 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:56:10,749 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:56:10,750 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:56:10,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:56:10,757 INFO L82 PathProgramCache]: Analyzing trace with hash -788440757, now seen corresponding path program 1 times [2020-12-02 14:56:10,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:56:10,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142942458] [2020-12-02 14:56:10,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-02 14:56:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 14:56:11,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-02 14:56:11,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:56:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:56:11,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 14:56:11,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:56:11,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142942458] [2020-12-02 14:56:11,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 14:56:11,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-12-02 14:56:11,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509855146] [2020-12-02 14:56:11,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 14:56:11,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 14:56:11,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 14:56:11,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-02 14:56:11,396 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 4 states. [2020-12-02 14:56:13,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 14:56:13,672 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2020-12-02 14:56:13,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 14:56:13,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-02 14:56:13,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 14:56:13,683 INFO L225 Difference]: With dead ends: 65 [2020-12-02 14:56:13,684 INFO L226 Difference]: Without dead ends: 41 [2020-12-02 14:56:13,687 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-02 14:56:13,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-12-02 14:56:13,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2020-12-02 14:56:13,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-12-02 14:56:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2020-12-02 14:56:13,726 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 12 [2020-12-02 14:56:13,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 14:56:13,726 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2020-12-02 14:56:13,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 14:56:13,726 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2020-12-02 14:56:13,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 14:56:13,727 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:56:13,728 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:56:13,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-02 14:56:13,944 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:56:13,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:56:13,946 INFO L82 PathProgramCache]: Analyzing trace with hash 2085750969, now seen corresponding path program 1 times [2020-12-02 14:56:13,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:56:13,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991321293] [2020-12-02 14:56:13,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-02 14:56:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 14:56:15,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-02 14:56:15,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:56:15,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:56:15,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 14:56:15,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:56:15,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991321293] [2020-12-02 14:56:15,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-02 14:56:15,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-12-02 14:56:15,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338246338] [2020-12-02 14:56:15,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 14:56:15,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 14:56:15,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 14:56:15,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-02 14:56:15,210 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 6 states. [2020-12-02 14:56:19,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 14:56:19,697 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2020-12-02 14:56:19,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 14:56:19,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-12-02 14:56:19,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 14:56:19,700 INFO L225 Difference]: With dead ends: 84 [2020-12-02 14:56:19,701 INFO L226 Difference]: Without dead ends: 78 [2020-12-02 14:56:19,702 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-12-02 14:56:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-12-02 14:56:19,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 53. [2020-12-02 14:56:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-12-02 14:56:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2020-12-02 14:56:19,715 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 22 [2020-12-02 14:56:19,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 14:56:19,715 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2020-12-02 14:56:19,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 14:56:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2020-12-02 14:56:19,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-02 14:56:19,717 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:56:19,718 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:56:19,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-02 14:56:19,932 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:56:19,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:56:19,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1895133973, now seen corresponding path program 2 times [2020-12-02 14:56:19,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:56:19,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840890384] [2020-12-02 14:56:19,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-02 14:56:22,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-02 14:56:22,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-02 14:56:22,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-02 14:56:22,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:56:22,935 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:56:22,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 14:56:23,103 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 14:56:23,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840890384] [2020-12-02 14:56:23,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-02 14:56:23,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2020-12-02 14:56:23,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060361977] [2020-12-02 14:56:23,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 14:56:23,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 14:56:23,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 14:56:23,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-12-02 14:56:23,108 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 10 states. [2020-12-02 14:56:32,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 14:56:32,134 INFO L93 Difference]: Finished difference Result 150 states and 165 transitions. [2020-12-02 14:56:32,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-02 14:56:32,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2020-12-02 14:56:32,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 14:56:32,137 INFO L225 Difference]: With dead ends: 150 [2020-12-02 14:56:32,138 INFO L226 Difference]: Without dead ends: 144 [2020-12-02 14:56:32,139 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2020-12-02 14:56:32,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-12-02 14:56:32,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 93. [2020-12-02 14:56:32,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-12-02 14:56:32,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2020-12-02 14:56:32,158 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 42 [2020-12-02 14:56:32,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 14:56:32,159 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2020-12-02 14:56:32,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 14:56:32,159 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2020-12-02 14:56:32,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-12-02 14:56:32,162 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 14:56:32,163 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 14:56:32,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-02 14:56:32,377 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 14:56:32,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 14:56:32,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1011288627, now seen corresponding path program 3 times [2020-12-02 14:56:32,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 14:56:32,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619004186] [2020-12-02 14:56:32,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-02 14:56:37,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-02 14:56:37,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-02 14:56:37,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 37 conjunts are in the unsatisfiable core [2020-12-02 14:56:37,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:56:37,794 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:56:37,956 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-12-02 14:56:37,975 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:56:37,977 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 14:56:40,112 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= roundNearestTiesToEven c_~CRM)) (.cse1 (exists ((|ULTIMATE.start_main_#t~nondet24| (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet24|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet24|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet24|)))) (and (fp.geq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~x~0) ((_ extract 30 23) c_ULTIMATE.start_main_~x~0) ((_ extract 22 0) c_ULTIMATE.start_main_~x~0)) .cse9) (= .cse9 (_ +zero 8 24)))))) (.cse5 (bvsle c_ULTIMATE.start_main_~i~0 (_ bv100000 32)))) (or (and |c_ULTIMATE.start_main_#t~short28| .cse0 .cse1 (exists ((|ULTIMATE.start_main_#t~nondet27| (_ BitVec 32)) (|ULTIMATE.start_main_#t~nondet25| (_ BitVec 32)) (|ULTIMATE.start_main_#t~nondet26| (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet26|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet26|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet26|))) (.cse2 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet27|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet27|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet27|))) (.cse3 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet25|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet25|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet25|)))) (and (= .cse2 (fp.div c_~CRM .cse3 .cse4)) (= .cse4 ((_ to_fp 8 24) c_~CRM 100000.0)) (fp.leq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~x~0) ((_ extract 30 23) c_ULTIMATE.start_main_~x~0) ((_ extract 22 0) c_ULTIMATE.start_main_~x~0)) .cse2) (= .cse3 ((_ to_fp 8 24) c_~CRM c_ULTIMATE.start_main_~i~0))))) .cse5) (and (exists ((|ULTIMATE.start_main_#t~nondet27| (_ BitVec 32)) (|ULTIMATE.start_main_#t~nondet25| (_ BitVec 32)) (|ULTIMATE.start_main_#t~nondet26| (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet27|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet27|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet27|))) (.cse8 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet26|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet26|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet26|))) (.cse7 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet25|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet25|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet25|)))) (and (= .cse6 (fp.div c_~CRM .cse7 .cse8)) (not (fp.leq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~x~0) ((_ extract 30 23) c_ULTIMATE.start_main_~x~0) ((_ extract 22 0) c_ULTIMATE.start_main_~x~0)) .cse6)) (= .cse8 ((_ to_fp 8 24) c_~CRM 100000.0)) (= .cse7 ((_ to_fp 8 24) c_~CRM c_ULTIMATE.start_main_~i~0))))) (not |c_ULTIMATE.start_main_#t~short28|) .cse0 .cse1 .cse5))) is different from false [2020-12-02 14:56:40,148 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:56:42,298 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= roundNearestTiesToEven c_~CRM)) (.cse5 (bvsle c_ULTIMATE.start_main_~i~0 (_ bv100000 32)))) (or (and (exists ((|ULTIMATE.start_main_#t~nondet27| (_ BitVec 32)) (|ULTIMATE.start_main_#t~nondet25| (_ BitVec 32)) (|ULTIMATE.start_main_#t~nondet26| (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet27|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet27|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet27|))) (.cse2 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet26|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet26|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet26|))) (.cse1 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet25|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet25|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet25|)))) (and (= .cse0 (fp.div c_~CRM .cse1 .cse2)) (not (fp.leq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~x~0) ((_ extract 30 23) c_ULTIMATE.start_main_~x~0) ((_ extract 22 0) c_ULTIMATE.start_main_~x~0)) .cse0)) (= .cse2 ((_ to_fp 8 24) c_~CRM 100000.0)) (= .cse1 ((_ to_fp 8 24) c_~CRM c_ULTIMATE.start_main_~i~0))))) .cse3 (exists ((|ULTIMATE.start_main_#t~nondet24| (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet24|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet24|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet24|)))) (and (fp.geq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~x~0) ((_ extract 30 23) c_ULTIMATE.start_main_~x~0) ((_ extract 22 0) c_ULTIMATE.start_main_~x~0)) .cse4) (= .cse4 (_ +zero 8 24))))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5) (and .cse3 (exists ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse8 (fp ((_ extract 31 31) v_prenex_4) ((_ extract 30 23) v_prenex_4) ((_ extract 22 0) v_prenex_4))) (.cse6 (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1))) (.cse7 (fp ((_ extract 31 31) v_prenex_3) ((_ extract 30 23) v_prenex_3) ((_ extract 22 0) v_prenex_3)))) (and (= .cse6 (fp.div c_~CRM .cse7 .cse8)) (= .cse8 ((_ to_fp 8 24) c_~CRM 100000.0)) (fp.leq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~x~0) ((_ extract 30 23) c_ULTIMATE.start_main_~x~0) ((_ extract 22 0) c_ULTIMATE.start_main_~x~0)) .cse6) (= .cse7 ((_ to_fp 8 24) c_~CRM c_ULTIMATE.start_main_~i~0))))) (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5 (exists ((v_prenex_2 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_prenex_2) ((_ extract 30 23) v_prenex_2) ((_ extract 22 0) v_prenex_2)))) (and (= (_ +zero 8 24) .cse9) (fp.geq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~x~0) ((_ extract 30 23) c_ULTIMATE.start_main_~x~0) ((_ extract 22 0) c_ULTIMATE.start_main_~x~0)) .cse9))))))) is different from false [2020-12-02 14:56:44,357 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_prenex_4) ((_ extract 30 23) v_prenex_4) ((_ extract 22 0) v_prenex_4))) (.cse0 (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1))) (.cse1 (fp ((_ extract 31 31) v_prenex_3) ((_ extract 30 23) v_prenex_3) ((_ extract 22 0) v_prenex_3)))) (and (= .cse0 (fp.div c_~CRM .cse1 .cse2)) (= .cse2 ((_ to_fp 8 24) c_~CRM 100000.0)) (fp.leq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~x~0) ((_ extract 30 23) c_ULTIMATE.start_main_~x~0) ((_ extract 22 0) c_ULTIMATE.start_main_~x~0)) .cse0) (= .cse1 ((_ to_fp 8 24) c_~CRM c_ULTIMATE.start_main_~i~0))))) (bvsle c_ULTIMATE.start_main_~i~0 (_ bv100000 32)) (exists ((v_prenex_2 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) v_prenex_2) ((_ extract 30 23) v_prenex_2) ((_ extract 22 0) v_prenex_2)))) (and (= (_ +zero 8 24) .cse3) (fp.geq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~x~0) ((_ extract 30 23) c_ULTIMATE.start_main_~x~0) ((_ extract 22 0) c_ULTIMATE.start_main_~x~0)) .cse3))))) is different from false [2020-12-02 14:56:46,443 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_prenex_4) ((_ extract 30 23) v_prenex_4) ((_ extract 22 0) v_prenex_4))) (.cse0 (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1))) (.cse1 (fp ((_ extract 31 31) v_prenex_3) ((_ extract 30 23) v_prenex_3) ((_ extract 22 0) v_prenex_3)))) (and (= .cse0 (fp.div c_~CRM .cse1 .cse2)) (= .cse2 ((_ to_fp 8 24) c_~CRM 100000.0)) (fp.leq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~x~0) ((_ extract 30 23) c_ULTIMATE.start_main_~x~0) ((_ extract 22 0) c_ULTIMATE.start_main_~x~0)) .cse0) (= .cse1 ((_ to_fp 8 24) c_~CRM c_ULTIMATE.start_main_~i~0))))) (exists ((|v_ULTIMATE.start_f_#t~nondet7_25| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet8_25| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet9_25| (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet7_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet7_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet7_25|))) (.cse5 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet8_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet8_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet8_25|))) (.cse3 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet9_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet9_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet9_25|)))) (and (= .cse3 ((_ to_fp 8 24) c_~CRM 3.0)) (= (fp.mul c_~CRM .cse4 (fp ((_ extract 31 31) c_ULTIMATE.start_main_~x~0) ((_ extract 30 23) c_ULTIMATE.start_main_~x~0) ((_ extract 22 0) c_ULTIMATE.start_main_~x~0))) .cse5) (= ((_ to_fp 8 24) c_~CRM 2.0) .cse4) (= (fp.sub c_~CRM .cse5 .cse3) (fp ((_ extract 31 31) |c_ULTIMATE.start_f_#res|) ((_ extract 30 23) |c_ULTIMATE.start_f_#res|) ((_ extract 22 0) |c_ULTIMATE.start_f_#res|)))))) (bvsle c_ULTIMATE.start_main_~i~0 (_ bv100000 32)) (exists ((v_prenex_2 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_prenex_2) ((_ extract 30 23) v_prenex_2) ((_ extract 22 0) v_prenex_2)))) (and (= (_ +zero 8 24) .cse6) (fp.geq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~x~0) ((_ extract 30 23) c_ULTIMATE.start_main_~x~0) ((_ extract 22 0) c_ULTIMATE.start_main_~x~0)) .cse6))))) is different from false [2020-12-02 14:56:48,554 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_g_#in~x| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet12_25| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet7_25| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet11_25| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet8_25| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet9_25| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) v_prenex_3) ((_ extract 30 23) v_prenex_3) ((_ extract 22 0) v_prenex_3))) (.cse1 (fp ((_ extract 31 31) v_prenex_2) ((_ extract 30 23) v_prenex_2) ((_ extract 22 0) v_prenex_2))) (.cse4 (fp ((_ extract 31 31) v_prenex_4) ((_ extract 30 23) v_prenex_4) ((_ extract 22 0) v_prenex_4))) (.cse9 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet11_25|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet11_25|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet11_25|))) (.cse5 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet12_25|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet12_25|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet12_25|))) (.cse8 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet8_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet8_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet8_25|))) (.cse0 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet9_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet9_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet9_25|))) (.cse7 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet7_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet7_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet7_25|))) (.cse6 (fp ((_ extract 31 31) |ULTIMATE.start_g_#in~x|) ((_ extract 30 23) |ULTIMATE.start_g_#in~x|) ((_ extract 22 0) |ULTIMATE.start_g_#in~x|))) (.cse2 (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1)))) (and (= .cse0 ((_ to_fp 8 24) c_~CRM 3.0)) (= (_ +zero 8 24) .cse1) (= .cse2 (fp.div c_~CRM .cse3 .cse4)) (= .cse3 ((_ to_fp 8 24) c_~CRM c_ULTIMATE.start_main_~i~0)) (= .cse5 ((_ to_fp 8 24) c_~CRM 5.0)) (fp.geq .cse6 .cse1) (= .cse4 ((_ to_fp 8 24) c_~CRM 100000.0)) (= (fp.mul c_~CRM .cse7 .cse6) .cse8) (= .cse9 (fp.neg .cse6)) (= (fp.add c_~CRM .cse9 .cse5) (fp ((_ extract 31 31) |c_ULTIMATE.start_g_#res|) ((_ extract 30 23) |c_ULTIMATE.start_g_#res|) ((_ extract 22 0) |c_ULTIMATE.start_g_#res|))) (= (fp.sub c_~CRM .cse8 .cse0) (fp ((_ extract 31 31) c_ULTIMATE.start_main_~y~0) ((_ extract 30 23) c_ULTIMATE.start_main_~y~0) ((_ extract 22 0) c_ULTIMATE.start_main_~y~0))) (= ((_ to_fp 8 24) c_~CRM 2.0) .cse7) (fp.leq .cse6 .cse2)))) (= roundNearestTiesToEven c_~CRM) (bvsle c_ULTIMATE.start_main_~i~0 (_ bv100000 32))) is different from false [2020-12-02 14:56:50,641 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((|ULTIMATE.start_g_#in~x| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet12_25| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet7_25| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet11_25| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet8_25| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet9_25| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) v_prenex_3) ((_ extract 30 23) v_prenex_3) ((_ extract 22 0) v_prenex_3))) (.cse6 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet12_25|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet12_25|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet12_25|))) (.cse1 (fp ((_ extract 31 31) v_prenex_2) ((_ extract 30 23) v_prenex_2) ((_ extract 22 0) v_prenex_2))) (.cse4 (fp ((_ extract 31 31) v_prenex_4) ((_ extract 30 23) v_prenex_4) ((_ extract 22 0) v_prenex_4))) (.cse5 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet11_25|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet11_25|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet11_25|))) (.cse9 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet8_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet8_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet8_25|))) (.cse0 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet9_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet9_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet9_25|))) (.cse8 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet7_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet7_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet7_25|))) (.cse7 (fp ((_ extract 31 31) |ULTIMATE.start_g_#in~x|) ((_ extract 30 23) |ULTIMATE.start_g_#in~x|) ((_ extract 22 0) |ULTIMATE.start_g_#in~x|))) (.cse2 (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1)))) (and (= .cse0 ((_ to_fp 8 24) c_~CRM 3.0)) (= (_ +zero 8 24) .cse1) (= .cse2 (fp.div c_~CRM .cse3 .cse4)) (= (fp ((_ extract 31 31) c_ULTIMATE.start_main_~z~0) ((_ extract 30 23) c_ULTIMATE.start_main_~z~0) ((_ extract 22 0) c_ULTIMATE.start_main_~z~0)) (fp.add c_~CRM .cse5 .cse6)) (= .cse3 ((_ to_fp 8 24) c_~CRM c_ULTIMATE.start_main_~i~0)) (= .cse6 ((_ to_fp 8 24) c_~CRM 5.0)) (fp.geq .cse7 .cse1) (= .cse4 ((_ to_fp 8 24) c_~CRM 100000.0)) (= (fp.mul c_~CRM .cse8 .cse7) .cse9) (= .cse5 (fp.neg .cse7)) (= (fp.sub c_~CRM .cse9 .cse0) (fp ((_ extract 31 31) c_ULTIMATE.start_main_~y~0) ((_ extract 30 23) c_ULTIMATE.start_main_~y~0) ((_ extract 22 0) c_ULTIMATE.start_main_~y~0))) (= ((_ to_fp 8 24) c_~CRM 2.0) .cse8) (fp.leq .cse7 .cse2)))) (bvsle c_ULTIMATE.start_main_~i~0 (_ bv100000 32))) is different from false [2020-12-02 14:56:52,814 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (bvsle (bvadd c_ULTIMATE.start_main_~i~0 (_ bv4294967295 32)) (_ bv100000 32)) (exists ((|ULTIMATE.start_g_#in~x| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet12_25| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet7_25| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet11_25| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet8_25| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet9_25| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_prenex_3) ((_ extract 30 23) v_prenex_3) ((_ extract 22 0) v_prenex_3))) (.cse6 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet12_25|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet12_25|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet12_25|))) (.cse2 (fp ((_ extract 31 31) v_prenex_2) ((_ extract 30 23) v_prenex_2) ((_ extract 22 0) v_prenex_2))) (.cse4 (fp ((_ extract 31 31) v_prenex_4) ((_ extract 30 23) v_prenex_4) ((_ extract 22 0) v_prenex_4))) (.cse5 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet11_25|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet11_25|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet11_25|))) (.cse9 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet8_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet8_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet8_25|))) (.cse0 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet9_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet9_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet9_25|))) (.cse8 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet7_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet7_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet7_25|))) (.cse7 (fp ((_ extract 31 31) |ULTIMATE.start_g_#in~x|) ((_ extract 30 23) |ULTIMATE.start_g_#in~x|) ((_ extract 22 0) |ULTIMATE.start_g_#in~x|))) (.cse3 (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1)))) (and (= .cse0 ((_ to_fp 8 24) c_~CRM 3.0)) (= .cse1 ((_ to_fp 8 24) c_~CRM (bvadd c_ULTIMATE.start_main_~i~0 (_ bv4294967295 32)))) (= (_ +zero 8 24) .cse2) (= .cse3 (fp.div c_~CRM .cse1 .cse4)) (= (fp ((_ extract 31 31) c_ULTIMATE.start_main_~z~0) ((_ extract 30 23) c_ULTIMATE.start_main_~z~0) ((_ extract 22 0) c_ULTIMATE.start_main_~z~0)) (fp.add c_~CRM .cse5 .cse6)) (= .cse6 ((_ to_fp 8 24) c_~CRM 5.0)) (fp.geq .cse7 .cse2) (= .cse4 ((_ to_fp 8 24) c_~CRM 100000.0)) (= (fp.mul c_~CRM .cse8 .cse7) .cse9) (= .cse5 (fp.neg .cse7)) (= (fp.sub c_~CRM .cse9 .cse0) (fp ((_ extract 31 31) c_ULTIMATE.start_main_~y~0) ((_ extract 30 23) c_ULTIMATE.start_main_~y~0) ((_ extract 22 0) c_ULTIMATE.start_main_~y~0))) (= ((_ to_fp 8 24) c_~CRM 2.0) .cse8) (fp.leq .cse7 .cse3))))) is different from false [2020-12-02 14:56:54,923 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~i~0 (_ BitVec 32)) (|ULTIMATE.start_g_#in~x| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet12_25| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet7_25| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet11_25| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet8_25| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet9_25| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_prenex_3) ((_ extract 30 23) v_prenex_3) ((_ extract 22 0) v_prenex_3))) (.cse2 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967295 32))) (.cse7 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet12_25|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet12_25|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet12_25|))) (.cse3 (fp ((_ extract 31 31) v_prenex_2) ((_ extract 30 23) v_prenex_2) ((_ extract 22 0) v_prenex_2))) (.cse5 (fp ((_ extract 31 31) v_prenex_4) ((_ extract 30 23) v_prenex_4) ((_ extract 22 0) v_prenex_4))) (.cse6 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet11_25|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet11_25|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet11_25|))) (.cse10 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet8_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet8_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet8_25|))) (.cse0 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet9_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet9_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet9_25|))) (.cse9 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet7_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet7_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet7_25|))) (.cse8 (fp ((_ extract 31 31) |ULTIMATE.start_g_#in~x|) ((_ extract 30 23) |ULTIMATE.start_g_#in~x|) ((_ extract 22 0) |ULTIMATE.start_g_#in~x|))) (.cse4 (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1)))) (and (= .cse0 ((_ to_fp 8 24) c_~CRM 3.0)) (= .cse1 ((_ to_fp 8 24) c_~CRM .cse2)) (= (_ +zero 8 24) .cse3) (= .cse4 (fp.div c_~CRM .cse1 .cse5)) (= (fp ((_ extract 31 31) c_ULTIMATE.start_main_~z~0) ((_ extract 30 23) c_ULTIMATE.start_main_~z~0) ((_ extract 22 0) c_ULTIMATE.start_main_~z~0)) (fp.add c_~CRM .cse6 .cse7)) (bvsle .cse2 (_ bv100000 32)) (= .cse7 ((_ to_fp 8 24) c_~CRM 5.0)) (fp.geq .cse8 .cse3) (= .cse5 ((_ to_fp 8 24) c_~CRM 100000.0)) (= (fp.mul c_~CRM .cse9 .cse8) .cse10) (= .cse6 (fp.neg .cse8)) (= (fp.sub c_~CRM .cse10 .cse0) (fp ((_ extract 31 31) c_ULTIMATE.start_main_~y~0) ((_ extract 30 23) c_ULTIMATE.start_main_~y~0) ((_ extract 22 0) c_ULTIMATE.start_main_~y~0))) (= ((_ to_fp 8 24) c_~CRM 2.0) .cse9) (fp.leq .cse8 .cse4) (not (bvsle ULTIMATE.start_main_~i~0 (_ bv100000 32)))))) (= roundNearestTiesToEven c_~CRM)) is different from false [2020-12-02 14:56:57,056 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= roundNearestTiesToEven c_~CRM)) (.cse1 (exists ((ULTIMATE.start_main_~z~0 (_ BitVec 32)) (ULTIMATE.start_main_~y~0 (_ BitVec 32)) (|ULTIMATE.start_g_#in~x| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet7_25| (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet8_25| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet9_25| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (ULTIMATE.start_main_~i~0 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet35_8| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet12_25| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet36_8| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet11_25| (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) v_prenex_3) ((_ extract 30 23) v_prenex_3) ((_ extract 22 0) v_prenex_3))) (.cse4 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967295 32))) (.cse10 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet12_25|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet12_25|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet12_25|))) (.cse5 (fp ((_ extract 31 31) v_prenex_2) ((_ extract 30 23) v_prenex_2) ((_ extract 22 0) v_prenex_2))) (.cse8 (fp ((_ extract 31 31) ULTIMATE.start_main_~z~0) ((_ extract 30 23) ULTIMATE.start_main_~z~0) ((_ extract 22 0) ULTIMATE.start_main_~z~0))) (.cse7 (fp ((_ extract 31 31) v_prenex_4) ((_ extract 30 23) v_prenex_4) ((_ extract 22 0) v_prenex_4))) (.cse9 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet11_25|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet11_25|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet11_25|))) (.cse12 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet36_8|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet36_8|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet36_8|))) (.cse15 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet8_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet8_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet8_25|))) (.cse2 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet9_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet9_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet9_25|))) (.cse16 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0))) (.cse14 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet7_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet7_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet7_25|))) (.cse11 (fp ((_ extract 31 31) |ULTIMATE.start_g_#in~x|) ((_ extract 30 23) |ULTIMATE.start_g_#in~x|) ((_ extract 22 0) |ULTIMATE.start_g_#in~x|))) (.cse6 (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1))) (.cse17 ((_ to_fp 8 24) c_~CRM 2.0)) (.cse13 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet35_8|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet35_8|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet35_8|)))) (and (= .cse2 ((_ to_fp 8 24) c_~CRM 3.0)) (= .cse3 ((_ to_fp 8 24) c_~CRM .cse4)) (= (_ +zero 8 24) .cse5) (= .cse6 (fp.div c_~CRM .cse3 .cse7)) (= .cse8 (fp.add c_~CRM .cse9 .cse10)) (bvsle .cse4 (_ bv100000 32)) (= .cse10 ((_ to_fp 8 24) c_~CRM 5.0)) (fp.geq .cse11 .cse5) (= .cse12 (fp.mul c_~CRM .cse13 .cse8)) (= .cse7 ((_ to_fp 8 24) c_~CRM 100000.0)) (= (fp.mul c_~CRM .cse14 .cse11) .cse15) (= .cse9 (fp.neg .cse11)) (= (fp.add c_~CRM .cse16 .cse12) (fp ((_ extract 31 31) c_ULTIMATE.start_main_~t~0) ((_ extract 30 23) c_ULTIMATE.start_main_~t~0) ((_ extract 22 0) c_ULTIMATE.start_main_~t~0))) (= (fp.sub c_~CRM .cse15 .cse2) .cse16) (= .cse17 .cse14) (fp.leq .cse11 .cse6) (not (bvsle ULTIMATE.start_main_~i~0 (_ bv100000 32))) (= .cse17 .cse13)))))) (or (and (not |c_ULTIMATE.start_main_#t~short40|) .cse0 (exists ((|ULTIMATE.start_main_#t~nondet38| (_ BitVec 32))) (not (fp.geq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~t~0) ((_ extract 30 23) c_ULTIMATE.start_main_~t~0) ((_ extract 22 0) c_ULTIMATE.start_main_~t~0)) (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet38|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet38|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet38|))))) .cse1) (and .cse0 |c_ULTIMATE.start_main_#t~short40| (exists ((v_prenex_5 (_ BitVec 32))) (fp.geq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~t~0) ((_ extract 30 23) c_ULTIMATE.start_main_~t~0) ((_ extract 22 0) c_ULTIMATE.start_main_~t~0)) (fp ((_ extract 31 31) v_prenex_5) ((_ extract 30 23) v_prenex_5) ((_ extract 22 0) v_prenex_5)))) .cse1))) is different from false [2020-12-02 14:56:57,100 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:56:57,113 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 14:56:57,119 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 21 disjuncts [2020-12-02 14:57:07,433 WARN L838 $PredicateComparison]: unable to prove that (or (and (not |c_ULTIMATE.start_main_#t~short40|) (exists ((ULTIMATE.start_main_~z~0 (_ BitVec 32)) (|ULTIMATE.start_main_#t~nondet39| (_ BitVec 32)) (ULTIMATE.start_main_~y~0 (_ BitVec 32)) (|ULTIMATE.start_g_#in~x| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet7_25| (_ BitVec 32)) (ULTIMATE.start_main_~t~0 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet8_25| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet9_25| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (ULTIMATE.start_main_~i~0 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet35_8| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet12_25| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet36_8| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet11_25| (_ BitVec 32))) (let ((.cse9 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967295 32))) (.cse7 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet36_8|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet36_8|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet36_8|))) (.cse1 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet7_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet7_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet7_25|))) (.cse8 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet39|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet39|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet39|))) (.cse6 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0))) (.cse0 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet8_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet8_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet8_25|))) (.cse3 (fp ((_ extract 31 31) v_prenex_2) ((_ extract 30 23) v_prenex_2) ((_ extract 22 0) v_prenex_2))) (.cse13 ((_ to_fp 8 24) roundNearestTiesToEven 2.0)) (.cse11 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet35_8|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet35_8|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet35_8|))) (.cse5 (fp ((_ extract 31 31) ULTIMATE.start_main_~t~0) ((_ extract 30 23) ULTIMATE.start_main_~t~0) ((_ extract 22 0) ULTIMATE.start_main_~t~0))) (.cse12 (fp ((_ extract 31 31) ULTIMATE.start_main_~z~0) ((_ extract 30 23) ULTIMATE.start_main_~z~0) ((_ extract 22 0) ULTIMATE.start_main_~z~0))) (.cse15 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet12_25|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet12_25|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet12_25|))) (.cse14 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet9_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet9_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet9_25|))) (.cse10 (fp ((_ extract 31 31) v_prenex_3) ((_ extract 30 23) v_prenex_3) ((_ extract 22 0) v_prenex_3))) (.cse4 (fp ((_ extract 31 31) v_prenex_4) ((_ extract 30 23) v_prenex_4) ((_ extract 22 0) v_prenex_4))) (.cse16 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet11_25|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet11_25|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet11_25|))) (.cse2 (fp ((_ extract 31 31) |ULTIMATE.start_g_#in~x|) ((_ extract 30 23) |ULTIMATE.start_g_#in~x|) ((_ extract 22 0) |ULTIMATE.start_g_#in~x|))) (.cse17 (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1)))) (and (= .cse0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (= (_ +zero 8 24) .cse3) (= .cse4 ((_ to_fp 8 24) roundNearestTiesToEven 100000.0)) (= .cse5 (fp.add roundNearestTiesToEven .cse6 .cse7)) (= .cse8 ((_ to_fp 8 24) roundNearestTiesToEven (/ 71.0 10.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven .cse9) .cse10) (bvsle .cse9 (_ bv100000 32)) (= .cse7 (fp.mul roundNearestTiesToEven .cse11 .cse12)) (= .cse13 .cse1) (not (fp.leq .cse5 .cse8)) (= .cse6 (fp.sub roundNearestTiesToEven .cse0 .cse14)) (fp.geq .cse2 .cse3) (= .cse13 .cse11) (= ((_ to_fp 8 24) roundNearestTiesToEven 5.0) .cse15) (fp.geq .cse5 (fp ((_ extract 31 31) v_prenex_5) ((_ extract 30 23) v_prenex_5) ((_ extract 22 0) v_prenex_5))) (= .cse12 (fp.add roundNearestTiesToEven .cse16 .cse15)) (= .cse14 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (= .cse17 (fp.div roundNearestTiesToEven .cse10 .cse4)) (= .cse16 (fp.neg .cse2)) (fp.leq .cse2 .cse17) (not (bvsle ULTIMATE.start_main_~i~0 (_ bv100000 32))))))) (and (exists ((ULTIMATE.start_main_~z~0 (_ BitVec 32)) (|ULTIMATE.start_main_#t~nondet39| (_ BitVec 32)) (ULTIMATE.start_main_~y~0 (_ BitVec 32)) (|ULTIMATE.start_g_#in~x| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet7_25| (_ BitVec 32)) (ULTIMATE.start_main_~t~0 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet8_25| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet9_25| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (ULTIMATE.start_main_~i~0 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet35_8| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet12_25| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet36_8| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet11_25| (_ BitVec 32))) (let ((.cse23 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet39|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet39|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet39|))) (.cse27 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967295 32))) (.cse26 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet36_8|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet36_8|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet36_8|))) (.cse19 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet7_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet7_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet7_25|))) (.cse25 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0))) (.cse18 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet8_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet8_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet8_25|))) (.cse21 (fp ((_ extract 31 31) v_prenex_2) ((_ extract 30 23) v_prenex_2) ((_ extract 22 0) v_prenex_2))) (.cse31 ((_ to_fp 8 24) roundNearestTiesToEven 2.0)) (.cse29 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet35_8|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet35_8|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet35_8|))) (.cse22 (fp ((_ extract 31 31) ULTIMATE.start_main_~t~0) ((_ extract 30 23) ULTIMATE.start_main_~t~0) ((_ extract 22 0) ULTIMATE.start_main_~t~0))) (.cse30 (fp ((_ extract 31 31) ULTIMATE.start_main_~z~0) ((_ extract 30 23) ULTIMATE.start_main_~z~0) ((_ extract 22 0) ULTIMATE.start_main_~z~0))) (.cse33 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet12_25|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet12_25|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet12_25|))) (.cse32 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet9_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet9_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet9_25|))) (.cse28 (fp ((_ extract 31 31) v_prenex_3) ((_ extract 30 23) v_prenex_3) ((_ extract 22 0) v_prenex_3))) (.cse24 (fp ((_ extract 31 31) v_prenex_4) ((_ extract 30 23) v_prenex_4) ((_ extract 22 0) v_prenex_4))) (.cse34 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet11_25|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet11_25|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet11_25|))) (.cse20 (fp ((_ extract 31 31) |ULTIMATE.start_g_#in~x|) ((_ extract 30 23) |ULTIMATE.start_g_#in~x|) ((_ extract 22 0) |ULTIMATE.start_g_#in~x|))) (.cse35 (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1)))) (and (= .cse18 (fp.mul roundNearestTiesToEven .cse19 .cse20)) (= (_ +zero 8 24) .cse21) (fp.leq .cse22 .cse23) (= .cse24 ((_ to_fp 8 24) roundNearestTiesToEven 100000.0)) (= .cse22 (fp.add roundNearestTiesToEven .cse25 .cse26)) (= .cse23 ((_ to_fp 8 24) roundNearestTiesToEven (/ 71.0 10.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven .cse27) .cse28) (bvsle .cse27 (_ bv100000 32)) (= .cse26 (fp.mul roundNearestTiesToEven .cse29 .cse30)) (= .cse31 .cse19) (= .cse25 (fp.sub roundNearestTiesToEven .cse18 .cse32)) (fp.geq .cse20 .cse21) (= .cse31 .cse29) (= ((_ to_fp 8 24) roundNearestTiesToEven 5.0) .cse33) (fp.geq .cse22 (fp ((_ extract 31 31) v_prenex_5) ((_ extract 30 23) v_prenex_5) ((_ extract 22 0) v_prenex_5))) (= .cse30 (fp.add roundNearestTiesToEven .cse34 .cse33)) (= .cse32 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (= .cse35 (fp.div roundNearestTiesToEven .cse28 .cse24)) (= .cse34 (fp.neg .cse20)) (fp.leq .cse20 .cse35) (not (bvsle ULTIMATE.start_main_~i~0 (_ bv100000 32)))))) |c_ULTIMATE.start_main_#t~short40|)) is different from false [2020-12-02 14:57:09,470 WARN L860 $PredicateComparison]: unable to prove that (or (and (not |c_ULTIMATE.start_main_#t~short40|) (exists ((ULTIMATE.start_main_~z~0 (_ BitVec 32)) (|ULTIMATE.start_main_#t~nondet39| (_ BitVec 32)) (ULTIMATE.start_main_~y~0 (_ BitVec 32)) (|ULTIMATE.start_g_#in~x| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet7_25| (_ BitVec 32)) (ULTIMATE.start_main_~t~0 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet8_25| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet9_25| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (ULTIMATE.start_main_~i~0 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet35_8| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet12_25| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet36_8| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet11_25| (_ BitVec 32))) (let ((.cse9 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967295 32))) (.cse7 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet36_8|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet36_8|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet36_8|))) (.cse1 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet7_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet7_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet7_25|))) (.cse8 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet39|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet39|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet39|))) (.cse6 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0))) (.cse0 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet8_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet8_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet8_25|))) (.cse3 (fp ((_ extract 31 31) v_prenex_2) ((_ extract 30 23) v_prenex_2) ((_ extract 22 0) v_prenex_2))) (.cse13 ((_ to_fp 8 24) roundNearestTiesToEven 2.0)) (.cse11 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet35_8|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet35_8|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet35_8|))) (.cse5 (fp ((_ extract 31 31) ULTIMATE.start_main_~t~0) ((_ extract 30 23) ULTIMATE.start_main_~t~0) ((_ extract 22 0) ULTIMATE.start_main_~t~0))) (.cse12 (fp ((_ extract 31 31) ULTIMATE.start_main_~z~0) ((_ extract 30 23) ULTIMATE.start_main_~z~0) ((_ extract 22 0) ULTIMATE.start_main_~z~0))) (.cse15 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet12_25|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet12_25|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet12_25|))) (.cse14 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet9_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet9_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet9_25|))) (.cse10 (fp ((_ extract 31 31) v_prenex_3) ((_ extract 30 23) v_prenex_3) ((_ extract 22 0) v_prenex_3))) (.cse4 (fp ((_ extract 31 31) v_prenex_4) ((_ extract 30 23) v_prenex_4) ((_ extract 22 0) v_prenex_4))) (.cse16 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet11_25|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet11_25|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet11_25|))) (.cse2 (fp ((_ extract 31 31) |ULTIMATE.start_g_#in~x|) ((_ extract 30 23) |ULTIMATE.start_g_#in~x|) ((_ extract 22 0) |ULTIMATE.start_g_#in~x|))) (.cse17 (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1)))) (and (= .cse0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (= (_ +zero 8 24) .cse3) (= .cse4 ((_ to_fp 8 24) roundNearestTiesToEven 100000.0)) (= .cse5 (fp.add roundNearestTiesToEven .cse6 .cse7)) (= .cse8 ((_ to_fp 8 24) roundNearestTiesToEven (/ 71.0 10.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven .cse9) .cse10) (bvsle .cse9 (_ bv100000 32)) (= .cse7 (fp.mul roundNearestTiesToEven .cse11 .cse12)) (= .cse13 .cse1) (not (fp.leq .cse5 .cse8)) (= .cse6 (fp.sub roundNearestTiesToEven .cse0 .cse14)) (fp.geq .cse2 .cse3) (= .cse13 .cse11) (= ((_ to_fp 8 24) roundNearestTiesToEven 5.0) .cse15) (fp.geq .cse5 (fp ((_ extract 31 31) v_prenex_5) ((_ extract 30 23) v_prenex_5) ((_ extract 22 0) v_prenex_5))) (= .cse12 (fp.add roundNearestTiesToEven .cse16 .cse15)) (= .cse14 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (= .cse17 (fp.div roundNearestTiesToEven .cse10 .cse4)) (= .cse16 (fp.neg .cse2)) (fp.leq .cse2 .cse17) (not (bvsle ULTIMATE.start_main_~i~0 (_ bv100000 32))))))) (and (exists ((ULTIMATE.start_main_~z~0 (_ BitVec 32)) (|ULTIMATE.start_main_#t~nondet39| (_ BitVec 32)) (ULTIMATE.start_main_~y~0 (_ BitVec 32)) (|ULTIMATE.start_g_#in~x| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet7_25| (_ BitVec 32)) (ULTIMATE.start_main_~t~0 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_5 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet8_25| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet9_25| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32)) (ULTIMATE.start_main_~i~0 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet35_8| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet12_25| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet36_8| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet11_25| (_ BitVec 32))) (let ((.cse23 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet39|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet39|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet39|))) (.cse27 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967295 32))) (.cse26 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet36_8|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet36_8|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet36_8|))) (.cse19 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet7_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet7_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet7_25|))) (.cse25 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0))) (.cse18 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet8_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet8_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet8_25|))) (.cse21 (fp ((_ extract 31 31) v_prenex_2) ((_ extract 30 23) v_prenex_2) ((_ extract 22 0) v_prenex_2))) (.cse31 ((_ to_fp 8 24) roundNearestTiesToEven 2.0)) (.cse29 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet35_8|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet35_8|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet35_8|))) (.cse22 (fp ((_ extract 31 31) ULTIMATE.start_main_~t~0) ((_ extract 30 23) ULTIMATE.start_main_~t~0) ((_ extract 22 0) ULTIMATE.start_main_~t~0))) (.cse30 (fp ((_ extract 31 31) ULTIMATE.start_main_~z~0) ((_ extract 30 23) ULTIMATE.start_main_~z~0) ((_ extract 22 0) ULTIMATE.start_main_~z~0))) (.cse33 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet12_25|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet12_25|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet12_25|))) (.cse32 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet9_25|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet9_25|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet9_25|))) (.cse28 (fp ((_ extract 31 31) v_prenex_3) ((_ extract 30 23) v_prenex_3) ((_ extract 22 0) v_prenex_3))) (.cse24 (fp ((_ extract 31 31) v_prenex_4) ((_ extract 30 23) v_prenex_4) ((_ extract 22 0) v_prenex_4))) (.cse34 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet11_25|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet11_25|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet11_25|))) (.cse20 (fp ((_ extract 31 31) |ULTIMATE.start_g_#in~x|) ((_ extract 30 23) |ULTIMATE.start_g_#in~x|) ((_ extract 22 0) |ULTIMATE.start_g_#in~x|))) (.cse35 (fp ((_ extract 31 31) v_prenex_1) ((_ extract 30 23) v_prenex_1) ((_ extract 22 0) v_prenex_1)))) (and (= .cse18 (fp.mul roundNearestTiesToEven .cse19 .cse20)) (= (_ +zero 8 24) .cse21) (fp.leq .cse22 .cse23) (= .cse24 ((_ to_fp 8 24) roundNearestTiesToEven 100000.0)) (= .cse22 (fp.add roundNearestTiesToEven .cse25 .cse26)) (= .cse23 ((_ to_fp 8 24) roundNearestTiesToEven (/ 71.0 10.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven .cse27) .cse28) (bvsle .cse27 (_ bv100000 32)) (= .cse26 (fp.mul roundNearestTiesToEven .cse29 .cse30)) (= .cse31 .cse19) (= .cse25 (fp.sub roundNearestTiesToEven .cse18 .cse32)) (fp.geq .cse20 .cse21) (= .cse31 .cse29) (= ((_ to_fp 8 24) roundNearestTiesToEven 5.0) .cse33) (fp.geq .cse22 (fp ((_ extract 31 31) v_prenex_5) ((_ extract 30 23) v_prenex_5) ((_ extract 22 0) v_prenex_5))) (= .cse30 (fp.add roundNearestTiesToEven .cse34 .cse33)) (= .cse32 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (= .cse35 (fp.div roundNearestTiesToEven .cse28 .cse24)) (= .cse34 (fp.neg .cse20)) (fp.leq .cse20 .cse35) (not (bvsle ULTIMATE.start_main_~i~0 (_ bv100000 32)))))) |c_ULTIMATE.start_main_#t~short40|)) is different from true [2020-12-02 14:57:09,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:57:11,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619004186] [2020-12-02 14:57:11,568 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: expecting sat or unsat [2020-12-02 14:57:11,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1908239667] [2020-12-02 14:57:11,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-12-02 14:57:11,589 WARN L195 Executor]: External (cvc4 --incremental --print-success --lang smt --rewrite-divk) stderr output: (error "Error in option parsing: can't understand option `--rewrite-divk'") Please use --help to get help on command-line options. [2020-12-02 14:57:11,590 FATAL L? ?]: Ignoring exception! de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (cvc4 --incremental --print-success --lang smt --rewrite-divk)Received EOF on stdin. stderr output: (error "Error in option parsing: can't understand option `--rewrite-divk'") Please use --help to get help on command-line options. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:222) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.createProcess(Executor.java:108) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.(Executor.java:83) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.(Scriptor.java:72) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.solverbuilder.SolverBuilder.buildScript(SolverBuilder.java:149) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.solverbuilder.SolverBuilder.buildAndInitializeSolver(SolverBuilder.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) ... 34 more [2020-12-02 14:57:11,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972810731] [2020-12-02 14:57:11,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-02 14:59:04,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-12-02 14:59:04,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-02 14:59:04,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 62 conjunts are in the unsatisfiable core [2020-12-02 14:59:04,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 14:59:05,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:59:05,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:59:05,299 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-02 14:59:05,312 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:59:07,355 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= roundNearestTiesToEven c_~CRM)) (.cse5 (bvsle c_ULTIMATE.start_main_~i~0 (_ bv100000 32)))) (or (and (exists ((|ULTIMATE.start_main_#t~nondet27| (_ BitVec 32)) (|ULTIMATE.start_main_#t~nondet25| (_ BitVec 32)) (|ULTIMATE.start_main_#t~nondet26| (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet27|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet27|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet27|))) (.cse2 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet26|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet26|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet26|))) (.cse1 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet25|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet25|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet25|)))) (and (= .cse0 (fp.div c_~CRM .cse1 .cse2)) (not (fp.leq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~x~0) ((_ extract 30 23) c_ULTIMATE.start_main_~x~0) ((_ extract 22 0) c_ULTIMATE.start_main_~x~0)) .cse0)) (= .cse2 ((_ to_fp 8 24) c_~CRM 100000.0)) (= .cse1 ((_ to_fp 8 24) c_~CRM c_ULTIMATE.start_main_~i~0))))) .cse3 (exists ((|ULTIMATE.start_main_#t~nondet24| (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet24|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet24|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet24|)))) (and (fp.geq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~x~0) ((_ extract 30 23) c_ULTIMATE.start_main_~x~0) ((_ extract 22 0) c_ULTIMATE.start_main_~x~0)) .cse4) (= .cse4 (_ +zero 8 24))))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5) (and .cse3 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (exists ((v_prenex_7 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_prenex_7) ((_ extract 30 23) v_prenex_7) ((_ extract 22 0) v_prenex_7)))) (and (= (_ +zero 8 24) .cse6) (fp.geq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~x~0) ((_ extract 30 23) c_ULTIMATE.start_main_~x~0) ((_ extract 22 0) c_ULTIMATE.start_main_~x~0)) .cse6)))) (exists ((v_prenex_8 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32))) (let ((.cse9 (fp ((_ extract 31 31) v_prenex_6) ((_ extract 30 23) v_prenex_6) ((_ extract 22 0) v_prenex_6))) (.cse8 (fp ((_ extract 31 31) v_prenex_8) ((_ extract 30 23) v_prenex_8) ((_ extract 22 0) v_prenex_8))) (.cse7 (fp ((_ extract 31 31) v_prenex_9) ((_ extract 30 23) v_prenex_9) ((_ extract 22 0) v_prenex_9)))) (and (= .cse7 ((_ to_fp 8 24) c_~CRM 100000.0)) (= .cse8 ((_ to_fp 8 24) c_~CRM c_ULTIMATE.start_main_~i~0)) (fp.leq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~x~0) ((_ extract 30 23) c_ULTIMATE.start_main_~x~0) ((_ extract 22 0) c_ULTIMATE.start_main_~x~0)) .cse9) (= .cse9 (fp.div c_~CRM .cse8 .cse7))))) .cse5))) is different from false [2020-12-02 14:59:09,419 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((v_prenex_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_prenex_7) ((_ extract 30 23) v_prenex_7) ((_ extract 22 0) v_prenex_7)))) (and (= (_ +zero 8 24) .cse0) (fp.geq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~x~0) ((_ extract 30 23) c_ULTIMATE.start_main_~x~0) ((_ extract 22 0) c_ULTIMATE.start_main_~x~0)) .cse0)))) (exists ((v_prenex_8 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) v_prenex_6) ((_ extract 30 23) v_prenex_6) ((_ extract 22 0) v_prenex_6))) (.cse2 (fp ((_ extract 31 31) v_prenex_8) ((_ extract 30 23) v_prenex_8) ((_ extract 22 0) v_prenex_8))) (.cse1 (fp ((_ extract 31 31) v_prenex_9) ((_ extract 30 23) v_prenex_9) ((_ extract 22 0) v_prenex_9)))) (and (= .cse1 ((_ to_fp 8 24) c_~CRM 100000.0)) (= .cse2 ((_ to_fp 8 24) c_~CRM c_ULTIMATE.start_main_~i~0)) (fp.leq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~x~0) ((_ extract 30 23) c_ULTIMATE.start_main_~x~0) ((_ extract 22 0) c_ULTIMATE.start_main_~x~0)) .cse3) (= .cse3 (fp.div c_~CRM .cse2 .cse1))))) (bvsle c_ULTIMATE.start_main_~i~0 (_ bv100000 32))) is different from false [2020-12-02 14:59:11,489 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((v_prenex_7 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_prenex_7) ((_ extract 30 23) v_prenex_7) ((_ extract 22 0) v_prenex_7)))) (and (= (_ +zero 8 24) .cse0) (fp.geq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~x~0) ((_ extract 30 23) c_ULTIMATE.start_main_~x~0) ((_ extract 22 0) c_ULTIMATE.start_main_~x~0)) .cse0)))) (exists ((|v_ULTIMATE.start_f_#t~nondet9_28| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet8_28| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet7_28| (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet9_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet9_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet9_28|))) (.cse1 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet8_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet8_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet8_28|))) (.cse3 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet7_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet7_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet7_28|)))) (and (= (fp.sub c_~CRM .cse1 .cse2) (fp ((_ extract 31 31) |c_ULTIMATE.start_f_#res|) ((_ extract 30 23) |c_ULTIMATE.start_f_#res|) ((_ extract 22 0) |c_ULTIMATE.start_f_#res|))) (= .cse2 ((_ to_fp 8 24) c_~CRM 3.0)) (= ((_ to_fp 8 24) c_~CRM 2.0) .cse3) (= .cse1 (fp.mul c_~CRM .cse3 (fp ((_ extract 31 31) c_ULTIMATE.start_main_~x~0) ((_ extract 30 23) c_ULTIMATE.start_main_~x~0) ((_ extract 22 0) c_ULTIMATE.start_main_~x~0))))))) (exists ((v_prenex_8 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) v_prenex_6) ((_ extract 30 23) v_prenex_6) ((_ extract 22 0) v_prenex_6))) (.cse5 (fp ((_ extract 31 31) v_prenex_8) ((_ extract 30 23) v_prenex_8) ((_ extract 22 0) v_prenex_8))) (.cse4 (fp ((_ extract 31 31) v_prenex_9) ((_ extract 30 23) v_prenex_9) ((_ extract 22 0) v_prenex_9)))) (and (= .cse4 ((_ to_fp 8 24) c_~CRM 100000.0)) (= .cse5 ((_ to_fp 8 24) c_~CRM c_ULTIMATE.start_main_~i~0)) (fp.leq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~x~0) ((_ extract 30 23) c_ULTIMATE.start_main_~x~0) ((_ extract 22 0) c_ULTIMATE.start_main_~x~0)) .cse6) (= .cse6 (fp.div c_~CRM .cse5 .cse4))))) (bvsle c_ULTIMATE.start_main_~i~0 (_ bv100000 32))) is different from false [2020-12-02 14:59:13,578 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_8 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet9_28| (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (ULTIMATE.start_g_~x (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet11_28| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet7_28| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet8_28| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet12_28| (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet7_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet7_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet7_28|))) (.cse1 (fp ((_ extract 31 31) v_prenex_8) ((_ extract 30 23) v_prenex_8) ((_ extract 22 0) v_prenex_8))) (.cse0 (fp ((_ extract 31 31) v_prenex_9) ((_ extract 30 23) v_prenex_9) ((_ extract 22 0) v_prenex_9))) (.cse7 (fp ((_ extract 31 31) v_prenex_6) ((_ extract 30 23) v_prenex_6) ((_ extract 22 0) v_prenex_6))) (.cse6 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet12_28|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet12_28|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet12_28|))) (.cse8 (fp ((_ extract 31 31) v_prenex_7) ((_ extract 30 23) v_prenex_7) ((_ extract 22 0) v_prenex_7))) (.cse3 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet8_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet8_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet8_28|))) (.cse2 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet9_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet9_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet9_28|))) (.cse9 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet11_28|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet11_28|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet11_28|))) (.cse5 (fp ((_ extract 31 31) ULTIMATE.start_g_~x) ((_ extract 30 23) ULTIMATE.start_g_~x) ((_ extract 22 0) ULTIMATE.start_g_~x)))) (and (= .cse0 ((_ to_fp 8 24) c_~CRM 100000.0)) (= .cse1 ((_ to_fp 8 24) c_~CRM c_ULTIMATE.start_main_~i~0)) (= .cse2 ((_ to_fp 8 24) c_~CRM 3.0)) (= .cse3 (fp.mul c_~CRM .cse4 .cse5)) (= ((_ to_fp 8 24) c_~CRM 2.0) .cse4) (= .cse6 ((_ to_fp 8 24) c_~CRM 5.0)) (= .cse7 (fp.div c_~CRM .cse1 .cse0)) (fp.leq .cse5 .cse7) (= (_ +zero 8 24) .cse8) (= (fp.add c_~CRM .cse9 .cse6) (fp ((_ extract 31 31) |c_ULTIMATE.start_g_#res|) ((_ extract 30 23) |c_ULTIMATE.start_g_#res|) ((_ extract 22 0) |c_ULTIMATE.start_g_#res|))) (fp.geq .cse5 .cse8) (= (fp.sub c_~CRM .cse3 .cse2) (fp ((_ extract 31 31) c_ULTIMATE.start_main_~y~0) ((_ extract 30 23) c_ULTIMATE.start_main_~y~0) ((_ extract 22 0) c_ULTIMATE.start_main_~y~0))) (= .cse9 (fp.neg .cse5))))) (= roundNearestTiesToEven c_~CRM) (bvsle c_ULTIMATE.start_main_~i~0 (_ bv100000 32))) is different from false [2020-12-02 14:59:15,667 WARN L838 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (exists ((v_prenex_8 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet9_28| (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (ULTIMATE.start_g_~x (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet11_28| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet12_28| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet7_28| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet8_28| (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet7_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet7_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet7_28|))) (.cse1 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet12_28|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet12_28|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet12_28|))) (.cse3 (fp ((_ extract 31 31) v_prenex_8) ((_ extract 30 23) v_prenex_8) ((_ extract 22 0) v_prenex_8))) (.cse2 (fp ((_ extract 31 31) v_prenex_9) ((_ extract 30 23) v_prenex_9) ((_ extract 22 0) v_prenex_9))) (.cse8 (fp ((_ extract 31 31) v_prenex_6) ((_ extract 30 23) v_prenex_6) ((_ extract 22 0) v_prenex_6))) (.cse9 (fp ((_ extract 31 31) v_prenex_7) ((_ extract 30 23) v_prenex_7) ((_ extract 22 0) v_prenex_7))) (.cse5 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet8_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet8_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet8_28|))) (.cse4 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet9_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet9_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet9_28|))) (.cse0 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet11_28|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet11_28|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet11_28|))) (.cse7 (fp ((_ extract 31 31) ULTIMATE.start_g_~x) ((_ extract 30 23) ULTIMATE.start_g_~x) ((_ extract 22 0) ULTIMATE.start_g_~x)))) (and (= (fp.add c_~CRM .cse0 .cse1) (fp ((_ extract 31 31) c_ULTIMATE.start_main_~z~0) ((_ extract 30 23) c_ULTIMATE.start_main_~z~0) ((_ extract 22 0) c_ULTIMATE.start_main_~z~0))) (= .cse2 ((_ to_fp 8 24) c_~CRM 100000.0)) (= .cse3 ((_ to_fp 8 24) c_~CRM c_ULTIMATE.start_main_~i~0)) (= .cse4 ((_ to_fp 8 24) c_~CRM 3.0)) (= .cse5 (fp.mul c_~CRM .cse6 .cse7)) (= ((_ to_fp 8 24) c_~CRM 2.0) .cse6) (= .cse1 ((_ to_fp 8 24) c_~CRM 5.0)) (= .cse8 (fp.div c_~CRM .cse3 .cse2)) (fp.leq .cse7 .cse8) (= (_ +zero 8 24) .cse9) (fp.geq .cse7 .cse9) (= (fp.sub c_~CRM .cse5 .cse4) (fp ((_ extract 31 31) c_ULTIMATE.start_main_~y~0) ((_ extract 30 23) c_ULTIMATE.start_main_~y~0) ((_ extract 22 0) c_ULTIMATE.start_main_~y~0))) (= .cse0 (fp.neg .cse7))))) (bvsle c_ULTIMATE.start_main_~i~0 (_ bv100000 32))) is different from false [2020-12-02 14:59:17,764 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_8 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet9_28| (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (ULTIMATE.start_g_~x (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet11_28| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet12_28| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet7_28| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet8_28| (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet7_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet7_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet7_28|))) (.cse2 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet12_28|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet12_28|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet12_28|))) (.cse0 (fp ((_ extract 31 31) v_prenex_8) ((_ extract 30 23) v_prenex_8) ((_ extract 22 0) v_prenex_8))) (.cse3 (fp ((_ extract 31 31) v_prenex_9) ((_ extract 30 23) v_prenex_9) ((_ extract 22 0) v_prenex_9))) (.cse8 (fp ((_ extract 31 31) v_prenex_6) ((_ extract 30 23) v_prenex_6) ((_ extract 22 0) v_prenex_6))) (.cse9 (fp ((_ extract 31 31) v_prenex_7) ((_ extract 30 23) v_prenex_7) ((_ extract 22 0) v_prenex_7))) (.cse5 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet8_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet8_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet8_28|))) (.cse4 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet9_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet9_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet9_28|))) (.cse1 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet11_28|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet11_28|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet11_28|))) (.cse7 (fp ((_ extract 31 31) ULTIMATE.start_g_~x) ((_ extract 30 23) ULTIMATE.start_g_~x) ((_ extract 22 0) ULTIMATE.start_g_~x)))) (and (= .cse0 ((_ to_fp 8 24) c_~CRM (bvadd c_ULTIMATE.start_main_~i~0 (_ bv4294967295 32)))) (= (fp.add c_~CRM .cse1 .cse2) (fp ((_ extract 31 31) c_ULTIMATE.start_main_~z~0) ((_ extract 30 23) c_ULTIMATE.start_main_~z~0) ((_ extract 22 0) c_ULTIMATE.start_main_~z~0))) (= .cse3 ((_ to_fp 8 24) c_~CRM 100000.0)) (= .cse4 ((_ to_fp 8 24) c_~CRM 3.0)) (= .cse5 (fp.mul c_~CRM .cse6 .cse7)) (= ((_ to_fp 8 24) c_~CRM 2.0) .cse6) (= .cse2 ((_ to_fp 8 24) c_~CRM 5.0)) (= .cse8 (fp.div c_~CRM .cse0 .cse3)) (fp.leq .cse7 .cse8) (= (_ +zero 8 24) .cse9) (fp.geq .cse7 .cse9) (= (fp.sub c_~CRM .cse5 .cse4) (fp ((_ extract 31 31) c_ULTIMATE.start_main_~y~0) ((_ extract 30 23) c_ULTIMATE.start_main_~y~0) ((_ extract 22 0) c_ULTIMATE.start_main_~y~0))) (= .cse1 (fp.neg .cse7))))) (= roundNearestTiesToEven c_~CRM) (bvsle (bvadd c_ULTIMATE.start_main_~i~0 (_ bv4294967295 32)) (_ bv100000 32))) is different from false [2020-12-02 14:59:19,845 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~i~0 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet9_28| (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (ULTIMATE.start_g_~x (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet11_28| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet12_28| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet7_28| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet8_28| (_ BitVec 32))) (let ((.cse7 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet7_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet7_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet7_28|))) (.cse3 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet12_28|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet12_28|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet12_28|))) (.cse0 (fp ((_ extract 31 31) v_prenex_8) ((_ extract 30 23) v_prenex_8) ((_ extract 22 0) v_prenex_8))) (.cse4 (fp ((_ extract 31 31) v_prenex_9) ((_ extract 30 23) v_prenex_9) ((_ extract 22 0) v_prenex_9))) (.cse1 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967295 32))) (.cse9 (fp ((_ extract 31 31) v_prenex_6) ((_ extract 30 23) v_prenex_6) ((_ extract 22 0) v_prenex_6))) (.cse10 (fp ((_ extract 31 31) v_prenex_7) ((_ extract 30 23) v_prenex_7) ((_ extract 22 0) v_prenex_7))) (.cse6 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet8_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet8_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet8_28|))) (.cse5 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet9_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet9_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet9_28|))) (.cse2 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet11_28|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet11_28|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet11_28|))) (.cse8 (fp ((_ extract 31 31) ULTIMATE.start_g_~x) ((_ extract 30 23) ULTIMATE.start_g_~x) ((_ extract 22 0) ULTIMATE.start_g_~x)))) (and (= .cse0 ((_ to_fp 8 24) c_~CRM .cse1)) (= (fp.add c_~CRM .cse2 .cse3) (fp ((_ extract 31 31) c_ULTIMATE.start_main_~z~0) ((_ extract 30 23) c_ULTIMATE.start_main_~z~0) ((_ extract 22 0) c_ULTIMATE.start_main_~z~0))) (= .cse4 ((_ to_fp 8 24) c_~CRM 100000.0)) (= .cse5 ((_ to_fp 8 24) c_~CRM 3.0)) (= .cse6 (fp.mul c_~CRM .cse7 .cse8)) (= ((_ to_fp 8 24) c_~CRM 2.0) .cse7) (= .cse3 ((_ to_fp 8 24) c_~CRM 5.0)) (= .cse9 (fp.div c_~CRM .cse0 .cse4)) (bvsle .cse1 (_ bv100000 32)) (fp.leq .cse8 .cse9) (= (_ +zero 8 24) .cse10) (fp.geq .cse8 .cse10) (= (fp.sub c_~CRM .cse6 .cse5) (fp ((_ extract 31 31) c_ULTIMATE.start_main_~y~0) ((_ extract 30 23) c_ULTIMATE.start_main_~y~0) ((_ extract 22 0) c_ULTIMATE.start_main_~y~0))) (= .cse2 (fp.neg .cse8)) (not (bvsle ULTIMATE.start_main_~i~0 (_ bv100000 32)))))) (= roundNearestTiesToEven c_~CRM)) is different from false [2020-12-02 14:59:19,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:59:21,949 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((ULTIMATE.start_main_~z~0 (_ BitVec 32)) (ULTIMATE.start_main_~y~0 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet9_28| (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (ULTIMATE.start_g_~x (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet7_28| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet8_28| (_ BitVec 32)) (ULTIMATE.start_main_~i~0 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet36_9| (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet35_9| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet11_28| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet12_28| (_ BitVec 32))) (let ((.cse11 ((_ to_fp 8 24) c_~CRM 2.0)) (.cse14 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet7_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet7_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet7_28|))) (.cse7 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet12_28|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet12_28|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet12_28|))) (.cse4 (fp ((_ extract 31 31) v_prenex_8) ((_ extract 30 23) v_prenex_8) ((_ extract 22 0) v_prenex_8))) (.cse9 (fp ((_ extract 31 31) v_prenex_9) ((_ extract 30 23) v_prenex_9) ((_ extract 22 0) v_prenex_9))) (.cse5 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967295 32))) (.cse16 (fp ((_ extract 31 31) v_prenex_6) ((_ extract 30 23) v_prenex_6) ((_ extract 22 0) v_prenex_6))) (.cse17 (fp ((_ extract 31 31) v_prenex_7) ((_ extract 30 23) v_prenex_7) ((_ extract 22 0) v_prenex_7))) (.cse13 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet8_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet8_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet8_28|))) (.cse12 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet9_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet9_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet9_28|))) (.cse18 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0))) (.cse6 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet11_28|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet11_28|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet11_28|))) (.cse15 (fp ((_ extract 31 31) ULTIMATE.start_g_~x) ((_ extract 30 23) ULTIMATE.start_g_~x) ((_ extract 22 0) ULTIMATE.start_g_~x))) (.cse19 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet36_9|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet36_9|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet36_9|))) (.cse10 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet35_9|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet35_9|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet35_9|))) (.cse8 (fp ((_ extract 31 31) ULTIMATE.start_main_~z~0) ((_ extract 30 23) ULTIMATE.start_main_~z~0) ((_ extract 22 0) ULTIMATE.start_main_~z~0)))) (and (= .cse4 ((_ to_fp 8 24) c_~CRM .cse5)) (= (fp.add c_~CRM .cse6 .cse7) .cse8) (= .cse9 ((_ to_fp 8 24) c_~CRM 100000.0)) (= .cse10 .cse11) (= .cse12 ((_ to_fp 8 24) c_~CRM 3.0)) (= .cse13 (fp.mul c_~CRM .cse14 .cse15)) (= .cse11 .cse14) (= .cse7 ((_ to_fp 8 24) c_~CRM 5.0)) (= .cse16 (fp.div c_~CRM .cse4 .cse9)) (bvsle .cse5 (_ bv100000 32)) (fp.leq .cse15 .cse16) (= (_ +zero 8 24) .cse17) (fp.geq .cse15 .cse17) (= (fp.sub c_~CRM .cse13 .cse12) .cse18) (= (fp.add c_~CRM .cse18 .cse19) (fp ((_ extract 31 31) c_ULTIMATE.start_main_~t~0) ((_ extract 30 23) c_ULTIMATE.start_main_~t~0) ((_ extract 22 0) c_ULTIMATE.start_main_~t~0))) (= .cse6 (fp.neg .cse15)) (= .cse19 (fp.mul c_~CRM .cse10 .cse8)) (not (bvsle ULTIMATE.start_main_~i~0 (_ bv100000 32))))))) (.cse1 (= roundNearestTiesToEven c_~CRM))) (or (and .cse0 .cse1 |c_ULTIMATE.start_main_#t~short40| (exists ((|ULTIMATE.start_main_#t~nondet38| (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet38|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet38|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet38|)))) (and (= ((_ to_fp 8 24) c_~CRM (/ 69.0 10.0)) .cse2) (fp.geq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~t~0) ((_ extract 30 23) c_ULTIMATE.start_main_~t~0) ((_ extract 22 0) c_ULTIMATE.start_main_~t~0)) .cse2))))) (and .cse0 (not |c_ULTIMATE.start_main_#t~short40|) .cse1 (exists ((|ULTIMATE.start_main_#t~nondet38| (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet38|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet38|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet38|)))) (and (= ((_ to_fp 8 24) c_~CRM (/ 69.0 10.0)) .cse3) (not (fp.geq (fp ((_ extract 31 31) c_ULTIMATE.start_main_~t~0) ((_ extract 30 23) c_ULTIMATE.start_main_~t~0) ((_ extract 22 0) c_ULTIMATE.start_main_~t~0)) .cse3)))))))) is different from false [2020-12-02 14:59:21,981 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:59:21,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-02 14:59:21,984 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 22 disjuncts [2020-12-02 14:59:32,298 WARN L838 $PredicateComparison]: unable to prove that (or (and |c_ULTIMATE.start_main_#t~short40| (exists ((|ULTIMATE.start_main_#t~nondet38| (_ BitVec 32)) (ULTIMATE.start_main_~z~0 (_ BitVec 32)) (|ULTIMATE.start_main_#t~nondet39| (_ BitVec 32)) (ULTIMATE.start_main_~y~0 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet9_28| (_ BitVec 32)) (ULTIMATE.start_main_~t~0 (_ BitVec 32)) (ULTIMATE.start_g_~x (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet8_28| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet7_28| (_ BitVec 32)) (ULTIMATE.start_main_~i~0 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet36_9| (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet35_9| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet11_28| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet12_28| (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_prenex_8) ((_ extract 30 23) v_prenex_8) ((_ extract 22 0) v_prenex_8))) (.cse5 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet39|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet39|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet39|))) (.cse6 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet38|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet38|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet38|))) (.cse2 (fp ((_ extract 31 31) v_prenex_9) ((_ extract 30 23) v_prenex_9) ((_ extract 22 0) v_prenex_9))) (.cse3 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967295 32))) (.cse0 (fp ((_ extract 31 31) v_prenex_6) ((_ extract 30 23) v_prenex_6) ((_ extract 22 0) v_prenex_6))) (.cse15 (fp ((_ extract 31 31) v_prenex_7) ((_ extract 30 23) v_prenex_7) ((_ extract 22 0) v_prenex_7))) (.cse11 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet35_9|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet35_9|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet35_9|))) (.cse12 (fp ((_ extract 31 31) ULTIMATE.start_main_~z~0) ((_ extract 30 23) ULTIMATE.start_main_~z~0) ((_ extract 22 0) ULTIMATE.start_main_~z~0))) (.cse17 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet11_28|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet11_28|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet11_28|))) (.cse14 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet12_28|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet12_28|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet12_28|))) (.cse9 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet9_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet9_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet9_28|))) (.cse16 ((_ to_fp 8 24) roundNearestTiesToEven 2.0)) (.cse7 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0))) (.cse10 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet36_9|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet36_9|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet36_9|))) (.cse4 (fp ((_ extract 31 31) ULTIMATE.start_main_~t~0) ((_ extract 30 23) ULTIMATE.start_main_~t~0) ((_ extract 22 0) ULTIMATE.start_main_~t~0))) (.cse8 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet8_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet8_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet8_28|))) (.cse18 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet7_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet7_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet7_28|))) (.cse13 (fp ((_ extract 31 31) ULTIMATE.start_g_~x) ((_ extract 30 23) ULTIMATE.start_g_~x) ((_ extract 22 0) ULTIMATE.start_g_~x)))) (and (= .cse0 (fp.div roundNearestTiesToEven .cse1 .cse2)) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven .cse3)) (fp.leq .cse4 .cse5) (fp.geq .cse4 .cse6) (= .cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 71.0 10.0))) (= .cse7 (fp.sub roundNearestTiesToEven .cse8 .cse9)) (= ((_ to_fp 8 24) roundNearestTiesToEven (/ 69.0 10.0)) .cse6) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven 100000.0)) (bvsle .cse3 (_ bv100000 32)) (= .cse10 (fp.mul roundNearestTiesToEven .cse11 .cse12)) (fp.leq .cse13 .cse0) (= .cse14 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (= (_ +zero 8 24) .cse15) (fp.geq .cse13 .cse15) (= .cse16 .cse11) (= .cse17 (fp.neg .cse13)) (= .cse12 (fp.add roundNearestTiesToEven .cse17 .cse14)) (= ((_ to_fp 8 24) roundNearestTiesToEven 3.0) .cse9) (= .cse16 .cse18) (= (fp.add roundNearestTiesToEven .cse7 .cse10) .cse4) (= .cse8 (fp.mul roundNearestTiesToEven .cse18 .cse13)) (not (bvsle ULTIMATE.start_main_~i~0 (_ bv100000 32))))))) (and (not |c_ULTIMATE.start_main_#t~short40|) (exists ((|ULTIMATE.start_main_#t~nondet38| (_ BitVec 32)) (ULTIMATE.start_main_~z~0 (_ BitVec 32)) (|ULTIMATE.start_main_#t~nondet39| (_ BitVec 32)) (ULTIMATE.start_main_~y~0 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet9_28| (_ BitVec 32)) (ULTIMATE.start_main_~t~0 (_ BitVec 32)) (ULTIMATE.start_g_~x (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet8_28| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet7_28| (_ BitVec 32)) (ULTIMATE.start_main_~i~0 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet36_9| (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet35_9| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet11_28| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet12_28| (_ BitVec 32))) (let ((.cse20 (fp ((_ extract 31 31) v_prenex_8) ((_ extract 30 23) v_prenex_8) ((_ extract 22 0) v_prenex_8))) (.cse24 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet38|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet38|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet38|))) (.cse21 (fp ((_ extract 31 31) v_prenex_9) ((_ extract 30 23) v_prenex_9) ((_ extract 22 0) v_prenex_9))) (.cse22 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967295 32))) (.cse25 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet39|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet39|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet39|))) (.cse19 (fp ((_ extract 31 31) v_prenex_6) ((_ extract 30 23) v_prenex_6) ((_ extract 22 0) v_prenex_6))) (.cse34 (fp ((_ extract 31 31) v_prenex_7) ((_ extract 30 23) v_prenex_7) ((_ extract 22 0) v_prenex_7))) (.cse30 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet35_9|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet35_9|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet35_9|))) (.cse31 (fp ((_ extract 31 31) ULTIMATE.start_main_~z~0) ((_ extract 30 23) ULTIMATE.start_main_~z~0) ((_ extract 22 0) ULTIMATE.start_main_~z~0))) (.cse36 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet11_28|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet11_28|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet11_28|))) (.cse33 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet12_28|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet12_28|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet12_28|))) (.cse28 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet9_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet9_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet9_28|))) (.cse35 ((_ to_fp 8 24) roundNearestTiesToEven 2.0)) (.cse26 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0))) (.cse29 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet36_9|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet36_9|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet36_9|))) (.cse23 (fp ((_ extract 31 31) ULTIMATE.start_main_~t~0) ((_ extract 30 23) ULTIMATE.start_main_~t~0) ((_ extract 22 0) ULTIMATE.start_main_~t~0))) (.cse27 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet8_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet8_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet8_28|))) (.cse37 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet7_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet7_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet7_28|))) (.cse32 (fp ((_ extract 31 31) ULTIMATE.start_g_~x) ((_ extract 30 23) ULTIMATE.start_g_~x) ((_ extract 22 0) ULTIMATE.start_g_~x)))) (and (= .cse19 (fp.div roundNearestTiesToEven .cse20 .cse21)) (= .cse20 ((_ to_fp 8 24) roundNearestTiesToEven .cse22)) (fp.geq .cse23 .cse24) (= .cse25 ((_ to_fp 8 24) roundNearestTiesToEven (/ 71.0 10.0))) (= .cse26 (fp.sub roundNearestTiesToEven .cse27 .cse28)) (= ((_ to_fp 8 24) roundNearestTiesToEven (/ 69.0 10.0)) .cse24) (= .cse21 ((_ to_fp 8 24) roundNearestTiesToEven 100000.0)) (bvsle .cse22 (_ bv100000 32)) (= .cse29 (fp.mul roundNearestTiesToEven .cse30 .cse31)) (not (fp.leq .cse23 .cse25)) (fp.leq .cse32 .cse19) (= .cse33 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (= (_ +zero 8 24) .cse34) (fp.geq .cse32 .cse34) (= .cse35 .cse30) (= .cse36 (fp.neg .cse32)) (= .cse31 (fp.add roundNearestTiesToEven .cse36 .cse33)) (= ((_ to_fp 8 24) roundNearestTiesToEven 3.0) .cse28) (= .cse35 .cse37) (= (fp.add roundNearestTiesToEven .cse26 .cse29) .cse23) (= .cse27 (fp.mul roundNearestTiesToEven .cse37 .cse32)) (not (bvsle ULTIMATE.start_main_~i~0 (_ bv100000 32)))))))) is different from false [2020-12-02 14:59:34,337 WARN L860 $PredicateComparison]: unable to prove that (or (and |c_ULTIMATE.start_main_#t~short40| (exists ((|ULTIMATE.start_main_#t~nondet38| (_ BitVec 32)) (ULTIMATE.start_main_~z~0 (_ BitVec 32)) (|ULTIMATE.start_main_#t~nondet39| (_ BitVec 32)) (ULTIMATE.start_main_~y~0 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet9_28| (_ BitVec 32)) (ULTIMATE.start_main_~t~0 (_ BitVec 32)) (ULTIMATE.start_g_~x (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet8_28| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet7_28| (_ BitVec 32)) (ULTIMATE.start_main_~i~0 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet36_9| (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet35_9| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet11_28| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet12_28| (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_prenex_8) ((_ extract 30 23) v_prenex_8) ((_ extract 22 0) v_prenex_8))) (.cse5 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet39|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet39|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet39|))) (.cse6 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet38|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet38|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet38|))) (.cse2 (fp ((_ extract 31 31) v_prenex_9) ((_ extract 30 23) v_prenex_9) ((_ extract 22 0) v_prenex_9))) (.cse3 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967295 32))) (.cse0 (fp ((_ extract 31 31) v_prenex_6) ((_ extract 30 23) v_prenex_6) ((_ extract 22 0) v_prenex_6))) (.cse15 (fp ((_ extract 31 31) v_prenex_7) ((_ extract 30 23) v_prenex_7) ((_ extract 22 0) v_prenex_7))) (.cse11 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet35_9|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet35_9|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet35_9|))) (.cse12 (fp ((_ extract 31 31) ULTIMATE.start_main_~z~0) ((_ extract 30 23) ULTIMATE.start_main_~z~0) ((_ extract 22 0) ULTIMATE.start_main_~z~0))) (.cse17 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet11_28|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet11_28|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet11_28|))) (.cse14 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet12_28|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet12_28|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet12_28|))) (.cse9 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet9_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet9_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet9_28|))) (.cse16 ((_ to_fp 8 24) roundNearestTiesToEven 2.0)) (.cse7 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0))) (.cse10 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet36_9|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet36_9|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet36_9|))) (.cse4 (fp ((_ extract 31 31) ULTIMATE.start_main_~t~0) ((_ extract 30 23) ULTIMATE.start_main_~t~0) ((_ extract 22 0) ULTIMATE.start_main_~t~0))) (.cse8 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet8_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet8_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet8_28|))) (.cse18 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet7_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet7_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet7_28|))) (.cse13 (fp ((_ extract 31 31) ULTIMATE.start_g_~x) ((_ extract 30 23) ULTIMATE.start_g_~x) ((_ extract 22 0) ULTIMATE.start_g_~x)))) (and (= .cse0 (fp.div roundNearestTiesToEven .cse1 .cse2)) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven .cse3)) (fp.leq .cse4 .cse5) (fp.geq .cse4 .cse6) (= .cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 71.0 10.0))) (= .cse7 (fp.sub roundNearestTiesToEven .cse8 .cse9)) (= ((_ to_fp 8 24) roundNearestTiesToEven (/ 69.0 10.0)) .cse6) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven 100000.0)) (bvsle .cse3 (_ bv100000 32)) (= .cse10 (fp.mul roundNearestTiesToEven .cse11 .cse12)) (fp.leq .cse13 .cse0) (= .cse14 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (= (_ +zero 8 24) .cse15) (fp.geq .cse13 .cse15) (= .cse16 .cse11) (= .cse17 (fp.neg .cse13)) (= .cse12 (fp.add roundNearestTiesToEven .cse17 .cse14)) (= ((_ to_fp 8 24) roundNearestTiesToEven 3.0) .cse9) (= .cse16 .cse18) (= (fp.add roundNearestTiesToEven .cse7 .cse10) .cse4) (= .cse8 (fp.mul roundNearestTiesToEven .cse18 .cse13)) (not (bvsle ULTIMATE.start_main_~i~0 (_ bv100000 32))))))) (and (not |c_ULTIMATE.start_main_#t~short40|) (exists ((|ULTIMATE.start_main_#t~nondet38| (_ BitVec 32)) (ULTIMATE.start_main_~z~0 (_ BitVec 32)) (|ULTIMATE.start_main_#t~nondet39| (_ BitVec 32)) (ULTIMATE.start_main_~y~0 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet9_28| (_ BitVec 32)) (ULTIMATE.start_main_~t~0 (_ BitVec 32)) (ULTIMATE.start_g_~x (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet8_28| (_ BitVec 32)) (|v_ULTIMATE.start_f_#t~nondet7_28| (_ BitVec 32)) (ULTIMATE.start_main_~i~0 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet36_9| (_ BitVec 32)) (v_prenex_9 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~nondet35_9| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet11_28| (_ BitVec 32)) (|v_ULTIMATE.start_g_#t~nondet12_28| (_ BitVec 32))) (let ((.cse20 (fp ((_ extract 31 31) v_prenex_8) ((_ extract 30 23) v_prenex_8) ((_ extract 22 0) v_prenex_8))) (.cse24 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet38|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet38|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet38|))) (.cse21 (fp ((_ extract 31 31) v_prenex_9) ((_ extract 30 23) v_prenex_9) ((_ extract 22 0) v_prenex_9))) (.cse22 (bvadd ULTIMATE.start_main_~i~0 (_ bv4294967295 32))) (.cse25 (fp ((_ extract 31 31) |ULTIMATE.start_main_#t~nondet39|) ((_ extract 30 23) |ULTIMATE.start_main_#t~nondet39|) ((_ extract 22 0) |ULTIMATE.start_main_#t~nondet39|))) (.cse19 (fp ((_ extract 31 31) v_prenex_6) ((_ extract 30 23) v_prenex_6) ((_ extract 22 0) v_prenex_6))) (.cse34 (fp ((_ extract 31 31) v_prenex_7) ((_ extract 30 23) v_prenex_7) ((_ extract 22 0) v_prenex_7))) (.cse30 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet35_9|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet35_9|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet35_9|))) (.cse31 (fp ((_ extract 31 31) ULTIMATE.start_main_~z~0) ((_ extract 30 23) ULTIMATE.start_main_~z~0) ((_ extract 22 0) ULTIMATE.start_main_~z~0))) (.cse36 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet11_28|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet11_28|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet11_28|))) (.cse33 (fp ((_ extract 31 31) |v_ULTIMATE.start_g_#t~nondet12_28|) ((_ extract 30 23) |v_ULTIMATE.start_g_#t~nondet12_28|) ((_ extract 22 0) |v_ULTIMATE.start_g_#t~nondet12_28|))) (.cse28 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet9_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet9_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet9_28|))) (.cse35 ((_ to_fp 8 24) roundNearestTiesToEven 2.0)) (.cse26 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0))) (.cse29 (fp ((_ extract 31 31) |v_ULTIMATE.start_main_#t~nondet36_9|) ((_ extract 30 23) |v_ULTIMATE.start_main_#t~nondet36_9|) ((_ extract 22 0) |v_ULTIMATE.start_main_#t~nondet36_9|))) (.cse23 (fp ((_ extract 31 31) ULTIMATE.start_main_~t~0) ((_ extract 30 23) ULTIMATE.start_main_~t~0) ((_ extract 22 0) ULTIMATE.start_main_~t~0))) (.cse27 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet8_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet8_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet8_28|))) (.cse37 (fp ((_ extract 31 31) |v_ULTIMATE.start_f_#t~nondet7_28|) ((_ extract 30 23) |v_ULTIMATE.start_f_#t~nondet7_28|) ((_ extract 22 0) |v_ULTIMATE.start_f_#t~nondet7_28|))) (.cse32 (fp ((_ extract 31 31) ULTIMATE.start_g_~x) ((_ extract 30 23) ULTIMATE.start_g_~x) ((_ extract 22 0) ULTIMATE.start_g_~x)))) (and (= .cse19 (fp.div roundNearestTiesToEven .cse20 .cse21)) (= .cse20 ((_ to_fp 8 24) roundNearestTiesToEven .cse22)) (fp.geq .cse23 .cse24) (= .cse25 ((_ to_fp 8 24) roundNearestTiesToEven (/ 71.0 10.0))) (= .cse26 (fp.sub roundNearestTiesToEven .cse27 .cse28)) (= ((_ to_fp 8 24) roundNearestTiesToEven (/ 69.0 10.0)) .cse24) (= .cse21 ((_ to_fp 8 24) roundNearestTiesToEven 100000.0)) (bvsle .cse22 (_ bv100000 32)) (= .cse29 (fp.mul roundNearestTiesToEven .cse30 .cse31)) (not (fp.leq .cse23 .cse25)) (fp.leq .cse32 .cse19) (= .cse33 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (= (_ +zero 8 24) .cse34) (fp.geq .cse32 .cse34) (= .cse35 .cse30) (= .cse36 (fp.neg .cse32)) (= .cse31 (fp.add roundNearestTiesToEven .cse36 .cse33)) (= ((_ to_fp 8 24) roundNearestTiesToEven 3.0) .cse28) (= .cse35 .cse37) (= (fp.add roundNearestTiesToEven .cse26 .cse29) .cse23) (= .cse27 (fp.mul roundNearestTiesToEven .cse37 .cse32)) (not (bvsle ULTIMATE.start_main_~i~0 (_ bv100000 32)))))))) is different from true [2020-12-02 14:59:34,356 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 14:59:36,427 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: expecting sat or unsat [2020-12-02 14:59:36,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-12-02 14:59:36,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-12-02 14:59:36,427 ERROR L205 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2020-12-02 14:59:36,428 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 14:59:36,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-02 14:59:36,895 WARN L254 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-12-02 14:59:36,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:59:36 BoogieIcfgContainer [2020-12-02 14:59:36,896 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 14:59:36,897 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 14:59:36,897 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 14:59:36,899 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 14:59:36,900 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:56:10" (3/4) ... [2020-12-02 14:59:36,907 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-02 14:59:36,907 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 14:59:36,909 INFO L168 Benchmark]: Toolchain (without parser) took 211150.43 ms. Allocated memory was 44.0 MB in the beginning and 69.2 MB in the end (delta: 25.2 MB). Free memory was 19.5 MB in the beginning and 38.8 MB in the end (delta: -19.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.1 GB. [2020-12-02 14:59:36,910 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 44.0 MB. Free memory was 29.0 MB in the beginning and 29.0 MB in the end (delta: 23.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 14:59:36,912 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.17 ms. Allocated memory is still 56.6 MB. Free memory was 41.0 MB in the beginning and 29.8 MB in the end (delta: 11.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-02 14:59:36,914 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.93 ms. Allocated memory is still 56.6 MB. Free memory was 29.8 MB in the beginning and 27.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 14:59:36,915 INFO L168 Benchmark]: Boogie Preprocessor took 103.66 ms. Allocated memory is still 56.6 MB. Free memory was 27.6 MB in the beginning and 39.2 MB in the end (delta: -11.6 MB). Peak memory consumption was 3.4 MB. Max. memory is 16.1 GB. [2020-12-02 14:59:36,916 INFO L168 Benchmark]: RCFGBuilder took 4354.18 ms. Allocated memory is still 56.6 MB. Free memory was 39.2 MB in the beginning and 36.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-12-02 14:59:36,920 INFO L168 Benchmark]: TraceAbstraction took 206242.28 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 35.7 MB in the beginning and 38.8 MB in the end (delta: -3.0 MB). Peak memory consumption was 32.7 MB. Max. memory is 16.1 GB. [2020-12-02 14:59:36,920 INFO L168 Benchmark]: Witness Printer took 10.57 ms. Allocated memory is still 69.2 MB. Free memory is still 38.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 14:59:36,925 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.28 ms. Allocated memory is still 44.0 MB. Free memory was 29.0 MB in the beginning and 29.0 MB in the end (delta: 23.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 337.17 ms. Allocated memory is still 56.6 MB. Free memory was 41.0 MB in the beginning and 29.8 MB in the end (delta: 11.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 81.93 ms. Allocated memory is still 56.6 MB. Free memory was 29.8 MB in the beginning and 27.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 103.66 ms. Allocated memory is still 56.6 MB. Free memory was 27.6 MB in the beginning and 39.2 MB in the end (delta: -11.6 MB). Peak memory consumption was 3.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4354.18 ms. Allocated memory is still 56.6 MB. Free memory was 39.2 MB in the beginning and 36.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 206242.28 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 35.7 MB in the beginning and 38.8 MB in the end (delta: -3.0 MB). Peak memory consumption was 32.7 MB. Max. memory is 16.1 GB. * Witness Printer took 10.57 ms. Allocated memory is still 69.2 MB. Free memory is still 38.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 15]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L29] int i; [L30] float x,y,z,t,u,v; [L31] EXPR 0.f [L19] EXPR 2.f [L19] EXPR 2.f * x [L19] EXPR 3.f [L19] EXPR 2.f * x - 3.f [L19] return 2.f * x - 3.f; [L31] y = f(0.f) [L32] EXPR 0.f [L24] EXPR -x [L24] EXPR 5.f [L24] EXPR -x + 5.f [L24] return -x + 5.f; [L32] z = g(0.f) [L33] EXPR .75f [L19] EXPR 2.f [L19] EXPR 2.f * x [L19] EXPR 3.f [L19] EXPR 2.f * x - 3.f [L19] return 2.f * x - 3.f; [L33] u = f(.75f) [L34] EXPR .25f [L24] EXPR -x [L24] EXPR 5.f [L24] EXPR -x + 5.f [L24] return -x + 5.f; [L34] v = g(.25f) [L36] i = 1 [L36] COND TRUE i <= 100000 [L38] x = __VERIFIER_nondet_float() [L39] EXPR 0.f [L39] x >= 0.f && x <= (float)i / 100000.f [L39] EXPR (float)i [L39] EXPR 100000.f [L39] EXPR (float)i / 100000.f [L39] x >= 0.f && x <= (float)i / 100000.f [L13] COND FALSE !(!cond) [L19] EXPR 2.f [L19] EXPR 2.f * x [L19] EXPR 3.f [L19] EXPR 2.f * x - 3.f [L19] return 2.f * x - 3.f; [L41] y = f(x) [L24] EXPR -x [L24] EXPR 5.f [L24] EXPR -x + 5.f [L24] return -x + 5.f; [L42] z = g(x) [L19] EXPR 2.f [L19] EXPR 2.f * x [L19] EXPR 3.f [L19] EXPR 2.f * x - 3.f [L19] return 2.f * x - 3.f; [L43] u = f(v) [L24] EXPR -x [L24] EXPR 5.f [L24] EXPR -x + 5.f [L24] return -x + 5.f; [L44] EXPR 2.f [L44] EXPR g(u) / 2.f [L44] v = g(u) / 2.f [L36] i++ [L36] COND TRUE i <= 100000 [L38] x = __VERIFIER_nondet_float() [L39] EXPR 0.f [L39] x >= 0.f && x <= (float)i / 100000.f [L39] EXPR (float)i [L39] EXPR 100000.f [L39] EXPR (float)i / 100000.f [L39] x >= 0.f && x <= (float)i / 100000.f [L13] COND FALSE !(!cond) [L19] EXPR 2.f [L19] EXPR 2.f * x [L19] EXPR 3.f [L19] EXPR 2.f * x - 3.f [L19] return 2.f * x - 3.f; [L41] y = f(x) [L24] EXPR -x [L24] EXPR 5.f [L24] EXPR -x + 5.f [L24] return -x + 5.f; [L42] z = g(x) [L19] EXPR 2.f [L19] EXPR 2.f * x [L19] EXPR 3.f [L19] EXPR 2.f * x - 3.f [L19] return 2.f * x - 3.f; [L43] u = f(v) [L24] EXPR -x [L24] EXPR 5.f [L24] EXPR -x + 5.f [L24] return -x + 5.f; [L44] EXPR 2.f [L44] EXPR g(u) / 2.f [L44] v = g(u) / 2.f [L36] i++ [L36] COND TRUE i <= 100000 [L38] x = __VERIFIER_nondet_float() [L39] EXPR 0.f [L39] x >= 0.f && x <= (float)i / 100000.f [L39] EXPR (float)i [L39] EXPR 100000.f [L39] EXPR (float)i / 100000.f [L39] x >= 0.f && x <= (float)i / 100000.f [L13] COND FALSE !(!cond) [L19] EXPR 2.f [L19] EXPR 2.f * x [L19] EXPR 3.f [L19] EXPR 2.f * x - 3.f [L19] return 2.f * x - 3.f; [L41] y = f(x) [L24] EXPR -x [L24] EXPR 5.f [L24] EXPR -x + 5.f [L24] return -x + 5.f; [L42] z = g(x) [L19] EXPR 2.f [L19] EXPR 2.f * x [L19] EXPR 3.f [L19] EXPR 2.f * x - 3.f [L19] return 2.f * x - 3.f; [L43] u = f(v) [L24] EXPR -x [L24] EXPR 5.f [L24] EXPR -x + 5.f [L24] return -x + 5.f; [L44] EXPR 2.f [L44] EXPR g(u) / 2.f [L44] v = g(u) / 2.f [L36] i++ [L36] COND TRUE i <= 100000 [L38] x = __VERIFIER_nondet_float() [L39] EXPR 0.f [L39] x >= 0.f && x <= (float)i / 100000.f [L39] EXPR (float)i [L39] EXPR 100000.f [L39] EXPR (float)i / 100000.f [L39] x >= 0.f && x <= (float)i / 100000.f [L13] COND FALSE !(!cond) [L19] EXPR 2.f [L19] EXPR 2.f * x [L19] EXPR 3.f [L19] EXPR 2.f * x - 3.f [L19] return 2.f * x - 3.f; [L41] y = f(x) [L24] EXPR -x [L24] EXPR 5.f [L24] EXPR -x + 5.f [L24] return -x + 5.f; [L42] z = g(x) [L19] EXPR 2.f [L19] EXPR 2.f * x [L19] EXPR 3.f [L19] EXPR 2.f * x - 3.f [L19] return 2.f * x - 3.f; [L43] u = f(v) [L24] EXPR -x [L24] EXPR 5.f [L24] EXPR -x + 5.f [L24] return -x + 5.f; [L44] EXPR 2.f [L44] EXPR g(u) / 2.f [L44] v = g(u) / 2.f [L36] i++ [L36] COND TRUE i <= 100000 [L38] x = __VERIFIER_nondet_float() [L39] EXPR 0.f [L39] x >= 0.f && x <= (float)i / 100000.f [L39] EXPR (float)i [L39] EXPR 100000.f [L39] EXPR (float)i / 100000.f [L39] x >= 0.f && x <= (float)i / 100000.f [L13] COND FALSE !(!cond) [L19] EXPR 2.f [L19] EXPR 2.f * x [L19] EXPR 3.f [L19] EXPR 2.f * x - 3.f [L19] return 2.f * x - 3.f; [L41] y = f(x) [L24] EXPR -x [L24] EXPR 5.f [L24] EXPR -x + 5.f [L24] return -x + 5.f; [L42] z = g(x) [L19] EXPR 2.f [L19] EXPR 2.f * x [L19] EXPR 3.f [L19] EXPR 2.f * x - 3.f [L19] return 2.f * x - 3.f; [L43] u = f(v) [L24] EXPR -x [L24] EXPR 5.f [L24] EXPR -x + 5.f [L24] return -x + 5.f; [L44] EXPR 2.f [L44] EXPR g(u) / 2.f [L44] v = g(u) / 2.f [L36] i++ [L36] COND TRUE i <= 100000 [L38] x = __VERIFIER_nondet_float() [L39] EXPR 0.f [L39] x >= 0.f && x <= (float)i / 100000.f [L39] EXPR (float)i [L39] EXPR 100000.f [L39] EXPR (float)i / 100000.f [L39] x >= 0.f && x <= (float)i / 100000.f [L13] COND FALSE !(!cond) [L19] EXPR 2.f [L19] EXPR 2.f * x [L19] EXPR 3.f [L19] EXPR 2.f * x - 3.f [L19] return 2.f * x - 3.f; [L41] y = f(x) [L24] EXPR -x [L24] EXPR 5.f [L24] EXPR -x + 5.f [L24] return -x + 5.f; [L42] z = g(x) [L19] EXPR 2.f [L19] EXPR 2.f * x [L19] EXPR 3.f [L19] EXPR 2.f * x - 3.f [L19] return 2.f * x - 3.f; [L43] u = f(v) [L24] EXPR -x [L24] EXPR 5.f [L24] EXPR -x + 5.f [L24] return -x + 5.f; [L44] EXPR 2.f [L44] EXPR g(u) / 2.f [L44] v = g(u) / 2.f [L36] i++ [L36] COND TRUE i <= 100000 [L38] x = __VERIFIER_nondet_float() [L39] EXPR 0.f [L39] x >= 0.f && x <= (float)i / 100000.f [L39] EXPR (float)i [L39] EXPR 100000.f [L39] EXPR (float)i / 100000.f [L39] x >= 0.f && x <= (float)i / 100000.f [L13] COND FALSE !(!cond) [L19] EXPR 2.f [L19] EXPR 2.f * x [L19] EXPR 3.f [L19] EXPR 2.f * x - 3.f [L19] return 2.f * x - 3.f; [L41] y = f(x) [L24] EXPR -x [L24] EXPR 5.f [L24] EXPR -x + 5.f [L24] return -x + 5.f; [L42] z = g(x) [L19] EXPR 2.f [L19] EXPR 2.f * x [L19] EXPR 3.f [L19] EXPR 2.f * x - 3.f [L19] return 2.f * x - 3.f; [L43] u = f(v) [L24] EXPR -x [L24] EXPR 5.f [L24] EXPR -x + 5.f [L24] return -x + 5.f; [L44] EXPR 2.f [L44] EXPR g(u) / 2.f [L44] v = g(u) / 2.f [L36] i++ [L36] COND FALSE !(i <= 100000) [L47] EXPR 2.f [L47] EXPR 2.f * z [L47] EXPR y + 2.f * z [L47] t = y + 2.f * z [L48] EXPR 6.9f [L48] t >= 6.9f && t <= 7.1f [L48] EXPR 7.1f [L48] t >= 6.9f && t <= 7.1f [L15] COND TRUE !(cond) [L15] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 206.1s, OverallIterations: 4, TraceHistogramMax: 7, AutomataDifference: 15.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 107 SDtfs, 125 SDslu, 343 SDs, 0 SdLazy, 97 SolverSat, 14 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 15.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=3, 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, 3 MinimizatonAttempts, 84 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 14362 SizeOfPredicates, 3 NumberOfNonLiveVariables, 358 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 0/68 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...